/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:11:35,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:11:35,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:11:35,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:11:35,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:11:35,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:11:35,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:11:35,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:11:35,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:11:35,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:11:35,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:11:35,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:11:35,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:11:35,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:11:35,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:11:35,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:11:35,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:11:35,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:11:35,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:11:35,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:11:35,830 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:11:35,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:11:35,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:11:35,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:11:35,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:11:35,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:11:35,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:11:35,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:11:35,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:11:35,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:11:35,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:11:35,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:11:35,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:11:35,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:11:35,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:11:35,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:11:35,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:11:35,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:11:35,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:11:35,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:11:35,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:11:35,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:11:35,860 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:11:35,869 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:11:35,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:11:35,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:11:35,870 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:11:35,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:11:35,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:11:35,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:11:35,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:11:35,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:11:35,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:11:35,871 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:11:35,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:11:35,871 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:11:35,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:11:35,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:11:35,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:11:35,871 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:11:35,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:11:35,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:11:35,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:11:35,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:11:35,872 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:11:35,872 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:11:35,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:11:35,872 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:11:35,872 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-15 06:11:36,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:11:36,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:11:36,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:11:36,229 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:11:36,230 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:11:36,231 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-15 06:11:36,322 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428bb07bf/15bbfafdcea64a089bc82fb077ad10b9/FLAGfa84fa14b [2022-04-15 06:11:36,862 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:11:36,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2022-04-15 06:11:36,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428bb07bf/15bbfafdcea64a089bc82fb077ad10b9/FLAGfa84fa14b [2022-04-15 06:11:37,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428bb07bf/15bbfafdcea64a089bc82fb077ad10b9 [2022-04-15 06:11:37,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:11:37,276 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:11:37,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:11:37,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:11:37,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:11:37,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:11:37" (1/1) ... [2022-04-15 06:11:37,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1742c2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:37, skipping insertion in model container [2022-04-15 06:11:37,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:11:37" (1/1) ... [2022-04-15 06:11:37,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:11:37,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:11:37,656 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-15 06:11:37,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:11:37,708 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:11:37,732 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-15 06:11:37,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:11:37,770 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:11:37,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:37 WrapperNode [2022-04-15 06:11:37,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:11:37,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:11:37,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:11:37,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:11:37,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:37" (1/1) ... [2022-04-15 06:11:37,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:37" (1/1) ... [2022-04-15 06:11:37,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:37" (1/1) ... [2022-04-15 06:11:37,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:37" (1/1) ... [2022-04-15 06:11:37,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:37" (1/1) ... [2022-04-15 06:11:37,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:37" (1/1) ... [2022-04-15 06:11:37,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:37" (1/1) ... [2022-04-15 06:11:37,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:11:37,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:11:37,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:11:37,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:11:37,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:37" (1/1) ... [2022-04-15 06:11:37,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:11:37,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:11:37,832 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-15 06:11:37,851 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-15 06:11:37,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:11:37,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:11:37,865 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:11:37,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:11:37,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:11:37,866 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:11:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:11:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:11:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 06:11:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 06:11:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:11:37,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:11:37,868 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:11:37,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:11:37,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:11:37,868 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:11:37,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:11:37,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:11:37,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:11:37,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:11:37,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:11:37,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:11:37,955 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:11:37,956 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:11:38,210 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:11:38,215 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:11:38,216 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 06:11:38,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:11:38 BoogieIcfgContainer [2022-04-15 06:11:38,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:11:38,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:11:38,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:11:38,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:11:38,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:11:37" (1/3) ... [2022-04-15 06:11:38,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194d920b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:11:38, skipping insertion in model container [2022-04-15 06:11:38,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:37" (2/3) ... [2022-04-15 06:11:38,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194d920b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:11:38, skipping insertion in model container [2022-04-15 06:11:38,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:11:38" (3/3) ... [2022-04-15 06:11:38,226 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2022-04-15 06:11:38,229 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:11:38,229 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:11:38,264 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:11:38,272 INFO L340 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 [2022-04-15 06:11:38,272 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:11:38,288 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-15 06:11:38,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:11:38,293 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:38,293 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:38,294 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:11:38,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:38,297 INFO L85 PathProgramCache]: Analyzing trace with hash -250128701, now seen corresponding path program 1 times [2022-04-15 06:11:38,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:38,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2056115868] [2022-04-15 06:11:38,312 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:38,312 INFO L85 PathProgramCache]: Analyzing trace with hash -250128701, now seen corresponding path program 2 times [2022-04-15 06:11:38,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:38,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282539224] [2022-04-15 06:11:38,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:38,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:38,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:38,642 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-15 06:11:38,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2022-04-15 06:11:38,643 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #138#return; {47#true} is VALID [2022-04-15 06:11:38,645 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-15 06:11:38,645 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-15 06:11:38,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2022-04-15 06:11:38,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #138#return; {47#true} is VALID [2022-04-15 06:11:38,646 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-15 06:11:38,646 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-15 06:11:38,647 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-15 06:11:38,647 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-15 06:11:38,648 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-15 06:11:38,649 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-15 06:11:38,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {52#(<= 1 main_~r~0)} assume !(~l~0 > 1); {52#(<= 1 main_~r~0)} is VALID [2022-04-15 06:11:38,651 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-15 06:11:38,651 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-15 06:11:38,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {54#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {48#false} is VALID [2022-04-15 06:11:38,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {48#false} assume !false; {48#false} is VALID [2022-04-15 06:11:38,652 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-15 06:11:38,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:38,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282539224] [2022-04-15 06:11:38,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282539224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:38,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:38,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:38,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:38,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2056115868] [2022-04-15 06:11:38,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2056115868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:38,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:38,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:38,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815451425] [2022-04-15 06:11:38,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:38,661 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-15 06:11:38,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:38,665 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-15 06:11:38,681 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-15 06:11:38,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:11:38,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:38,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:11:38,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:11:38,703 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-15 06:11:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:39,367 INFO L93 Difference]: Finished difference Result 88 states and 148 transitions. [2022-04-15 06:11:39,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:11:39,368 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-15 06:11:39,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:39,369 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-15 06:11:39,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-15 06:11:39,390 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-15 06:11:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-15 06:11:39,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 148 transitions. [2022-04-15 06:11:39,540 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-15 06:11:39,550 INFO L225 Difference]: With dead ends: 88 [2022-04-15 06:11:39,551 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 06:11:39,553 INFO L912 BasicCegarLoop]: 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-15 06:11:39,556 INFO L913 BasicCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:11:39,557 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 63 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:11:39,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 06:11:39,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-15 06:11:39,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:39,602 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-15 06:11:39,603 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-15 06:11:39,604 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-15 06:11:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:39,609 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-04-15 06:11:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-15 06:11:39,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:39,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:39,611 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-15 06:11:39,611 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-15 06:11:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:39,616 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-04-15 06:11:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-15 06:11:39,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:39,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:39,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:39,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:39,623 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-15 06:11:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-15 06:11:39,630 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 15 [2022-04-15 06:11:39,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:39,635 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-15 06:11:39,635 INFO L479 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-15 06:11:39,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 61 transitions. [2022-04-15 06:11:39,704 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-15 06:11:39,705 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-15 06:11:39,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:11:39,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:39,705 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:39,706 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:11:39,706 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:11:39,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:39,706 INFO L85 PathProgramCache]: Analyzing trace with hash -254865470, now seen corresponding path program 1 times [2022-04-15 06:11:39,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:39,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [353193061] [2022-04-15 06:11:39,707 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:39,707 INFO L85 PathProgramCache]: Analyzing trace with hash -254865470, now seen corresponding path program 2 times [2022-04-15 06:11:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:39,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111222646] [2022-04-15 06:11:39,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:39,807 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-15 06:11:39,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-15 06:11:39,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {417#true} {417#true} #138#return; {417#true} is VALID [2022-04-15 06:11:39,808 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-15 06:11:39,808 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-15 06:11:39,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-15 06:11:39,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #138#return; {417#true} is VALID [2022-04-15 06:11:39,808 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-15 06:11:39,809 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-15 06:11:39,809 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-15 06:11:39,809 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-15 06:11:39,809 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-15 06:11:39,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#true} assume !(~j~0 <= ~r~0); {417#true} is VALID [2022-04-15 06:11:39,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {417#true} assume ~l~0 > 1; {422#(<= 1 main_~l~0)} is VALID [2022-04-15 06:11:39,810 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-15 06:11:39,811 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-15 06:11:39,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {418#false} is VALID [2022-04-15 06:11:39,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-15 06:11:39,811 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-15 06:11:39,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:39,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111222646] [2022-04-15 06:11:39,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111222646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:39,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:39,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:39,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:39,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [353193061] [2022-04-15 06:11:39,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [353193061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:39,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:39,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:39,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383222648] [2022-04-15 06:11:39,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:39,817 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-15 06:11:39,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:39,817 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-15 06:11:39,827 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-15 06:11:39,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:11:39,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:39,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:11:39,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:11:39,829 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-15 06:11:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:40,538 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2022-04-15 06:11:40,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:11:40,538 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-15 06:11:40,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:40,539 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-15 06:11:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-15 06:11:40,542 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-15 06:11:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-15 06:11:40,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 102 transitions. [2022-04-15 06:11:40,653 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-15 06:11:40,659 INFO L225 Difference]: With dead ends: 71 [2022-04-15 06:11:40,659 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 06:11:40,660 INFO L912 BasicCegarLoop]: 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-15 06:11:40,662 INFO L913 BasicCegarLoop]: 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-15 06:11:40,662 INFO L914 BasicCegarLoop]: 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-15 06:11:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 06:11:40,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2022-04-15 06:11:40,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:40,704 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-15 06:11:40,704 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-15 06:11:40,704 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-15 06:11:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:40,710 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2022-04-15 06:11:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2022-04-15 06:11:40,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:40,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:40,712 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-15 06:11:40,712 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-15 06:11:40,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:40,721 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2022-04-15 06:11:40,721 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2022-04-15 06:11:40,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:40,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:40,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:40,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:40,723 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-15 06:11:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-15 06:11:40,725 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 15 [2022-04-15 06:11:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:40,725 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-15 06:11:40,726 INFO L479 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-15 06:11:40,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 64 transitions. [2022-04-15 06:11:40,812 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-15 06:11:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-15 06:11:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:11:40,812 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:40,812 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:40,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:11:40,813 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:11:40,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:40,814 INFO L85 PathProgramCache]: Analyzing trace with hash -216435080, now seen corresponding path program 1 times [2022-04-15 06:11:40,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:40,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1791403782] [2022-04-15 06:11:40,817 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:40,817 INFO L85 PathProgramCache]: Analyzing trace with hash -216435080, now seen corresponding path program 2 times [2022-04-15 06:11:40,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:40,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352493722] [2022-04-15 06:11:40,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:40,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:40,902 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-15 06:11:40,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {811#true} assume true; {811#true} is VALID [2022-04-15 06:11:40,903 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {811#true} {811#true} #138#return; {811#true} is VALID [2022-04-15 06:11:40,903 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-15 06:11:40,904 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-15 06:11:40,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {811#true} assume true; {811#true} is VALID [2022-04-15 06:11:40,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {811#true} {811#true} #138#return; {811#true} is VALID [2022-04-15 06:11:40,904 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-15 06:11:40,904 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-15 06:11:40,904 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-15 06:11:40,904 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-15 06:11:40,905 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-15 06:11:40,908 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-15 06:11:40,909 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-15 06:11:40,910 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-15 06:11:40,912 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-15 06:11:40,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {819#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {812#false} is VALID [2022-04-15 06:11:40,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {812#false} assume !false; {812#false} is VALID [2022-04-15 06:11:40,912 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-15 06:11:40,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:40,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352493722] [2022-04-15 06:11:40,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352493722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:40,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:40,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:40,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:40,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1791403782] [2022-04-15 06:11:40,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1791403782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:40,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:40,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:40,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722205237] [2022-04-15 06:11:40,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:40,914 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-15 06:11:40,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:40,914 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-15 06:11:40,924 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-15 06:11:40,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:11:40,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:40,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:11:40,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:40,926 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-15 06:11:41,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:41,821 INFO L93 Difference]: Finished difference Result 80 states and 115 transitions. [2022-04-15 06:11:41,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:11:41,821 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-15 06:11:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:41,822 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-15 06:11:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-15 06:11:41,825 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-15 06:11:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-15 06:11:41,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2022-04-15 06:11:41,938 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-15 06:11:41,942 INFO L225 Difference]: With dead ends: 80 [2022-04-15 06:11:41,942 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 06:11:41,943 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 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-15 06:11:41,944 INFO L913 BasicCegarLoop]: 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:11:41,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 65 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:11:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 06:11:42,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2022-04-15 06:11:42,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:42,024 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-15 06:11:42,024 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-15 06:11:42,024 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-15 06:11:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:42,030 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2022-04-15 06:11:42,030 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2022-04-15 06:11:42,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:42,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:42,031 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-15 06:11:42,032 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-15 06:11:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:42,035 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2022-04-15 06:11:42,035 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2022-04-15 06:11:42,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:42,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:42,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:42,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:42,036 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-15 06:11:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2022-04-15 06:11:42,038 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 15 [2022-04-15 06:11:42,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:42,038 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2022-04-15 06:11:42,040 INFO L479 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-15 06:11:42,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 98 transitions. [2022-04-15 06:11:42,227 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-15 06:11:42,227 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2022-04-15 06:11:42,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:11:42,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:42,228 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:42,228 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:11:42,228 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:11:42,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:42,228 INFO L85 PathProgramCache]: Analyzing trace with hash -228679181, now seen corresponding path program 1 times [2022-04-15 06:11:42,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:42,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [372858101] [2022-04-15 06:11:42,229 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:42,229 INFO L85 PathProgramCache]: Analyzing trace with hash -228679181, now seen corresponding path program 2 times [2022-04-15 06:11:42,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:42,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796722618] [2022-04-15 06:11:42,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:42,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:42,521 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-15 06:11:42,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {1287#true} assume true; {1287#true} is VALID [2022-04-15 06:11:42,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1287#true} {1287#true} #138#return; {1287#true} is VALID [2022-04-15 06:11:42,523 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-15 06:11:42,523 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-15 06:11:42,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {1287#true} assume true; {1287#true} is VALID [2022-04-15 06:11:42,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1287#true} {1287#true} #138#return; {1287#true} is VALID [2022-04-15 06:11:42,524 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-15 06:11:42,524 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-15 06:11:42,524 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-15 06:11:42,534 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-15 06:11:42,535 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-15 06:11:42,535 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-15 06:11:42,536 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-15 06:11:42,537 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-15 06:11:42,538 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-15 06:11:42,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {1295#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1288#false} is VALID [2022-04-15 06:11:42,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {1288#false} assume !false; {1288#false} is VALID [2022-04-15 06:11:42,538 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-15 06:11:42,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:42,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796722618] [2022-04-15 06:11:42,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796722618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:42,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:42,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:42,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:42,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [372858101] [2022-04-15 06:11:42,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [372858101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:42,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:42,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:42,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237189736] [2022-04-15 06:11:42,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:42,548 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-15 06:11:42,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:42,549 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-15 06:11:42,580 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-15 06:11:42,580 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:11:42,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:42,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:11:42,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:42,581 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-15 06:11:43,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:43,413 INFO L93 Difference]: Finished difference Result 122 states and 183 transitions. [2022-04-15 06:11:43,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:11:43,413 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-15 06:11:43,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:43,414 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-15 06:11:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-15 06:11:43,415 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-15 06:11:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-15 06:11:43,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2022-04-15 06:11:43,504 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-15 06:11:43,508 INFO L225 Difference]: With dead ends: 122 [2022-04-15 06:11:43,508 INFO L226 Difference]: Without dead ends: 120 [2022-04-15 06:11:43,509 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:11:43,509 INFO L913 BasicCegarLoop]: 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-15 06:11:43,509 INFO L914 BasicCegarLoop]: 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-15 06:11:43,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-15 06:11:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2022-04-15 06:11:43,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:43,612 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-15 06:11:43,613 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-15 06:11:43,613 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-15 06:11:43,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:43,619 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2022-04-15 06:11:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2022-04-15 06:11:43,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:43,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:43,620 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-15 06:11:43,620 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-15 06:11:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:43,625 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2022-04-15 06:11:43,625 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2022-04-15 06:11:43,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:43,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:43,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:43,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:43,627 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-15 06:11:43,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2022-04-15 06:11:43,635 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 15 [2022-04-15 06:11:43,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:43,635 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2022-04-15 06:11:43,635 INFO L479 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-15 06:11:43,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 140 transitions. [2022-04-15 06:11:44,226 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-15 06:11:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2022-04-15 06:11:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:11:44,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:44,228 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:44,229 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 06:11:44,229 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:11:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:44,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1266022048, now seen corresponding path program 1 times [2022-04-15 06:11:44,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:44,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [806494236] [2022-04-15 06:11:44,230 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:44,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1266022048, now seen corresponding path program 2 times [2022-04-15 06:11:44,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:44,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821068328] [2022-04-15 06:11:44,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:44,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:44,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:44,361 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-15 06:11:44,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-15 06:11:44,361 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1984#true} {1984#true} #138#return; {1984#true} is VALID [2022-04-15 06:11:44,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:11:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:44,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {1984#true} ~cond := #in~cond; {1984#true} is VALID [2022-04-15 06:11:44,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {1984#true} assume !(0 == ~cond); {1984#true} is VALID [2022-04-15 06:11:44,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-15 06:11:44,368 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-15 06:11:44,369 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-15 06:11:44,369 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-15 06:11:44,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-15 06:11:44,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1984#true} {1984#true} #138#return; {1984#true} is VALID [2022-04-15 06:11:44,369 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-15 06:11:44,375 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-15 06:11:44,375 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-15 06:11:44,376 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-15 06:11:44,376 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-15 06:11:44,376 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-15 06:11:44,377 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-15 06:11:44,377 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-15 06:11:44,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {1984#true} ~cond := #in~cond; {1984#true} is VALID [2022-04-15 06:11:44,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {1984#true} assume !(0 == ~cond); {1984#true} is VALID [2022-04-15 06:11:44,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-15 06:11:44,378 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-15 06:11:44,379 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-15 06:11:44,379 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-15 06:11:44,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {1995#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1985#false} is VALID [2022-04-15 06:11:44,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {1985#false} assume !false; {1985#false} is VALID [2022-04-15 06:11:44,380 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-15 06:11:44,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:44,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821068328] [2022-04-15 06:11:44,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821068328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:44,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:44,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:44,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:44,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [806494236] [2022-04-15 06:11:44,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [806494236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:44,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:44,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:44,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162839252] [2022-04-15 06:11:44,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:44,395 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-15 06:11:44,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:44,396 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-15 06:11:44,436 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-15 06:11:44,437 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:11:44,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:44,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:11:44,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:11:44,438 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-15 06:11:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:45,230 INFO L93 Difference]: Finished difference Result 100 states and 145 transitions. [2022-04-15 06:11:45,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:11:45,231 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-15 06:11:45,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:45,231 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-15 06:11:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-15 06:11:45,232 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-15 06:11:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-15 06:11:45,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-15 06:11:45,289 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-15 06:11:45,291 INFO L225 Difference]: With dead ends: 100 [2022-04-15 06:11:45,291 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 06:11:45,291 INFO L912 BasicCegarLoop]: 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-15 06:11:45,292 INFO L913 BasicCegarLoop]: 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-15 06:11:45,292 INFO L914 BasicCegarLoop]: 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-15 06:11:45,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 06:11:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-04-15 06:11:45,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:45,416 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-15 06:11:45,417 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-15 06:11:45,417 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-15 06:11:45,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:45,422 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-15 06:11:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-15 06:11:45,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:45,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:45,423 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-15 06:11:45,423 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-15 06:11:45,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:45,428 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-15 06:11:45,428 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-15 06:11:45,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:45,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:45,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:45,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:45,429 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-15 06:11:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2022-04-15 06:11:45,433 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 20 [2022-04-15 06:11:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:45,433 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2022-04-15 06:11:45,434 INFO L479 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-15 06:11:45,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 143 transitions. [2022-04-15 06:11:45,589 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-15 06:11:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-15 06:11:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:11:45,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:45,590 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:45,590 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 06:11:45,590 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:11:45,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:45,590 INFO L85 PathProgramCache]: Analyzing trace with hash 884659585, now seen corresponding path program 1 times [2022-04-15 06:11:45,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:45,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197404094] [2022-04-15 06:11:45,591 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:45,591 INFO L85 PathProgramCache]: Analyzing trace with hash 884659585, now seen corresponding path program 2 times [2022-04-15 06:11:45,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:45,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847860813] [2022-04-15 06:11:45,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:45,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:45,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:45,646 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-15 06:11:45,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-15 06:11:45,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2599#true} {2599#true} #138#return; {2599#true} is VALID [2022-04-15 06:11:45,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:11:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:45,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2022-04-15 06:11:45,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2022-04-15 06:11:45,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-15 06:11:45,650 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-15 06:11:45,651 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-15 06:11:45,651 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-15 06:11:45,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-15 06:11:45,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2599#true} {2599#true} #138#return; {2599#true} is VALID [2022-04-15 06:11:45,651 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-15 06:11:45,651 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-15 06:11:45,652 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-15 06:11:45,652 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-15 06:11:45,653 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-15 06:11:45,653 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-15 06:11:45,654 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-15 06:11:45,654 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-15 06:11:45,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2022-04-15 06:11:45,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2022-04-15 06:11:45,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-15 06:11:45,655 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-15 06:11:45,655 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-15 06:11:45,656 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-15 06:11:45,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {2612#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2600#false} is VALID [2022-04-15 06:11:45,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {2600#false} assume !false; {2600#false} is VALID [2022-04-15 06:11:45,656 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-15 06:11:45,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:45,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847860813] [2022-04-15 06:11:45,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847860813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:45,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:45,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:11:45,657 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:45,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197404094] [2022-04-15 06:11:45,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197404094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:45,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:45,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:11:45,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320695098] [2022-04-15 06:11:45,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:45,658 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-15 06:11:45,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:45,658 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-15 06:11:45,670 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-15 06:11:45,670 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:11:45,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:45,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:11:45,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:11:45,671 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-15 06:11:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:46,857 INFO L93 Difference]: Finished difference Result 131 states and 194 transitions. [2022-04-15 06:11:46,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:11:46,857 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-15 06:11:46,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:46,857 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-15 06:11:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-15 06:11:46,859 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-15 06:11:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-15 06:11:46,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-15 06:11:46,963 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-15 06:11:46,966 INFO L225 Difference]: With dead ends: 131 [2022-04-15 06:11:46,966 INFO L226 Difference]: Without dead ends: 129 [2022-04-15 06:11:46,966 INFO L912 BasicCegarLoop]: 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-15 06:11:46,967 INFO L913 BasicCegarLoop]: 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-15 06:11:46,967 INFO L914 BasicCegarLoop]: 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-15 06:11:46,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-15 06:11:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2022-04-15 06:11:47,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:47,252 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-15 06:11:47,253 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-15 06:11:47,253 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-15 06:11:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:47,258 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2022-04-15 06:11:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2022-04-15 06:11:47,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:47,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:47,259 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-15 06:11:47,259 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-15 06:11:47,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:47,263 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2022-04-15 06:11:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2022-04-15 06:11:47,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:47,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:47,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:47,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:47,264 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-15 06:11:47,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 189 transitions. [2022-04-15 06:11:47,268 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 189 transitions. Word has length 20 [2022-04-15 06:11:47,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:47,269 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 189 transitions. [2022-04-15 06:11:47,269 INFO L479 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-15 06:11:47,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 189 transitions. [2022-04-15 06:11:47,516 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-15 06:11:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 189 transitions. [2022-04-15 06:11:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:11:47,517 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:47,517 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:47,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 06:11:47,517 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:11:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:47,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1424204299, now seen corresponding path program 1 times [2022-04-15 06:11:47,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:47,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [54540438] [2022-04-15 06:11:47,518 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:47,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1424204299, now seen corresponding path program 2 times [2022-04-15 06:11:47,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:47,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148674334] [2022-04-15 06:11:47,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:47,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:47,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:47,589 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-15 06:11:47,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-15 06:11:47,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3400#true} {3400#true} #138#return; {3400#true} is VALID [2022-04-15 06:11:47,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:11:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:47,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {3400#true} ~cond := #in~cond; {3400#true} is VALID [2022-04-15 06:11:47,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {3400#true} assume !(0 == ~cond); {3400#true} is VALID [2022-04-15 06:11:47,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-15 06:11:47,594 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-15 06:11:47,594 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-15 06:11:47,594 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-15 06:11:47,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-15 06:11:47,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3400#true} {3400#true} #138#return; {3400#true} is VALID [2022-04-15 06:11:47,594 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-15 06:11:47,594 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-15 06:11:47,595 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-15 06:11:47,595 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-15 06:11:47,595 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-15 06:11:47,596 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-15 06:11:47,596 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-15 06:11:47,596 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-15 06:11:47,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {3400#true} ~cond := #in~cond; {3400#true} is VALID [2022-04-15 06:11:47,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {3400#true} assume !(0 == ~cond); {3400#true} is VALID [2022-04-15 06:11:47,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-15 06:11:47,597 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-15 06:11:47,597 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-15 06:11:47,599 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-15 06:11:47,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {3412#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3401#false} is VALID [2022-04-15 06:11:47,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {3401#false} assume !false; {3401#false} is VALID [2022-04-15 06:11:47,599 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-15 06:11:47,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:47,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148674334] [2022-04-15 06:11:47,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148674334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:47,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:47,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:47,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:47,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [54540438] [2022-04-15 06:11:47,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [54540438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:47,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:47,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:47,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684808393] [2022-04-15 06:11:47,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:47,600 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-15 06:11:47,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:47,601 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-15 06:11:47,618 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-15 06:11:47,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:11:47,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:47,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:11:47,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:47,619 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-15 06:11:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:48,679 INFO L93 Difference]: Finished difference Result 188 states and 291 transitions. [2022-04-15 06:11:48,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:11:48,680 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-15 06:11:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:48,680 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-15 06:11:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-15 06:11:48,682 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-15 06:11:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-15 06:11:48,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-15 06:11:48,765 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-15 06:11:48,768 INFO L225 Difference]: With dead ends: 188 [2022-04-15 06:11:48,769 INFO L226 Difference]: Without dead ends: 186 [2022-04-15 06:11:48,769 INFO L912 BasicCegarLoop]: 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-15 06:11:48,770 INFO L913 BasicCegarLoop]: 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-15 06:11:48,770 INFO L914 BasicCegarLoop]: 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-15 06:11:48,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-15 06:11:49,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2022-04-15 06:11:49,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:49,131 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-15 06:11:49,132 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-15 06:11:49,132 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-15 06:11:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:49,138 INFO L93 Difference]: Finished difference Result 186 states and 289 transitions. [2022-04-15 06:11:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2022-04-15 06:11:49,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:49,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:49,139 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-15 06:11:49,140 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-15 06:11:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:49,146 INFO L93 Difference]: Finished difference Result 186 states and 289 transitions. [2022-04-15 06:11:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2022-04-15 06:11:49,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:49,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:49,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:49,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:49,147 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-15 06:11:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 252 transitions. [2022-04-15 06:11:49,152 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 252 transitions. Word has length 20 [2022-04-15 06:11:49,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:49,152 INFO L478 AbstractCegarLoop]: Abstraction has 162 states and 252 transitions. [2022-04-15 06:11:49,152 INFO L479 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-15 06:11:49,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 162 states and 252 transitions. [2022-04-15 06:11:49,415 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-15 06:11:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 252 transitions. [2022-04-15 06:11:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:11:49,416 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:49,416 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:49,416 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 06:11:49,416 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:11:49,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:49,417 INFO L85 PathProgramCache]: Analyzing trace with hash 297853571, now seen corresponding path program 1 times [2022-04-15 06:11:49,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:49,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [609944396] [2022-04-15 06:11:49,417 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:49,417 INFO L85 PathProgramCache]: Analyzing trace with hash 297853571, now seen corresponding path program 2 times [2022-04-15 06:11:49,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:49,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048188629] [2022-04-15 06:11:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:49,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:49,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:49,461 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-15 06:11:49,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-15 06:11:49,462 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4498#true} {4498#true} #138#return; {4498#true} is VALID [2022-04-15 06:11:49,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:11:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:49,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-15 06:11:49,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-15 06:11:49,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-15 06:11:49,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4498#true} {4499#false} #130#return; {4499#false} is VALID [2022-04-15 06:11:49,466 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-15 06:11:49,466 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-15 06:11:49,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-15 06:11:49,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4498#true} {4498#true} #138#return; {4498#true} is VALID [2022-04-15 06:11:49,466 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-15 06:11:49,466 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-15 06:11:49,466 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-15 06:11:49,467 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-15 06:11:49,468 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-15 06:11:49,468 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-15 06:11:49,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {4503#(<= main_~l~0 1)} assume ~l~0 > 1; {4499#false} is VALID [2022-04-15 06:11:49,468 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-15 06:11:49,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-15 06:11:49,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-15 06:11:49,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-15 06:11:49,469 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4498#true} {4499#false} #130#return; {4499#false} is VALID [2022-04-15 06:11:49,469 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-15 06:11:49,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {4499#false} ~cond := #in~cond; {4499#false} is VALID [2022-04-15 06:11:49,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {4499#false} assume 0 == ~cond; {4499#false} is VALID [2022-04-15 06:11:49,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {4499#false} assume !false; {4499#false} is VALID [2022-04-15 06:11:49,469 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-15 06:11:49,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:49,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048188629] [2022-04-15 06:11:49,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048188629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:49,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:49,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:11:49,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:49,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [609944396] [2022-04-15 06:11:49,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [609944396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:49,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:49,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:11:49,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94146919] [2022-04-15 06:11:49,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:49,470 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-15 06:11:49,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:49,470 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-15 06:11:49,483 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-15 06:11:49,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:11:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:49,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:11:49,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:11:49,483 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-15 06:11:50,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:50,372 INFO L93 Difference]: Finished difference Result 329 states and 524 transitions. [2022-04-15 06:11:50,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:11:50,372 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-15 06:11:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:50,372 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-15 06:11:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-15 06:11:50,374 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-15 06:11:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-15 06:11:50,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-15 06:11:50,490 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-15 06:11:50,495 INFO L225 Difference]: With dead ends: 329 [2022-04-15 06:11:50,496 INFO L226 Difference]: Without dead ends: 239 [2022-04-15 06:11:50,496 INFO L912 BasicCegarLoop]: 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-15 06:11:50,497 INFO L913 BasicCegarLoop]: 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-15 06:11:50,497 INFO L914 BasicCegarLoop]: 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-15 06:11:50,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-15 06:11:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 209. [2022-04-15 06:11:52,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:52,282 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-15 06:11:52,282 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-15 06:11:52,283 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-15 06:11:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:52,293 INFO L93 Difference]: Finished difference Result 239 states and 389 transitions. [2022-04-15 06:11:52,294 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2022-04-15 06:11:52,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:52,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:52,300 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-15 06:11:52,300 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-15 06:11:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:52,313 INFO L93 Difference]: Finished difference Result 239 states and 389 transitions. [2022-04-15 06:11:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2022-04-15 06:11:52,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:52,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:52,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:52,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:52,316 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-15 06:11:52,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 336 transitions. [2022-04-15 06:11:52,326 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 336 transitions. Word has length 20 [2022-04-15 06:11:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:52,326 INFO L478 AbstractCegarLoop]: Abstraction has 209 states and 336 transitions. [2022-04-15 06:11:52,327 INFO L479 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-15 06:11:52,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 209 states and 336 transitions. [2022-04-15 06:11:52,846 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-15 06:11:52,847 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 336 transitions. [2022-04-15 06:11:52,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 06:11:52,847 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:52,847 INFO L499 BasicCegarLoop]: 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-15 06:11:52,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 06:11:52,848 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:11:52,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash 288094237, now seen corresponding path program 1 times [2022-04-15 06:11:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:52,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [164722292] [2022-04-15 06:11:52,848 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash 288094237, now seen corresponding path program 2 times [2022-04-15 06:11:52,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:52,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070249655] [2022-04-15 06:11:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:52,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:52,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:52,964 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-15 06:11:52,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-15 06:11:52,964 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6067#true} {6067#true} #138#return; {6067#true} is VALID [2022-04-15 06:11:52,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:11:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:52,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-15 06:11:52,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-15 06:11:52,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-15 06:11:52,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #118#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-15 06:11:52,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:11:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:52,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-15 06:11:52,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-15 06:11:52,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-15 06:11:52,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #120#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-15 06:11:52,992 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-15 06:11:52,992 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-15 06:11:52,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-15 06:11:52,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6067#true} #138#return; {6067#true} is VALID [2022-04-15 06:11:52,993 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-15 06:11:52,993 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-15 06:11:52,993 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-15 06:11:52,996 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-15 06:11:52,997 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-15 06:11:52,997 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-15 06:11:52,997 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-15 06:11:52,997 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-15 06:11:52,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-15 06:11:52,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-15 06:11:52,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-15 06:11:52,998 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #118#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-15 06:11:52,998 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-15 06:11:52,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-15 06:11:52,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-15 06:11:52,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-15 06:11:52,999 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #120#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-15 06:11:52,999 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-15 06:11:52,999 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-15 06:11:53,000 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-15 06:11:53,000 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-15 06:11:53,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {6083#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6068#false} is VALID [2022-04-15 06:11:53,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {6068#false} assume !false; {6068#false} is VALID [2022-04-15 06:11:53,001 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-15 06:11:53,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:53,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070249655] [2022-04-15 06:11:53,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070249655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:53,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:53,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:53,002 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:53,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [164722292] [2022-04-15 06:11:53,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [164722292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:53,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:53,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:53,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913791766] [2022-04-15 06:11:53,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:53,003 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-15 06:11:53,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:53,003 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-15 06:11:53,019 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-15 06:11:53,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:11:53,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:53,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:11:53,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:53,020 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-15 06:11:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:55,061 INFO L93 Difference]: Finished difference Result 275 states and 448 transitions. [2022-04-15 06:11:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:11:55,062 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-15 06:11:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:55,062 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-15 06:11:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-15 06:11:55,065 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-15 06:11:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-15 06:11:55,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2022-04-15 06:11:55,237 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-15 06:11:55,243 INFO L225 Difference]: With dead ends: 275 [2022-04-15 06:11:55,244 INFO L226 Difference]: Without dead ends: 273 [2022-04-15 06:11:55,244 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 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-15 06:11:55,246 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 81 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:11:55,246 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 61 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:11:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-15 06:11:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 249. [2022-04-15 06:11:56,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:56,179 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-15 06:11:56,180 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-15 06:11:56,181 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-15 06:11:56,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:56,219 INFO L93 Difference]: Finished difference Result 273 states and 446 transitions. [2022-04-15 06:11:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 446 transitions. [2022-04-15 06:11:56,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:56,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:56,221 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-15 06:11:56,222 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-15 06:11:56,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:56,252 INFO L93 Difference]: Finished difference Result 273 states and 446 transitions. [2022-04-15 06:11:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 446 transitions. [2022-04-15 06:11:56,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:56,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:56,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:56,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:56,255 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-15 06:11:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 405 transitions. [2022-04-15 06:11:56,290 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 405 transitions. Word has length 27 [2022-04-15 06:11:56,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:56,291 INFO L478 AbstractCegarLoop]: Abstraction has 249 states and 405 transitions. [2022-04-15 06:11:56,291 INFO L479 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-15 06:11:56,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 249 states and 405 transitions. [2022-04-15 06:11:56,839 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-15 06:11:56,839 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 405 transitions. [2022-04-15 06:11:56,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:11:56,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:56,840 INFO L499 BasicCegarLoop]: 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-15 06:11:56,840 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 06:11:56,840 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:11:56,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:56,841 INFO L85 PathProgramCache]: Analyzing trace with hash -870562259, now seen corresponding path program 1 times [2022-04-15 06:11:56,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:56,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [179135597] [2022-04-15 06:11:56,841 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:11:56,841 INFO L85 PathProgramCache]: Analyzing trace with hash -870562259, now seen corresponding path program 2 times [2022-04-15 06:11:56,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:56,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739285966] [2022-04-15 06:11:56,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:56,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:56,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:56,938 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-15 06:11:56,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-15 06:11:56,938 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7694#true} {7694#true} #138#return; {7694#true} is VALID [2022-04-15 06:11:56,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:11:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:56,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-15 06:11:56,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-15 06:11:56,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-15 06:11:56,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7695#false} #130#return; {7695#false} is VALID [2022-04-15 06:11:56,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:11:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:56,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-15 06:11:56,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-15 06:11:56,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-15 06:11:56,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7695#false} #132#return; {7695#false} is VALID [2022-04-15 06:11:56,968 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-15 06:11:56,968 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-15 06:11:56,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-15 06:11:56,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7694#true} #138#return; {7694#true} is VALID [2022-04-15 06:11:56,968 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-15 06:11:56,969 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-15 06:11:56,969 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-15 06:11:56,974 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-15 06:11:56,975 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-15 06:11:56,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {7701#(<= main_~j~0 main_~r~0)} assume !(~j~0 <= ~r~0); {7695#false} is VALID [2022-04-15 06:11:56,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {7695#false} assume ~l~0 > 1; {7695#false} is VALID [2022-04-15 06:11:56,979 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-15 06:11:56,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-15 06:11:56,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-15 06:11:56,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-15 06:11:56,980 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7694#true} {7695#false} #130#return; {7695#false} is VALID [2022-04-15 06:11:56,980 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-15 06:11:56,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-15 06:11:56,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-15 06:11:56,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-15 06:11:56,980 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7694#true} {7695#false} #132#return; {7695#false} is VALID [2022-04-15 06:11:56,980 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-15 06:11:56,980 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-15 06:11:56,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {7695#false} assume !!(~j~0 <= ~r~0); {7695#false} is VALID [2022-04-15 06:11:56,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {7695#false} assume ~j~0 < ~r~0; {7695#false} is VALID [2022-04-15 06:11:56,980 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-15 06:11:56,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {7695#false} ~cond := #in~cond; {7695#false} is VALID [2022-04-15 06:11:56,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {7695#false} assume 0 == ~cond; {7695#false} is VALID [2022-04-15 06:11:56,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {7695#false} assume !false; {7695#false} is VALID [2022-04-15 06:11:56,981 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-15 06:11:56,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:56,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739285966] [2022-04-15 06:11:56,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739285966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:56,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:56,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:56,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:56,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [179135597] [2022-04-15 06:11:56,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [179135597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:56,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:56,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:56,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530233327] [2022-04-15 06:11:56,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:56,982 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-15 06:11:56,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:56,982 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-15 06:11:56,996 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-15 06:11:56,997 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:11:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:56,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:11:56,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:11:56,997 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-15 06:11:59,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:59,758 INFO L93 Difference]: Finished difference Result 593 states and 971 transitions. [2022-04-15 06:11:59,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:11:59,758 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-15 06:11:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:59,758 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-15 06:11:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-04-15 06:11:59,765 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-15 06:11:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-04-15 06:11:59,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 258 transitions. [2022-04-15 06:12:00,013 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-15 06:12:00,028 INFO L225 Difference]: With dead ends: 593 [2022-04-15 06:12:00,028 INFO L226 Difference]: Without dead ends: 396 [2022-04-15 06:12:00,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:12:00,038 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:00,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 60 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:12:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-15 06:12:01,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 250. [2022-04-15 06:12:01,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:01,300 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-15 06:12:01,300 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-15 06:12:01,300 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-15 06:12:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:01,344 INFO L93 Difference]: Finished difference Result 396 states and 653 transitions. [2022-04-15 06:12:01,344 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 653 transitions. [2022-04-15 06:12:01,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:01,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:01,348 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-15 06:12:01,349 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-15 06:12:01,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:01,389 INFO L93 Difference]: Finished difference Result 396 states and 653 transitions. [2022-04-15 06:12:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 653 transitions. [2022-04-15 06:12:01,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:01,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:01,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:01,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:01,395 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-15 06:12:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 405 transitions. [2022-04-15 06:12:01,430 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 405 transitions. Word has length 29 [2022-04-15 06:12:01,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:01,430 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 405 transitions. [2022-04-15 06:12:01,430 INFO L479 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-15 06:12:01,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 405 transitions. [2022-04-15 06:12:02,186 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-15 06:12:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 405 transitions. [2022-04-15 06:12:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 06:12:02,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:02,187 INFO L499 BasicCegarLoop]: 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-15 06:12:02,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 06:12:02,187 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:02,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1319777776, now seen corresponding path program 1 times [2022-04-15 06:12:02,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:02,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [882200627] [2022-04-15 06:12:02,188 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:02,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1319777776, now seen corresponding path program 2 times [2022-04-15 06:12:02,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:02,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810724508] [2022-04-15 06:12:02,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:02,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:02,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:02,283 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-15 06:12:02,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 06:12:02,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10201#true} {10201#true} #138#return; {10201#true} is VALID [2022-04-15 06:12:02,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:12:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:02,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-15 06:12:02,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-15 06:12:02,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 06:12:02,289 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-15 06:12:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:12:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:02,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-15 06:12:02,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-15 06:12:02,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 06:12:02,293 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-15 06:12:02,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 06:12:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:02,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-15 06:12:02,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-15 06:12:02,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 06:12:02,305 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-15 06:12:02,306 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-15 06:12:02,306 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-15 06:12:02,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 06:12:02,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10201#true} #138#return; {10201#true} is VALID [2022-04-15 06:12:02,306 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-15 06:12:02,306 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-15 06:12:02,319 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-15 06:12:02,320 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-15 06:12:02,320 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-15 06:12:02,320 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-15 06:12:02,321 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-15 06:12:02,321 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-15 06:12:02,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-15 06:12:02,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-15 06:12:02,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 06:12:02,321 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-15 06:12:02,322 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-15 06:12:02,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-15 06:12:02,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-15 06:12:02,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 06:12:02,323 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-15 06:12:02,323 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-15 06:12:02,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-15 06:12:02,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-15 06:12:02,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 06:12:02,324 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-15 06:12:02,324 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-15 06:12:02,324 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-15 06:12:02,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {10221#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10202#false} is VALID [2022-04-15 06:12:02,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {10202#false} assume !false; {10202#false} is VALID [2022-04-15 06:12:02,326 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-15 06:12:02,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:02,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810724508] [2022-04-15 06:12:02,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810724508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:02,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:02,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:12:02,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:02,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [882200627] [2022-04-15 06:12:02,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [882200627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:02,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:02,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:12:02,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846125219] [2022-04-15 06:12:02,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:02,327 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-15 06:12:02,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:02,328 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-15 06:12:02,342 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-15 06:12:02,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:12:02,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:02,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:12:02,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:12:02,345 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-15 06:12:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:04,712 INFO L93 Difference]: Finished difference Result 324 states and 521 transitions. [2022-04-15 06:12:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:12:04,712 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-15 06:12:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:04,712 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-15 06:12:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-15 06:12:04,714 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-15 06:12:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-15 06:12:04,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-15 06:12:04,837 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-15 06:12:04,845 INFO L225 Difference]: With dead ends: 324 [2022-04-15 06:12:04,846 INFO L226 Difference]: Without dead ends: 322 [2022-04-15 06:12:04,846 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:12:04,846 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:04,846 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 75 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:12:04,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-15 06:12:06,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 300. [2022-04-15 06:12:06,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:06,575 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-15 06:12:06,586 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-15 06:12:06,588 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-15 06:12:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:06,618 INFO L93 Difference]: Finished difference Result 322 states and 519 transitions. [2022-04-15 06:12:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2022-04-15 06:12:06,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:06,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:06,635 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-15 06:12:06,637 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-15 06:12:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:06,648 INFO L93 Difference]: Finished difference Result 322 states and 519 transitions. [2022-04-15 06:12:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2022-04-15 06:12:06,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:06,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:06,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:06,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:06,650 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-15 06:12:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 489 transitions. [2022-04-15 06:12:06,672 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 489 transitions. Word has length 30 [2022-04-15 06:12:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:06,672 INFO L478 AbstractCegarLoop]: Abstraction has 300 states and 489 transitions. [2022-04-15 06:12:06,672 INFO L479 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-15 06:12:06,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 489 transitions. [2022-04-15 06:12:07,613 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-15 06:12:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 489 transitions. [2022-04-15 06:12:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 06:12:07,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:07,614 INFO L499 BasicCegarLoop]: 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-15 06:12:07,614 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 06:12:07,615 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:07,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1828949766, now seen corresponding path program 1 times [2022-04-15 06:12:07,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:07,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [945562238] [2022-04-15 06:12:07,615 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1828949766, now seen corresponding path program 2 times [2022-04-15 06:12:07,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:07,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831144985] [2022-04-15 06:12:07,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:07,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:07,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:07,710 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-15 06:12:07,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 06:12:07,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12128#true} {12128#true} #138#return; {12128#true} is VALID [2022-04-15 06:12:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:12:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:07,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-15 06:12:07,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-15 06:12:07,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 06:12:07,715 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-15 06:12:07,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:12:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:07,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-15 06:12:07,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-15 06:12:07,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 06:12:07,720 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-15 06:12:07,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 06:12:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:07,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-15 06:12:07,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-15 06:12:07,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 06:12:07,727 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-15 06:12:07,727 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-15 06:12:07,727 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-15 06:12:07,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 06:12:07,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12128#true} #138#return; {12128#true} is VALID [2022-04-15 06:12:07,727 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-15 06:12:07,728 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-15 06:12:07,728 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-15 06:12:07,729 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-15 06:12:07,733 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-15 06:12:07,733 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-15 06:12:07,734 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-15 06:12:07,734 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-15 06:12:07,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-15 06:12:07,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-15 06:12:07,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 06:12:07,747 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-15 06:12:07,748 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-15 06:12:07,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-15 06:12:07,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-15 06:12:07,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 06:12:07,748 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-15 06:12:07,749 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-15 06:12:07,749 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-15 06:12:07,749 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-15 06:12:07,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-15 06:12:07,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-15 06:12:07,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 06:12:07,750 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-15 06:12:07,750 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-15 06:12:07,751 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-15 06:12:07,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {12149#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12129#false} is VALID [2022-04-15 06:12:07,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {12129#false} assume !false; {12129#false} is VALID [2022-04-15 06:12:07,752 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-15 06:12:07,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:07,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831144985] [2022-04-15 06:12:07,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831144985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:07,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:07,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:07,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:07,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [945562238] [2022-04-15 06:12:07,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [945562238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:07,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:07,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:07,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965171494] [2022-04-15 06:12:07,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:07,754 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-15 06:12:07,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:07,754 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-15 06:12:07,770 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-15 06:12:07,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:12:07,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:07,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:12:07,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:12:07,771 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-15 06:12:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:11,989 INFO L93 Difference]: Finished difference Result 470 states and 788 transitions. [2022-04-15 06:12:11,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:12:11,989 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-15 06:12:11,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:11,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-15 06:12:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-04-15 06:12:12,012 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-15 06:12:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-04-15 06:12:12,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 145 transitions. [2022-04-15 06:12:12,207 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-15 06:12:12,219 INFO L225 Difference]: With dead ends: 470 [2022-04-15 06:12:12,219 INFO L226 Difference]: Without dead ends: 468 [2022-04-15 06:12:12,220 INFO L912 BasicCegarLoop]: 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-15 06:12:12,221 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 98 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:12,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 77 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:12:12,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-15 06:12:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 422. [2022-04-15 06:12:14,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:14,810 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-15 06:12:14,825 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-15 06:12:14,826 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-15 06:12:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:14,865 INFO L93 Difference]: Finished difference Result 468 states and 786 transitions. [2022-04-15 06:12:14,865 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 786 transitions. [2022-04-15 06:12:14,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:14,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:14,868 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-15 06:12:14,869 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-15 06:12:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:14,920 INFO L93 Difference]: Finished difference Result 468 states and 786 transitions. [2022-04-15 06:12:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 786 transitions. [2022-04-15 06:12:14,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:14,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:14,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:14,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:14,927 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-15 06:12:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 708 transitions. [2022-04-15 06:12:14,965 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 708 transitions. Word has length 32 [2022-04-15 06:12:14,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:14,965 INFO L478 AbstractCegarLoop]: Abstraction has 422 states and 708 transitions. [2022-04-15 06:12:14,966 INFO L479 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-15 06:12:14,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 422 states and 708 transitions. [2022-04-15 06:12:16,563 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-15 06:12:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 708 transitions. [2022-04-15 06:12:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 06:12:16,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:16,564 INFO L499 BasicCegarLoop]: 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-15 06:12:16,564 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 06:12:16,564 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:16,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:16,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1969498376, now seen corresponding path program 1 times [2022-04-15 06:12:16,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:16,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [452763198] [2022-04-15 06:12:16,565 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:16,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1969498376, now seen corresponding path program 2 times [2022-04-15 06:12:16,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:16,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593511585] [2022-04-15 06:12:16,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:16,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:16,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:16,675 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-15 06:12:16,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 06:12:16,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14885#true} {14885#true} #138#return; {14885#true} is VALID [2022-04-15 06:12:16,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:12:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:16,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-15 06:12:16,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-15 06:12:16,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 06:12:16,681 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-15 06:12:16,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:12:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:16,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-15 06:12:16,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-15 06:12:16,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 06:12:16,708 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-15 06:12:16,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 06:12:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:16,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-15 06:12:16,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-15 06:12:16,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 06:12:16,714 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-15 06:12:16,715 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-15 06:12:16,715 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-15 06:12:16,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 06:12:16,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14885#true} #138#return; {14885#true} is VALID [2022-04-15 06:12:16,717 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-15 06:12:16,717 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-15 06:12:16,718 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-15 06:12:16,718 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-15 06:12:16,719 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-15 06:12:16,720 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-15 06:12:16,721 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-15 06:12:16,721 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-15 06:12:16,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-15 06:12:16,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-15 06:12:16,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 06:12:16,722 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-15 06:12:16,722 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-15 06:12:16,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-15 06:12:16,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-15 06:12:16,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 06:12:16,724 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-15 06:12:16,725 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-15 06:12:16,725 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-15 06:12:16,725 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-15 06:12:16,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-15 06:12:16,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-15 06:12:16,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 06:12:16,726 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-15 06:12:16,726 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-15 06:12:16,726 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-15 06:12:16,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {14906#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14886#false} is VALID [2022-04-15 06:12:16,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {14886#false} assume !false; {14886#false} is VALID [2022-04-15 06:12:16,727 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-15 06:12:16,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:16,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593511585] [2022-04-15 06:12:16,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593511585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:16,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:16,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:16,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:16,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [452763198] [2022-04-15 06:12:16,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [452763198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:16,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:16,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:16,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792301779] [2022-04-15 06:12:16,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:16,728 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-15 06:12:16,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:16,729 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-15 06:12:16,759 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-15 06:12:16,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:12:16,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:12:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:12:16,760 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-15 06:12:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:21,942 INFO L93 Difference]: Finished difference Result 489 states and 817 transitions. [2022-04-15 06:12:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:12:21,942 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-15 06:12:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:21,943 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-15 06:12:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-15 06:12:21,944 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-15 06:12:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-15 06:12:21,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2022-04-15 06:12:22,043 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-15 06:12:22,058 INFO L225 Difference]: With dead ends: 489 [2022-04-15 06:12:22,058 INFO L226 Difference]: Without dead ends: 487 [2022-04-15 06:12:22,059 INFO L912 BasicCegarLoop]: 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-15 06:12:22,076 INFO L913 BasicCegarLoop]: 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-15 06:12:22,076 INFO L914 BasicCegarLoop]: 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-15 06:12:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-04-15 06:12:24,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 429. [2022-04-15 06:12:24,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:24,841 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-15 06:12:24,842 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-15 06:12:24,863 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-15 06:12:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:24,895 INFO L93 Difference]: Finished difference Result 487 states and 815 transitions. [2022-04-15 06:12:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 815 transitions. [2022-04-15 06:12:24,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:24,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:24,898 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-15 06:12:24,898 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-15 06:12:24,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:24,918 INFO L93 Difference]: Finished difference Result 487 states and 815 transitions. [2022-04-15 06:12:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 815 transitions. [2022-04-15 06:12:24,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:24,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:24,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:24,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:24,921 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-15 06:12:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 717 transitions. [2022-04-15 06:12:24,942 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 717 transitions. Word has length 32 [2022-04-15 06:12:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:24,942 INFO L478 AbstractCegarLoop]: Abstraction has 429 states and 717 transitions. [2022-04-15 06:12:24,943 INFO L479 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-15 06:12:24,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 429 states and 717 transitions. [2022-04-15 06:12:25,868 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-15 06:12:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 717 transitions. [2022-04-15 06:12:25,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 06:12:25,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:25,869 INFO L499 BasicCegarLoop]: 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-15 06:12:25,869 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 06:12:25,869 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:25,869 INFO L85 PathProgramCache]: Analyzing trace with hash 154781133, now seen corresponding path program 1 times [2022-04-15 06:12:25,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:25,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1983761392] [2022-04-15 06:12:25,870 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:25,870 INFO L85 PathProgramCache]: Analyzing trace with hash 154781133, now seen corresponding path program 2 times [2022-04-15 06:12:25,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:25,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780174330] [2022-04-15 06:12:25,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:25,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:25,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:25,976 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-15 06:12:25,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 06:12:25,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17730#true} {17730#true} #138#return; {17730#true} is VALID [2022-04-15 06:12:25,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:12:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:25,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 06:12:25,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 06:12:25,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 06:12:25,980 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-15 06:12:25,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:12:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:25,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 06:12:25,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 06:12:25,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 06:12:25,984 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-15 06:12:25,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 06:12:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:25,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 06:12:25,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 06:12:25,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 06:12:25,988 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-15 06:12:25,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 06:12:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:25,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 06:12:25,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 06:12:25,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 06:12:25,991 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-15 06:12:25,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-15 06:12:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:25,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 06:12:25,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 06:12:25,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 06:12:25,999 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-15 06:12:25,999 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-15 06:12:26,000 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-15 06:12:26,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 06:12:26,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17730#true} #138#return; {17730#true} is VALID [2022-04-15 06:12:26,000 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-15 06:12:26,000 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-15 06:12:26,000 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-15 06:12:26,001 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-15 06:12:26,001 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-15 06:12:26,001 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-15 06:12:26,002 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-15 06:12:26,002 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-15 06:12:26,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 06:12:26,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 06:12:26,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 06:12:26,002 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-15 06:12:26,002 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-15 06:12:26,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 06:12:26,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 06:12:26,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 06:12:26,003 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-15 06:12:26,003 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-15 06:12:26,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 06:12:26,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 06:12:26,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 06:12:26,003 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-15 06:12:26,004 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-15 06:12:26,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 06:12:26,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 06:12:26,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 06:12:26,004 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-15 06:12:26,004 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-15 06:12:26,005 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-15 06:12:26,005 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-15 06:12:26,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 06:12:26,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 06:12:26,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 06:12:26,006 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-15 06:12:26,006 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-15 06:12:26,006 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-15 06:12:26,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {17759#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17731#false} is VALID [2022-04-15 06:12:26,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {17731#false} assume !false; {17731#false} is VALID [2022-04-15 06:12:26,007 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-15 06:12:26,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:26,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780174330] [2022-04-15 06:12:26,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780174330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:26,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:26,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:26,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:26,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1983761392] [2022-04-15 06:12:26,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1983761392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:26,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:26,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:26,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117812351] [2022-04-15 06:12:26,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:26,008 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-15 06:12:26,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:26,009 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-15 06:12:26,023 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-15 06:12:26,023 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:12:26,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:26,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:12:26,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:12:26,025 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-15 06:12:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:29,537 INFO L93 Difference]: Finished difference Result 484 states and 791 transitions. [2022-04-15 06:12:29,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:12:29,537 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-15 06:12:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:29,537 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-15 06:12:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-15 06:12:29,538 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-15 06:12:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-15 06:12:29,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2022-04-15 06:12:29,637 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-15 06:12:29,650 INFO L225 Difference]: With dead ends: 484 [2022-04-15 06:12:29,650 INFO L226 Difference]: Without dead ends: 482 [2022-04-15 06:12:29,650 INFO L912 BasicCegarLoop]: 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-15 06:12:29,651 INFO L913 BasicCegarLoop]: 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-15 06:12:29,651 INFO L914 BasicCegarLoop]: 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-15 06:12:29,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-04-15 06:12:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 433. [2022-04-15 06:12:32,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:32,079 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-15 06:12:32,080 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-15 06:12:32,081 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-15 06:12:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:32,122 INFO L93 Difference]: Finished difference Result 482 states and 789 transitions. [2022-04-15 06:12:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 789 transitions. [2022-04-15 06:12:32,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:32,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:32,124 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-15 06:12:32,125 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-15 06:12:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:32,171 INFO L93 Difference]: Finished difference Result 482 states and 789 transitions. [2022-04-15 06:12:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 789 transitions. [2022-04-15 06:12:32,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:32,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:32,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:32,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:32,174 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-15 06:12:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 720 transitions. [2022-04-15 06:12:32,191 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 720 transitions. Word has length 42 [2022-04-15 06:12:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:32,192 INFO L478 AbstractCegarLoop]: Abstraction has 433 states and 720 transitions. [2022-04-15 06:12:32,192 INFO L479 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-15 06:12:32,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 433 states and 720 transitions. [2022-04-15 06:12:33,238 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-15 06:12:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 720 transitions. [2022-04-15 06:12:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 06:12:33,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:33,239 INFO L499 BasicCegarLoop]: 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-15 06:12:33,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 06:12:33,239 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:33,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:33,240 INFO L85 PathProgramCache]: Analyzing trace with hash -756625364, now seen corresponding path program 1 times [2022-04-15 06:12:33,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:33,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [722374026] [2022-04-15 06:12:33,240 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:12:33,240 INFO L85 PathProgramCache]: Analyzing trace with hash -756625364, now seen corresponding path program 2 times [2022-04-15 06:12:33,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:33,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263374053] [2022-04-15 06:12:33,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:33,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:33,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:33,376 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-15 06:12:33,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 06:12:33,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20574#true} {20574#true} #138#return; {20574#true} is VALID [2022-04-15 06:12:33,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:12:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:33,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 06:12:33,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 06:12:33,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 06:12:33,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #118#return; {20574#true} is VALID [2022-04-15 06:12:33,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:12:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:33,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 06:12:33,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 06:12:33,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 06:12:33,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #120#return; {20574#true} is VALID [2022-04-15 06:12:33,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 06:12:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:33,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 06:12:33,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 06:12:33,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 06:12:33,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #130#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-15 06:12:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 06:12:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:33,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 06:12:33,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 06:12:33,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 06:12:33,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #132#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-15 06:12:33,386 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-15 06:12:33,386 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-15 06:12:33,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 06:12:33,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #138#return; {20574#true} is VALID [2022-04-15 06:12:33,387 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-15 06:12:33,387 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-15 06:12:33,387 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-15 06:12:33,387 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-15 06:12:33,387 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-15 06:12:33,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {20574#true} assume !!(~j~0 <= ~r~0); {20574#true} is VALID [2022-04-15 06:12:33,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {20574#true} assume !(~j~0 < ~r~0); {20574#true} is VALID [2022-04-15 06:12:33,387 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-15 06:12:33,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 06:12:33,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 06:12:33,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 06:12:33,387 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20574#true} {20574#true} #118#return; {20574#true} is VALID [2022-04-15 06:12:33,387 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-15 06:12:33,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 06:12:33,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 06:12:33,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 06:12:33,388 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20574#true} {20574#true} #120#return; {20574#true} is VALID [2022-04-15 06:12:33,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {20574#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20574#true} is VALID [2022-04-15 06:12:33,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {20574#true} assume 0 != #t~nondet5;havoc #t~nondet5; {20574#true} is VALID [2022-04-15 06:12:33,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {20574#true} assume ~l~0 > 1; {20587#(<= 2 main_~l~0)} is VALID [2022-04-15 06:12:33,408 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-15 06:12:33,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 06:12:33,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 06:12:33,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 06:12:33,408 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #130#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-15 06:12:33,408 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-15 06:12:33,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 06:12:33,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 06:12:33,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 06:12:33,409 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #132#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-15 06:12:33,409 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-15 06:12:33,410 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-15 06:12:33,410 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-15 06:12:33,410 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-15 06:12:33,411 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-15 06:12:33,411 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-15 06:12:33,411 INFO L290 TraceCheckUtils]: 40: Hoare triple {20599#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20575#false} is VALID [2022-04-15 06:12:33,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {20575#false} assume !false; {20575#false} is VALID [2022-04-15 06:12:33,412 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-15 06:12:33,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:33,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263374053] [2022-04-15 06:12:33,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263374053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:33,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:33,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:33,412 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:33,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [722374026] [2022-04-15 06:12:33,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [722374026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:33,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:33,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:33,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441903298] [2022-04-15 06:12:33,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:33,415 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-15 06:12:33,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:33,415 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-15 06:12:33,433 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-15 06:12:33,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:12:33,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:33,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:12:33,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:12:33,435 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-15 06:12:35,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:35,369 INFO L93 Difference]: Finished difference Result 440 states and 726 transitions. [2022-04-15 06:12:35,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:12:35,369 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-15 06:12:35,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:35,369 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-15 06:12:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 06:12:35,384 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-15 06:12:35,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 06:12:35,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-15 06:12:35,431 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-15 06:12:35,443 INFO L225 Difference]: With dead ends: 440 [2022-04-15 06:12:35,444 INFO L226 Difference]: Without dead ends: 438 [2022-04-15 06:12:35,445 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:12:35,447 INFO L913 BasicCegarLoop]: 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-15 06:12:35,449 INFO L914 BasicCegarLoop]: 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-15 06:12:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-04-15 06:12:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 437. [2022-04-15 06:12:37,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:37,718 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-15 06:12:37,719 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-15 06:12:37,719 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-15 06:12:37,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:37,760 INFO L93 Difference]: Finished difference Result 438 states and 724 transitions. [2022-04-15 06:12:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 724 transitions. [2022-04-15 06:12:37,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:37,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:37,767 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-15 06:12:37,768 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-15 06:12:37,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:37,802 INFO L93 Difference]: Finished difference Result 438 states and 724 transitions. [2022-04-15 06:12:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 724 transitions. [2022-04-15 06:12:37,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:37,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:37,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:37,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:37,805 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-15 06:12:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 723 transitions. [2022-04-15 06:12:37,831 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 723 transitions. Word has length 42 [2022-04-15 06:12:37,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:37,831 INFO L478 AbstractCegarLoop]: Abstraction has 437 states and 723 transitions. [2022-04-15 06:12:37,831 INFO L479 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-15 06:12:37,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 437 states and 723 transitions. [2022-04-15 06:12:38,925 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-15 06:12:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 723 transitions. [2022-04-15 06:12:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 06:12:38,926 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:38,926 INFO L499 BasicCegarLoop]: 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-15 06:12:38,926 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 06:12:38,927 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:38,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:38,927 INFO L85 PathProgramCache]: Analyzing trace with hash 202086614, now seen corresponding path program 1 times [2022-04-15 06:12:38,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:38,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [81609570] [2022-04-15 06:12:38,927 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:12:38,927 INFO L85 PathProgramCache]: Analyzing trace with hash 202086614, now seen corresponding path program 2 times [2022-04-15 06:12:38,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:38,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419814054] [2022-04-15 06:12:38,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:38,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:39,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:39,033 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-15 06:12:39,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 06:12:39,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23248#true} {23248#true} #138#return; {23248#true} is VALID [2022-04-15 06:12:39,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:12:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:39,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 06:12:39,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 06:12:39,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 06:12:39,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #118#return; {23248#true} is VALID [2022-04-15 06:12:39,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:12:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:39,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 06:12:39,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 06:12:39,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 06:12:39,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #120#return; {23248#true} is VALID [2022-04-15 06:12:39,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 06:12:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:39,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 06:12:39,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 06:12:39,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 06:12:39,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #130#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-15 06:12:39,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 06:12:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:39,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 06:12:39,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 06:12:39,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 06:12:39,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #132#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-15 06:12:39,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:12:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:39,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 06:12:39,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 06:12:39,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 06:12:39,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #118#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-15 06:12:39,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-15 06:12:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:39,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 06:12:39,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 06:12:39,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 06:12:39,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #120#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-15 06:12:39,065 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-15 06:12:39,065 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-15 06:12:39,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 06:12:39,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #138#return; {23248#true} is VALID [2022-04-15 06:12:39,065 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-15 06:12:39,065 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-15 06:12:39,065 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-15 06:12:39,066 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-15 06:12:39,066 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-15 06:12:39,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {23248#true} assume !!(~j~0 <= ~r~0); {23248#true} is VALID [2022-04-15 06:12:39,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {23248#true} assume !(~j~0 < ~r~0); {23248#true} is VALID [2022-04-15 06:12:39,066 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-15 06:12:39,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 06:12:39,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 06:12:39,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 06:12:39,066 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23248#true} {23248#true} #118#return; {23248#true} is VALID [2022-04-15 06:12:39,066 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-15 06:12:39,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 06:12:39,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 06:12:39,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 06:12:39,066 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {23248#true} {23248#true} #120#return; {23248#true} is VALID [2022-04-15 06:12:39,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {23248#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23248#true} is VALID [2022-04-15 06:12:39,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {23248#true} assume 0 != #t~nondet5;havoc #t~nondet5; {23248#true} is VALID [2022-04-15 06:12:39,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {23248#true} assume ~l~0 > 1; {23261#(<= 2 main_~l~0)} is VALID [2022-04-15 06:12:39,067 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-15 06:12:39,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 06:12:39,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 06:12:39,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 06:12:39,068 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #130#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-15 06:12:39,068 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-15 06:12:39,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 06:12:39,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 06:12:39,068 INFO L290 TraceCheckUtils]: 32: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 06:12:39,068 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #132#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-15 06:12:39,069 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-15 06:12:39,069 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-15 06:12:39,069 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-15 06:12:39,083 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-15 06:12:39,083 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-15 06:12:39,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 06:12:39,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 06:12:39,084 INFO L290 TraceCheckUtils]: 41: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 06:12:39,084 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #118#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-15 06:12:39,084 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-15 06:12:39,084 INFO L290 TraceCheckUtils]: 44: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 06:12:39,084 INFO L290 TraceCheckUtils]: 45: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 06:12:39,084 INFO L290 TraceCheckUtils]: 46: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 06:12:39,085 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #120#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-15 06:12:39,085 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-15 06:12:39,085 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-15 06:12:39,086 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-15 06:12:39,086 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-15 06:12:39,086 INFO L290 TraceCheckUtils]: 52: Hoare triple {23281#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23249#false} is VALID [2022-04-15 06:12:39,086 INFO L290 TraceCheckUtils]: 53: Hoare triple {23249#false} assume !false; {23249#false} is VALID [2022-04-15 06:12:39,087 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-15 06:12:39,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:39,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419814054] [2022-04-15 06:12:39,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419814054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:39,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:39,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:39,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:39,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [81609570] [2022-04-15 06:12:39,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [81609570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:39,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:39,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:39,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875615594] [2022-04-15 06:12:39,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:39,090 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-15 06:12:39,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:39,090 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-15 06:12:39,113 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-15 06:12:39,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:12:39,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:39,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:12:39,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:12:39,113 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-15 06:12:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:43,073 INFO L93 Difference]: Finished difference Result 501 states and 826 transitions. [2022-04-15 06:12:43,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:12:43,074 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-15 06:12:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:43,074 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-15 06:12:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-15 06:12:43,075 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-15 06:12:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-15 06:12:43,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 107 transitions. [2022-04-15 06:12:43,158 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-15 06:12:43,171 INFO L225 Difference]: With dead ends: 501 [2022-04-15 06:12:43,171 INFO L226 Difference]: Without dead ends: 499 [2022-04-15 06:12:43,172 INFO L912 BasicCegarLoop]: 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-15 06:12:43,172 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 80 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:43,172 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 66 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:12:43,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-15 06:12:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 441. [2022-04-15 06:12:45,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:45,529 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-15 06:12:45,529 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-15 06:12:45,530 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-15 06:12:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:45,572 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-15 06:12:45,572 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-15 06:12:45,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:45,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:45,575 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-15 06:12:45,575 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-15 06:12:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:45,618 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-15 06:12:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-15 06:12:45,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:45,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:45,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:45,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:45,621 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-15 06:12:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 726 transitions. [2022-04-15 06:12:45,653 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 726 transitions. Word has length 54 [2022-04-15 06:12:45,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:45,654 INFO L478 AbstractCegarLoop]: Abstraction has 441 states and 726 transitions. [2022-04-15 06:12:45,654 INFO L479 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-15 06:12:45,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 441 states and 726 transitions. [2022-04-15 06:12:47,974 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-15 06:12:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 726 transitions. [2022-04-15 06:12:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 06:12:47,975 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:47,975 INFO L499 BasicCegarLoop]: 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-15 06:12:47,976 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 06:12:47,976 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:47,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:47,976 INFO L85 PathProgramCache]: Analyzing trace with hash -667500302, now seen corresponding path program 1 times [2022-04-15 06:12:47,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:47,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [177454179] [2022-04-15 06:12:48,295 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:12:48,295 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 06:12:48,295 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:12:48,295 INFO L85 PathProgramCache]: Analyzing trace with hash -667500302, now seen corresponding path program 2 times [2022-04-15 06:12:48,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:48,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714487483] [2022-04-15 06:12:48,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:48,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:48,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:48,344 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-15 06:12:48,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26184#true} {26184#true} #138#return; {26184#true} is VALID [2022-04-15 06:12:48,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:12:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:48,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #118#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:48,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:12:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:48,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #120#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:48,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 06:12:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:48,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #122#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:48,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-15 06:12:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:48,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #124#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:48,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-15 06:12:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:48,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #126#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:48,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:12:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:48,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #128#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:48,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 06:12:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:48,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #118#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-15 06:12:48,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-15 06:12:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:48,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #120#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-15 06:12:48,367 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-15 06:12:48,367 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-15 06:12:48,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26184#true} #138#return; {26184#true} is VALID [2022-04-15 06:12:48,367 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-15 06:12:48,367 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-15 06:12:48,367 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-15 06:12:48,367 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-15 06:12:48,368 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-15 06:12:48,368 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-15 06:12:48,368 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-15 06:12:48,368 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-15 06:12:48,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,369 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #118#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:48,369 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-15 06:12:48,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,370 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #120#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:48,370 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-15 06:12:48,370 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-15 06:12:48,370 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-15 06:12:48,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,371 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #122#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:48,371 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-15 06:12:48,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,371 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #124#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:48,372 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-15 06:12:48,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,372 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #126#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:48,372 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-15 06:12:48,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,373 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #128#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:48,373 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-15 06:12:48,373 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-15 06:12:48,374 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-15 06:12:48,374 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-15 06:12:48,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,374 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #118#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-15 06:12:48,374 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-15 06:12:48,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,375 INFO L290 TraceCheckUtils]: 53: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,375 INFO L290 TraceCheckUtils]: 54: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,375 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #120#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-15 06:12:48,375 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-15 06:12:48,376 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-15 06:12:48,376 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-15 06:12:48,376 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-15 06:12:48,377 INFO L290 TraceCheckUtils]: 60: Hoare triple {26225#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26185#false} is VALID [2022-04-15 06:12:48,377 INFO L290 TraceCheckUtils]: 61: Hoare triple {26185#false} assume !false; {26185#false} is VALID [2022-04-15 06:12:48,377 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-15 06:12:48,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:48,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714487483] [2022-04-15 06:12:48,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714487483] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:12:48,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087799417] [2022-04-15 06:12:48,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:12:48,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:12:48,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:12:48,379 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-15 06:12:48,395 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-15 06:12:48,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:12:48,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:12:48,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 06:12:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:48,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:12:48,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {26184#true} call ULTIMATE.init(); {26184#true} is VALID [2022-04-15 06:12:48,933 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-15 06:12:48,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26184#true} #138#return; {26184#true} is VALID [2022-04-15 06:12:48,933 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-15 06:12:48,933 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-15 06:12:48,934 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-15 06:12:48,934 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-15 06:12:48,934 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-15 06:12:48,935 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-15 06:12:48,943 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-15 06:12:48,943 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-15 06:12:48,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,944 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-15 06:12:48,944 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-15 06:12:48,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,945 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-15 06:12:48,945 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-15 06:12:48,945 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-15 06:12:48,945 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-15 06:12:48,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,946 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-15 06:12:48,946 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-15 06:12:48,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,947 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-15 06:12:48,947 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-15 06:12:48,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,947 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-15 06:12:48,948 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-15 06:12:48,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-15 06:12:48,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-15 06:12:48,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-15 06:12:48,948 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-15 06:12:48,949 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-15 06:12:48,949 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-15 06:12:48,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {26185#false} assume !(~j~0 < ~r~0); {26185#false} is VALID [2022-04-15 06:12:48,949 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-15 06:12:48,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {26185#false} ~cond := #in~cond; {26185#false} is VALID [2022-04-15 06:12:48,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {26185#false} assume !(0 == ~cond); {26185#false} is VALID [2022-04-15 06:12:48,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {26185#false} assume true; {26185#false} is VALID [2022-04-15 06:12:48,950 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26185#false} {26185#false} #118#return; {26185#false} is VALID [2022-04-15 06:12:48,950 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-15 06:12:48,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {26185#false} ~cond := #in~cond; {26185#false} is VALID [2022-04-15 06:12:48,950 INFO L290 TraceCheckUtils]: 53: Hoare triple {26185#false} assume !(0 == ~cond); {26185#false} is VALID [2022-04-15 06:12:48,950 INFO L290 TraceCheckUtils]: 54: Hoare triple {26185#false} assume true; {26185#false} is VALID [2022-04-15 06:12:48,950 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26185#false} {26185#false} #120#return; {26185#false} is VALID [2022-04-15 06:12:48,950 INFO L290 TraceCheckUtils]: 56: Hoare triple {26185#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {26185#false} is VALID [2022-04-15 06:12:48,950 INFO L290 TraceCheckUtils]: 57: Hoare triple {26185#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {26185#false} is VALID [2022-04-15 06:12:48,950 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-15 06:12:48,950 INFO L290 TraceCheckUtils]: 59: Hoare triple {26185#false} ~cond := #in~cond; {26185#false} is VALID [2022-04-15 06:12:48,950 INFO L290 TraceCheckUtils]: 60: Hoare triple {26185#false} assume 0 == ~cond; {26185#false} is VALID [2022-04-15 06:12:48,950 INFO L290 TraceCheckUtils]: 61: Hoare triple {26185#false} assume !false; {26185#false} is VALID [2022-04-15 06:12:48,951 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-15 06:12:48,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:12:48,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087799417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:48,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 06:12:48,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-04-15 06:12:48,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:48,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [177454179] [2022-04-15 06:12:48,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [177454179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:48,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:48,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:12:48,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586439327] [2022-04-15 06:12:48,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:48,953 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-15 06:12:48,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:48,953 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-15 06:12:48,991 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-15 06:12:48,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:12:48,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:48,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:12:48,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:12:48,991 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-15 06:12:51,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:51,716 INFO L93 Difference]: Finished difference Result 843 states and 1374 transitions. [2022-04-15 06:12:51,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:12:51,716 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-15 06:12:51,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:51,716 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-15 06:12:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2022-04-15 06:12:51,718 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-15 06:12:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2022-04-15 06:12:51,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 152 transitions. [2022-04-15 06:12:51,816 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-15 06:12:51,839 INFO L225 Difference]: With dead ends: 843 [2022-04-15 06:12:51,839 INFO L226 Difference]: Without dead ends: 437 [2022-04-15 06:12:51,840 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:12:51,841 INFO L913 BasicCegarLoop]: 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-15 06:12:51,841 INFO L914 BasicCegarLoop]: 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-15 06:12:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-04-15 06:12:53,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 401. [2022-04-15 06:12:53,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:53,328 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-15 06:12:53,329 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-15 06:12:53,329 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-15 06:12:53,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:53,365 INFO L93 Difference]: Finished difference Result 437 states and 700 transitions. [2022-04-15 06:12:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 700 transitions. [2022-04-15 06:12:53,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:53,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:53,368 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-15 06:12:53,368 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-15 06:12:53,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:53,389 INFO L93 Difference]: Finished difference Result 437 states and 700 transitions. [2022-04-15 06:12:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 700 transitions. [2022-04-15 06:12:53,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:53,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:53,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:53,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:53,392 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-15 06:12:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 644 transitions. [2022-04-15 06:12:53,405 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 644 transitions. Word has length 62 [2022-04-15 06:12:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:53,405 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 644 transitions. [2022-04-15 06:12:53,405 INFO L479 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-15 06:12:53,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 644 transitions. [2022-04-15 06:12:55,161 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-15 06:12:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 644 transitions. [2022-04-15 06:12:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 06:12:55,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:55,163 INFO L499 BasicCegarLoop]: 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-15 06:12:55,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 06:12:55,363 WARN L460 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-15 06:12:55,364 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:55,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:55,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1858540084, now seen corresponding path program 1 times [2022-04-15 06:12:55,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:55,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1854762074] [2022-04-15 06:12:55,906 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:12:55,906 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 06:12:55,906 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:12:55,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1858540084, now seen corresponding path program 2 times [2022-04-15 06:12:55,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:55,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753746352] [2022-04-15 06:12:55,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:55,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:56,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:56,032 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-15 06:12:56,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29777#true} {29777#true} #138#return; {29777#true} is VALID [2022-04-15 06:12:56,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:12:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:56,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #110#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:56,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:12:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:56,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #112#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:56,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 06:12:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:56,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #114#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:56,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 06:12:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:56,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #116#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:56,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-15 06:12:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:56,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #118#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-15 06:12:56,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:12:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:56,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #120#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-15 06:12:56,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-15 06:12:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:56,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #122#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-15 06:12:56,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 06:12:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:56,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #124#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-15 06:12:56,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-15 06:12:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:56,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #126#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-15 06:12:56,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 06:12:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:56,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #128#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-15 06:12:56,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-15 06:12:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:56,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #118#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-15 06:12:56,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-15 06:12:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:56,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #120#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-15 06:12:56,099 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-15 06:12:56,099 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-15 06:12:56,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29777#true} #138#return; {29777#true} is VALID [2022-04-15 06:12:56,100 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-15 06:12:56,100 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-15 06:12:56,100 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-15 06:12:56,100 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-15 06:12:56,100 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-15 06:12:56,101 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-15 06:12:56,101 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-15 06:12:56,101 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-15 06:12:56,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,102 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #110#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:56,102 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-15 06:12:56,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,102 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #112#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:56,102 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-15 06:12:56,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,103 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #114#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:56,103 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-15 06:12:56,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,104 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #116#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-15 06:12:56,104 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-15 06:12:56,104 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-15 06:12:56,104 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-15 06:12:56,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,105 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #118#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-15 06:12:56,105 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-15 06:12:56,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,106 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #120#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-15 06:12:56,106 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-15 06:12:56,106 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-15 06:12:56,106 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-15 06:12:56,106 INFO L290 TraceCheckUtils]: 46: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,107 INFO L290 TraceCheckUtils]: 48: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,107 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #122#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-15 06:12:56,107 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-15 06:12:56,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,107 INFO L290 TraceCheckUtils]: 52: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,107 INFO L290 TraceCheckUtils]: 53: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,108 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #124#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-15 06:12:56,108 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-15 06:12:56,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,108 INFO L290 TraceCheckUtils]: 58: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,108 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #126#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-15 06:12:56,108 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-15 06:12:56,108 INFO L290 TraceCheckUtils]: 61: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,108 INFO L290 TraceCheckUtils]: 62: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,109 INFO L290 TraceCheckUtils]: 63: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,109 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #128#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-15 06:12:56,109 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-15 06:12:56,109 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-15 06:12:56,110 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-15 06:12:56,110 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-15 06:12:56,110 INFO L290 TraceCheckUtils]: 69: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,110 INFO L290 TraceCheckUtils]: 70: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,110 INFO L290 TraceCheckUtils]: 71: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,110 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #118#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-15 06:12:56,111 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-15 06:12:56,111 INFO L290 TraceCheckUtils]: 74: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:56,111 INFO L290 TraceCheckUtils]: 75: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:56,111 INFO L290 TraceCheckUtils]: 76: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:56,111 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #120#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-15 06:12:56,111 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-15 06:12:56,112 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-15 06:12:56,112 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-15 06:12:56,112 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-15 06:12:56,113 INFO L290 TraceCheckUtils]: 82: Hoare triple {29835#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29778#false} is VALID [2022-04-15 06:12:56,113 INFO L290 TraceCheckUtils]: 83: Hoare triple {29778#false} assume !false; {29778#false} is VALID [2022-04-15 06:12:56,113 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-15 06:12:56,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:56,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753746352] [2022-04-15 06:12:56,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753746352] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:12:56,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106510746] [2022-04-15 06:12:56,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:12:56,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:12:56,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:12:56,115 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-15 06:12:56,116 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-15 06:12:56,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:12:56,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:12:56,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:12:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:56,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:12:59,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {29777#true} call ULTIMATE.init(); {29777#true} is VALID [2022-04-15 06:12:59,360 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-15 06:12:59,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:59,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29777#true} #138#return; {29777#true} is VALID [2022-04-15 06:12:59,360 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-15 06:12:59,360 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-15 06:12:59,361 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-15 06:12:59,361 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-15 06:12:59,362 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-15 06:12:59,362 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-15 06:12:59,363 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-15 06:12:59,365 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-15 06:12:59,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:59,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:59,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:59,366 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-15 06:12:59,366 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-15 06:12:59,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:59,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:59,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:59,366 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-15 06:12:59,367 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-15 06:12:59,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:59,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:59,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:59,367 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-15 06:12:59,367 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-15 06:12:59,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:59,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:59,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:59,368 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-15 06:12:59,368 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-15 06:12:59,369 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-15 06:12:59,369 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-15 06:12:59,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:59,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:59,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:59,369 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-15 06:12:59,370 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-15 06:12:59,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:59,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:59,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:59,370 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-15 06:12:59,370 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-15 06:12:59,371 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-15 06:12:59,371 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-15 06:12:59,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:59,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:59,371 INFO L290 TraceCheckUtils]: 48: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:59,371 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-15 06:12:59,372 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-15 06:12:59,372 INFO L290 TraceCheckUtils]: 51: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:59,372 INFO L290 TraceCheckUtils]: 52: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:59,372 INFO L290 TraceCheckUtils]: 53: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:59,372 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-15 06:12:59,373 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-15 06:12:59,373 INFO L290 TraceCheckUtils]: 56: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:59,373 INFO L290 TraceCheckUtils]: 57: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:59,373 INFO L290 TraceCheckUtils]: 58: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:59,373 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-15 06:12:59,373 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-15 06:12:59,374 INFO L290 TraceCheckUtils]: 61: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-15 06:12:59,374 INFO L290 TraceCheckUtils]: 62: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-15 06:12:59,374 INFO L290 TraceCheckUtils]: 63: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-15 06:12:59,374 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-15 06:12:59,375 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-15 06:12:59,375 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-15 06:12:59,375 INFO L290 TraceCheckUtils]: 67: Hoare triple {29778#false} assume !(~j~0 < ~r~0); {29778#false} is VALID [2022-04-15 06:12:59,375 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-15 06:12:59,375 INFO L290 TraceCheckUtils]: 69: Hoare triple {29778#false} ~cond := #in~cond; {29778#false} is VALID [2022-04-15 06:12:59,376 INFO L290 TraceCheckUtils]: 70: Hoare triple {29778#false} assume !(0 == ~cond); {29778#false} is VALID [2022-04-15 06:12:59,376 INFO L290 TraceCheckUtils]: 71: Hoare triple {29778#false} assume true; {29778#false} is VALID [2022-04-15 06:12:59,376 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29778#false} {29778#false} #118#return; {29778#false} is VALID [2022-04-15 06:12:59,376 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-15 06:12:59,377 INFO L290 TraceCheckUtils]: 74: Hoare triple {29778#false} ~cond := #in~cond; {29778#false} is VALID [2022-04-15 06:12:59,377 INFO L290 TraceCheckUtils]: 75: Hoare triple {29778#false} assume !(0 == ~cond); {29778#false} is VALID [2022-04-15 06:12:59,384 INFO L290 TraceCheckUtils]: 76: Hoare triple {29778#false} assume true; {29778#false} is VALID [2022-04-15 06:12:59,384 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {29778#false} {29778#false} #120#return; {29778#false} is VALID [2022-04-15 06:12:59,384 INFO L290 TraceCheckUtils]: 78: Hoare triple {29778#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {29778#false} is VALID [2022-04-15 06:12:59,385 INFO L290 TraceCheckUtils]: 79: Hoare triple {29778#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {29778#false} is VALID [2022-04-15 06:12:59,388 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-15 06:12:59,389 INFO L290 TraceCheckUtils]: 81: Hoare triple {29778#false} ~cond := #in~cond; {29778#false} is VALID [2022-04-15 06:12:59,389 INFO L290 TraceCheckUtils]: 82: Hoare triple {29778#false} assume 0 == ~cond; {29778#false} is VALID [2022-04-15 06:12:59,389 INFO L290 TraceCheckUtils]: 83: Hoare triple {29778#false} assume !false; {29778#false} is VALID [2022-04-15 06:12:59,390 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-15 06:12:59,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:12:59,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106510746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:59,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 06:12:59,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2022-04-15 06:12:59,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:59,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1854762074] [2022-04-15 06:12:59,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1854762074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:59,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:59,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:12:59,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423351158] [2022-04-15 06:12:59,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:59,391 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-15 06:12:59,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:59,392 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-15 06:12:59,433 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-15 06:12:59,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:12:59,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:59,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:12:59,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:12:59,436 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-15 06:13:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:02,920 INFO L93 Difference]: Finished difference Result 714 states and 1123 transitions. [2022-04-15 06:13:02,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:13:02,920 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-15 06:13:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:02,921 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-15 06:13:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 224 transitions. [2022-04-15 06:13:02,924 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-15 06:13:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 224 transitions. [2022-04-15 06:13:02,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 224 transitions. [2022-04-15 06:13:03,128 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-15 06:13:03,138 INFO L225 Difference]: With dead ends: 714 [2022-04-15 06:13:03,138 INFO L226 Difference]: Without dead ends: 329 [2022-04-15 06:13:03,140 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:13:03,140 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 39 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:03,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 237 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:13:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-15 06:13:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 295. [2022-04-15 06:13:05,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:05,335 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-15 06:13:05,336 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-15 06:13:05,336 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-15 06:13:05,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:05,344 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-15 06:13:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-15 06:13:05,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:05,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:05,345 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-15 06:13:05,345 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-15 06:13:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:05,352 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-15 06:13:05,352 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-15 06:13:05,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:05,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:05,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:05,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:05,353 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-15 06:13:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 454 transitions. [2022-04-15 06:13:05,360 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 454 transitions. Word has length 84 [2022-04-15 06:13:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:05,361 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 454 transitions. [2022-04-15 06:13:05,361 INFO L479 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-15 06:13:05,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 295 states and 454 transitions. [2022-04-15 06:13:06,027 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-15 06:13:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 454 transitions. [2022-04-15 06:13:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 06:13:06,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:06,028 INFO L499 BasicCegarLoop]: 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-15 06:13:06,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 06:13:06,229 WARN L460 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-15 06:13:06,229 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:06,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash -898087182, now seen corresponding path program 1 times [2022-04-15 06:13:06,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:06,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [542904910] [2022-04-15 06:13:06,563 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:13:06,563 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 06:13:06,563 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:13:06,563 INFO L85 PathProgramCache]: Analyzing trace with hash -898087182, now seen corresponding path program 2 times [2022-04-15 06:13:06,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:06,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130142162] [2022-04-15 06:13:06,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:06,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:06,624 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-15 06:13:06,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32779#true} {32779#true} #138#return; {32779#true} is VALID [2022-04-15 06:13:06,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:13:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:06,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #110#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:13:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:06,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #112#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 06:13:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:06,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #114#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 06:13:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:06,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #116#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-15 06:13:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:06,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #118#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:13:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:06,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #120#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-15 06:13:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:06,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #122#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 06:13:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:06,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #124#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-15 06:13:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:06,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #126#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 06:13:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:06,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #128#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-15 06:13:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:06,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #118#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-15 06:13:06,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-15 06:13:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:06,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #120#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-15 06:13:06,656 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-15 06:13:06,656 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-15 06:13:06,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32779#true} #138#return; {32779#true} is VALID [2022-04-15 06:13:06,657 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-15 06:13:06,657 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-15 06:13:06,657 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-15 06:13:06,657 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-15 06:13:06,657 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-15 06:13:06,658 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-15 06:13:06,658 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-15 06:13:06,658 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-15 06:13:06,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,659 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #110#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,659 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-15 06:13:06,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,659 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #112#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,659 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-15 06:13:06,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,660 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #114#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,660 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-15 06:13:06,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,661 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #116#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,661 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-15 06:13:06,661 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-15 06:13:06,661 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-15 06:13:06,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,662 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #118#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,662 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-15 06:13:06,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,663 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #120#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,663 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-15 06:13:06,663 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-15 06:13:06,663 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-15 06:13:06,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,664 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #122#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,664 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-15 06:13:06,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,665 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #124#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,665 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-15 06:13:06,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,665 INFO L290 TraceCheckUtils]: 58: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,665 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #126#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,666 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-15 06:13:06,666 INFO L290 TraceCheckUtils]: 61: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,666 INFO L290 TraceCheckUtils]: 62: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,666 INFO L290 TraceCheckUtils]: 63: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,666 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #128#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:06,666 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-15 06:13:06,667 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-15 06:13:06,667 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-15 06:13:06,667 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-15 06:13:06,667 INFO L290 TraceCheckUtils]: 69: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,667 INFO L290 TraceCheckUtils]: 70: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,667 INFO L290 TraceCheckUtils]: 71: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,668 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #118#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-15 06:13:06,668 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-15 06:13:06,668 INFO L290 TraceCheckUtils]: 74: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:06,668 INFO L290 TraceCheckUtils]: 75: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:06,668 INFO L290 TraceCheckUtils]: 76: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:06,668 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #120#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-15 06:13:06,669 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-15 06:13:06,669 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-15 06:13:06,669 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-15 06:13:06,670 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-15 06:13:06,670 INFO L290 TraceCheckUtils]: 82: Hoare triple {32836#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32780#false} is VALID [2022-04-15 06:13:06,670 INFO L290 TraceCheckUtils]: 83: Hoare triple {32780#false} assume !false; {32780#false} is VALID [2022-04-15 06:13:06,670 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-15 06:13:06,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:06,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130142162] [2022-04-15 06:13:06,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130142162] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:13:06,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070971433] [2022-04-15 06:13:06,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:13:06,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:06,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:06,672 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-15 06:13:06,697 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-15 06:13:06,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:13:06,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:13:06,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:13:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:06,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:13:13,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {32779#true} call ULTIMATE.init(); {32779#true} is VALID [2022-04-15 06:13:13,980 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-15 06:13:13,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:13,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32779#true} #138#return; {32779#true} is VALID [2022-04-15 06:13:13,980 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-15 06:13:13,980 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-15 06:13:13,981 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-15 06:13:13,981 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-15 06:13:13,982 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-15 06:13:13,982 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-15 06:13:13,983 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-15 06:13:13,983 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-15 06:13:13,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:13,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:13,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:13,984 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-15 06:13:13,984 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-15 06:13:13,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:13,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:13,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:13,984 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-15 06:13:13,984 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-15 06:13:13,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:13,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:13,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:13,985 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-15 06:13:13,985 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-15 06:13:13,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:13,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:13,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:13,986 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-15 06:13:13,986 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-15 06:13:13,987 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-15 06:13:13,987 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-15 06:13:13,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:13,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:13,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:13,987 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-15 06:13:13,987 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-15 06:13:13,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:13,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:13,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:13,988 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-15 06:13:13,988 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-15 06:13:13,989 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-15 06:13:13,989 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-15 06:13:13,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:13,989 INFO L290 TraceCheckUtils]: 47: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:13,989 INFO L290 TraceCheckUtils]: 48: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:13,989 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-15 06:13:13,989 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-15 06:13:13,990 INFO L290 TraceCheckUtils]: 51: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:13,990 INFO L290 TraceCheckUtils]: 52: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:13,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:13,990 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-15 06:13:13,990 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-15 06:13:13,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:13,990 INFO L290 TraceCheckUtils]: 57: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:13,990 INFO L290 TraceCheckUtils]: 58: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:13,991 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-15 06:13:13,991 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-15 06:13:13,991 INFO L290 TraceCheckUtils]: 61: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-15 06:13:13,991 INFO L290 TraceCheckUtils]: 62: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-15 06:13:13,991 INFO L290 TraceCheckUtils]: 63: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-15 06:13:13,992 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-15 06:13:13,992 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-15 06:13:13,993 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-15 06:13:13,993 INFO L290 TraceCheckUtils]: 67: Hoare triple {32780#false} assume !(~j~0 < ~r~0); {32780#false} is VALID [2022-04-15 06:13:13,993 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-15 06:13:13,993 INFO L290 TraceCheckUtils]: 69: Hoare triple {32780#false} ~cond := #in~cond; {32780#false} is VALID [2022-04-15 06:13:13,993 INFO L290 TraceCheckUtils]: 70: Hoare triple {32780#false} assume !(0 == ~cond); {32780#false} is VALID [2022-04-15 06:13:13,993 INFO L290 TraceCheckUtils]: 71: Hoare triple {32780#false} assume true; {32780#false} is VALID [2022-04-15 06:13:13,993 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {32780#false} {32780#false} #118#return; {32780#false} is VALID [2022-04-15 06:13:13,993 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-15 06:13:13,993 INFO L290 TraceCheckUtils]: 74: Hoare triple {32780#false} ~cond := #in~cond; {32780#false} is VALID [2022-04-15 06:13:13,993 INFO L290 TraceCheckUtils]: 75: Hoare triple {32780#false} assume !(0 == ~cond); {32780#false} is VALID [2022-04-15 06:13:13,994 INFO L290 TraceCheckUtils]: 76: Hoare triple {32780#false} assume true; {32780#false} is VALID [2022-04-15 06:13:13,994 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {32780#false} {32780#false} #120#return; {32780#false} is VALID [2022-04-15 06:13:13,994 INFO L290 TraceCheckUtils]: 78: Hoare triple {32780#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {32780#false} is VALID [2022-04-15 06:13:13,994 INFO L290 TraceCheckUtils]: 79: Hoare triple {32780#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {32780#false} is VALID [2022-04-15 06:13:13,994 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-15 06:13:13,994 INFO L290 TraceCheckUtils]: 81: Hoare triple {32780#false} ~cond := #in~cond; {32780#false} is VALID [2022-04-15 06:13:13,994 INFO L290 TraceCheckUtils]: 82: Hoare triple {32780#false} assume 0 == ~cond; {32780#false} is VALID [2022-04-15 06:13:13,994 INFO L290 TraceCheckUtils]: 83: Hoare triple {32780#false} assume !false; {32780#false} is VALID [2022-04-15 06:13:13,994 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-15 06:13:13,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:13:13,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070971433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:13,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 06:13:13,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-04-15 06:13:13,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:13,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [542904910] [2022-04-15 06:13:13,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [542904910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:13,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:13,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:13:13,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113254668] [2022-04-15 06:13:13,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:13,996 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-15 06:13:13,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:13,996 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-15 06:13:14,039 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-15 06:13:14,040 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:13:14,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:14,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:13:14,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:13:14,040 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-15 06:13:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:16,247 INFO L93 Difference]: Finished difference Result 549 states and 838 transitions. [2022-04-15 06:13:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:13:16,248 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-15 06:13:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:16,249 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-15 06:13:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-04-15 06:13:16,251 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-15 06:13:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-04-15 06:13:16,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 168 transitions. [2022-04-15 06:13:16,385 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-15 06:13:16,390 INFO L225 Difference]: With dead ends: 549 [2022-04-15 06:13:16,390 INFO L226 Difference]: Without dead ends: 249 [2022-04-15 06:13:16,391 INFO L912 BasicCegarLoop]: 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-15 06:13:16,391 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 20 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:16,391 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 170 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:13:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-15 06:13:17,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 238. [2022-04-15 06:13:17,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:17,447 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-15 06:13:17,447 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-15 06:13:17,447 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-15 06:13:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:17,452 INFO L93 Difference]: Finished difference Result 249 states and 369 transitions. [2022-04-15 06:13:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2022-04-15 06:13:17,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:17,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:17,453 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-15 06:13:17,453 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-15 06:13:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:17,459 INFO L93 Difference]: Finished difference Result 249 states and 369 transitions. [2022-04-15 06:13:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2022-04-15 06:13:17,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:17,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:17,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:17,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:17,461 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-15 06:13:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 354 transitions. [2022-04-15 06:13:17,466 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 354 transitions. Word has length 84 [2022-04-15 06:13:17,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:17,466 INFO L478 AbstractCegarLoop]: Abstraction has 238 states and 354 transitions. [2022-04-15 06:13:17,466 INFO L479 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-15 06:13:17,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 354 transitions. [2022-04-15 06:13:17,973 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-15 06:13:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 354 transitions. [2022-04-15 06:13:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 06:13:17,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:17,974 INFO L499 BasicCegarLoop]: 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-15 06:13:17,991 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-15 06:13:18,175 WARN L460 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-15 06:13:18,175 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:18,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:18,176 INFO L85 PathProgramCache]: Analyzing trace with hash -560912485, now seen corresponding path program 1 times [2022-04-15 06:13:18,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:18,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1031164541] [2022-04-15 06:13:18,176 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:13:18,176 INFO L85 PathProgramCache]: Analyzing trace with hash -560912485, now seen corresponding path program 2 times [2022-04-15 06:13:18,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:18,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008873040] [2022-04-15 06:13:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:18,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,246 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-15 06:13:18,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-15 06:13:18,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:13:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #118#return; {35169#true} is VALID [2022-04-15 06:13:18,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:13:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #120#return; {35169#true} is VALID [2022-04-15 06:13:18,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 06:13:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #130#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-15 06:13:18,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 06:13:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #132#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-15 06:13:18,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:13:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #110#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:18,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-15 06:13:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #112#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:18,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 06:13:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #114#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:18,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-15 06:13:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #116#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:18,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 06:13:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #118#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-15 06:13:18,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-15 06:13:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #120#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-15 06:13:18,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 06:13:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #122#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-15 06:13:18,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-15 06:13:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #124#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-15 06:13:18,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-15 06:13:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #126#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-15 06:13:18,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-15 06:13:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #128#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-15 06:13:18,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-15 06:13:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #118#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-15 06:13:18,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-15 06:13:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #120#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-15 06:13:18,285 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-15 06:13:18,285 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-15 06:13:18,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-15 06:13:18,286 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-15 06:13:18,286 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-15 06:13:18,286 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-15 06:13:18,286 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-15 06:13:18,286 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-15 06:13:18,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {35169#true} assume !!(~j~0 <= ~r~0); {35169#true} is VALID [2022-04-15 06:13:18,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {35169#true} assume !(~j~0 < ~r~0); {35169#true} is VALID [2022-04-15 06:13:18,286 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-15 06:13:18,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,286 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35169#true} {35169#true} #118#return; {35169#true} is VALID [2022-04-15 06:13:18,286 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-15 06:13:18,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,287 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {35169#true} {35169#true} #120#return; {35169#true} is VALID [2022-04-15 06:13:18,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {35169#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35169#true} is VALID [2022-04-15 06:13:18,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {35169#true} assume 0 != #t~nondet5;havoc #t~nondet5; {35169#true} is VALID [2022-04-15 06:13:18,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {35169#true} assume ~l~0 > 1; {35182#(<= 2 main_~l~0)} is VALID [2022-04-15 06:13:18,287 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-15 06:13:18,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,288 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #130#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-15 06:13:18,288 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-15 06:13:18,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,288 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #132#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-15 06:13:18,289 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-15 06:13:18,289 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-15 06:13:18,290 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-15 06:13:18,290 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-15 06:13:18,290 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-15 06:13:18,290 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,290 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,290 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,290 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #110#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:18,290 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-15 06:13:18,291 INFO L290 TraceCheckUtils]: 44: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,291 INFO L290 TraceCheckUtils]: 45: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,291 INFO L290 TraceCheckUtils]: 46: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,291 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #112#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:18,291 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-15 06:13:18,291 INFO L290 TraceCheckUtils]: 49: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,291 INFO L290 TraceCheckUtils]: 50: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,291 INFO L290 TraceCheckUtils]: 51: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,292 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #114#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:18,292 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-15 06:13:18,292 INFO L290 TraceCheckUtils]: 54: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,292 INFO L290 TraceCheckUtils]: 55: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,292 INFO L290 TraceCheckUtils]: 56: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,292 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #116#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:18,293 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-15 06:13:18,293 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-15 06:13:18,293 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-15 06:13:18,293 INFO L290 TraceCheckUtils]: 61: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,293 INFO L290 TraceCheckUtils]: 62: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,293 INFO L290 TraceCheckUtils]: 63: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,294 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #118#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-15 06:13:18,294 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-15 06:13:18,294 INFO L290 TraceCheckUtils]: 66: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,294 INFO L290 TraceCheckUtils]: 67: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,294 INFO L290 TraceCheckUtils]: 68: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,294 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #120#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-15 06:13:18,295 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-15 06:13:18,295 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-15 06:13:18,295 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-15 06:13:18,295 INFO L290 TraceCheckUtils]: 73: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,295 INFO L290 TraceCheckUtils]: 74: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,295 INFO L290 TraceCheckUtils]: 75: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,296 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #122#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-15 06:13:18,296 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-15 06:13:18,296 INFO L290 TraceCheckUtils]: 78: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,296 INFO L290 TraceCheckUtils]: 79: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,296 INFO L290 TraceCheckUtils]: 80: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,296 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #124#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-15 06:13:18,296 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-15 06:13:18,296 INFO L290 TraceCheckUtils]: 83: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,296 INFO L290 TraceCheckUtils]: 84: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,297 INFO L290 TraceCheckUtils]: 85: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,297 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #126#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-15 06:13:18,297 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-15 06:13:18,297 INFO L290 TraceCheckUtils]: 88: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,297 INFO L290 TraceCheckUtils]: 89: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,297 INFO L290 TraceCheckUtils]: 90: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,297 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #128#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-15 06:13:18,298 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-15 06:13:18,298 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-15 06:13:18,298 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-15 06:13:18,298 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-15 06:13:18,298 INFO L290 TraceCheckUtils]: 96: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,299 INFO L290 TraceCheckUtils]: 97: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,299 INFO L290 TraceCheckUtils]: 98: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,299 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #118#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-15 06:13:18,299 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-15 06:13:18,299 INFO L290 TraceCheckUtils]: 101: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:18,299 INFO L290 TraceCheckUtils]: 102: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:18,299 INFO L290 TraceCheckUtils]: 103: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:18,300 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #120#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-15 06:13:18,300 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-15 06:13:18,300 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-15 06:13:18,301 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-15 06:13:18,301 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-15 06:13:18,301 INFO L290 TraceCheckUtils]: 109: Hoare triple {35244#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {35170#false} is VALID [2022-04-15 06:13:18,301 INFO L290 TraceCheckUtils]: 110: Hoare triple {35170#false} assume !false; {35170#false} is VALID [2022-04-15 06:13:18,302 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-15 06:13:18,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:18,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008873040] [2022-04-15 06:13:18,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008873040] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:13:18,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535433866] [2022-04-15 06:13:18,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:13:18,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:18,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:18,303 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-15 06:13:18,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 06:13:18,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:13:18,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:13:18,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:13:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:18,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:13:23,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {35169#true} call ULTIMATE.init(); {35169#true} is VALID [2022-04-15 06:13:23,057 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-15 06:13:23,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-15 06:13:23,058 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-15 06:13:23,058 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-15 06:13:23,058 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-15 06:13:23,058 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-15 06:13:23,058 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-15 06:13:23,058 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-15 06:13:23,059 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-15 06:13:23,059 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-15 06:13:23,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,060 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-15 06:13:23,060 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-15 06:13:23,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,060 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-15 06:13:23,061 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-15 06:13:23,061 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-15 06:13:23,061 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-15 06:13:23,061 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-15 06:13:23,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,062 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-15 06:13:23,062 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-15 06:13:23,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,062 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-15 06:13:23,063 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-15 06:13:23,063 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-15 06:13:23,064 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-15 06:13:23,064 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-15 06:13:23,064 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-15 06:13:23,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,065 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-15 06:13:23,075 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-15 06:13:23,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,075 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-15 06:13:23,075 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-15 06:13:23,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,076 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-15 06:13:23,076 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-15 06:13:23,076 INFO L290 TraceCheckUtils]: 54: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,076 INFO L290 TraceCheckUtils]: 55: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,076 INFO L290 TraceCheckUtils]: 56: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,077 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-15 06:13:23,077 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-15 06:13:23,078 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-15 06:13:23,078 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-15 06:13:23,078 INFO L290 TraceCheckUtils]: 61: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,078 INFO L290 TraceCheckUtils]: 62: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,078 INFO L290 TraceCheckUtils]: 63: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,078 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-15 06:13:23,078 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-15 06:13:23,078 INFO L290 TraceCheckUtils]: 66: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,078 INFO L290 TraceCheckUtils]: 67: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,079 INFO L290 TraceCheckUtils]: 68: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,079 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-15 06:13:23,079 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-15 06:13:23,080 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-15 06:13:23,080 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-15 06:13:23,080 INFO L290 TraceCheckUtils]: 73: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,080 INFO L290 TraceCheckUtils]: 74: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,080 INFO L290 TraceCheckUtils]: 75: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,080 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-15 06:13:23,080 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-15 06:13:23,080 INFO L290 TraceCheckUtils]: 78: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,080 INFO L290 TraceCheckUtils]: 79: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,081 INFO L290 TraceCheckUtils]: 80: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,081 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-15 06:13:23,081 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-15 06:13:23,081 INFO L290 TraceCheckUtils]: 83: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,081 INFO L290 TraceCheckUtils]: 84: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,081 INFO L290 TraceCheckUtils]: 85: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,081 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-15 06:13:23,082 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-15 06:13:23,082 INFO L290 TraceCheckUtils]: 88: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,082 INFO L290 TraceCheckUtils]: 89: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,082 INFO L290 TraceCheckUtils]: 90: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,082 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-15 06:13:23,083 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-15 06:13:23,083 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-15 06:13:23,083 INFO L290 TraceCheckUtils]: 94: Hoare triple {35170#false} assume !(~j~0 < ~r~0); {35170#false} is VALID [2022-04-15 06:13:23,083 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-15 06:13:23,084 INFO L290 TraceCheckUtils]: 96: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-15 06:13:23,084 INFO L290 TraceCheckUtils]: 97: Hoare triple {35170#false} assume !(0 == ~cond); {35170#false} is VALID [2022-04-15 06:13:23,084 INFO L290 TraceCheckUtils]: 98: Hoare triple {35170#false} assume true; {35170#false} is VALID [2022-04-15 06:13:23,084 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35170#false} {35170#false} #118#return; {35170#false} is VALID [2022-04-15 06:13:23,084 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-15 06:13:23,084 INFO L290 TraceCheckUtils]: 101: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-15 06:13:23,084 INFO L290 TraceCheckUtils]: 102: Hoare triple {35170#false} assume !(0 == ~cond); {35170#false} is VALID [2022-04-15 06:13:23,084 INFO L290 TraceCheckUtils]: 103: Hoare triple {35170#false} assume true; {35170#false} is VALID [2022-04-15 06:13:23,084 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35170#false} {35170#false} #120#return; {35170#false} is VALID [2022-04-15 06:13:23,084 INFO L290 TraceCheckUtils]: 105: Hoare triple {35170#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35170#false} is VALID [2022-04-15 06:13:23,084 INFO L290 TraceCheckUtils]: 106: Hoare triple {35170#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {35170#false} is VALID [2022-04-15 06:13:23,084 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-15 06:13:23,084 INFO L290 TraceCheckUtils]: 108: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-15 06:13:23,084 INFO L290 TraceCheckUtils]: 109: Hoare triple {35170#false} assume 0 == ~cond; {35170#false} is VALID [2022-04-15 06:13:23,085 INFO L290 TraceCheckUtils]: 110: Hoare triple {35170#false} assume !false; {35170#false} is VALID [2022-04-15 06:13:23,085 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-15 06:13:23,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:13:23,830 INFO L290 TraceCheckUtils]: 110: Hoare triple {35170#false} assume !false; {35170#false} is VALID [2022-04-15 06:13:23,831 INFO L290 TraceCheckUtils]: 109: Hoare triple {35170#false} assume 0 == ~cond; {35170#false} is VALID [2022-04-15 06:13:23,831 INFO L290 TraceCheckUtils]: 108: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-15 06:13:23,831 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-15 06:13:23,831 INFO L290 TraceCheckUtils]: 106: Hoare triple {35170#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {35170#false} is VALID [2022-04-15 06:13:23,831 INFO L290 TraceCheckUtils]: 105: Hoare triple {35170#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35170#false} is VALID [2022-04-15 06:13:23,831 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35169#true} {35170#false} #120#return; {35170#false} is VALID [2022-04-15 06:13:23,831 INFO L290 TraceCheckUtils]: 103: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,832 INFO L290 TraceCheckUtils]: 102: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,832 INFO L290 TraceCheckUtils]: 101: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,832 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-15 06:13:23,832 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35169#true} {35170#false} #118#return; {35170#false} is VALID [2022-04-15 06:13:23,832 INFO L290 TraceCheckUtils]: 98: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,832 INFO L290 TraceCheckUtils]: 97: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,832 INFO L290 TraceCheckUtils]: 96: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,832 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-15 06:13:23,832 INFO L290 TraceCheckUtils]: 94: Hoare triple {35170#false} assume !(~j~0 < ~r~0); {35170#false} is VALID [2022-04-15 06:13:23,833 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-15 06:13:23,833 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-15 06:13:23,834 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-15 06:13:23,834 INFO L290 TraceCheckUtils]: 90: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,834 INFO L290 TraceCheckUtils]: 89: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,834 INFO L290 TraceCheckUtils]: 88: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,834 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-15 06:13:23,835 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-15 06:13:23,835 INFO L290 TraceCheckUtils]: 85: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,835 INFO L290 TraceCheckUtils]: 84: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,835 INFO L290 TraceCheckUtils]: 83: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,835 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-15 06:13:23,836 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-15 06:13:23,836 INFO L290 TraceCheckUtils]: 80: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,836 INFO L290 TraceCheckUtils]: 79: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,836 INFO L290 TraceCheckUtils]: 78: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,836 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-15 06:13:23,837 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-15 06:13:23,837 INFO L290 TraceCheckUtils]: 75: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,837 INFO L290 TraceCheckUtils]: 74: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,837 INFO L290 TraceCheckUtils]: 73: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,837 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-15 06:13:23,838 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-15 06:13:23,838 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-15 06:13:23,839 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-15 06:13:23,839 INFO L290 TraceCheckUtils]: 68: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,839 INFO L290 TraceCheckUtils]: 67: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,839 INFO L290 TraceCheckUtils]: 66: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,839 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-15 06:13:23,839 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-15 06:13:23,839 INFO L290 TraceCheckUtils]: 63: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,840 INFO L290 TraceCheckUtils]: 62: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,840 INFO L290 TraceCheckUtils]: 61: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,840 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-15 06:13:23,841 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-15 06:13:23,841 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-15 06:13:23,841 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-15 06:13:23,842 INFO L290 TraceCheckUtils]: 56: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,842 INFO L290 TraceCheckUtils]: 55: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,842 INFO L290 TraceCheckUtils]: 54: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,842 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-15 06:13:23,842 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-15 06:13:23,842 INFO L290 TraceCheckUtils]: 51: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,843 INFO L290 TraceCheckUtils]: 50: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,843 INFO L290 TraceCheckUtils]: 49: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,843 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-15 06:13:23,843 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-15 06:13:23,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,844 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-15 06:13:23,844 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-15 06:13:23,844 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,844 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,844 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,844 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-15 06:13:23,845 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-15 06:13:23,845 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-15 06:13:23,846 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-15 06:13:23,847 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-15 06:13:23,847 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-15 06:13:23,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,848 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-15 06:13:23,848 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-15 06:13:23,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,848 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-15 06:13:23,849 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-15 06:13:23,849 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-15 06:13:23,850 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-15 06:13:23,850 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-15 06:13:23,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,851 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-15 06:13:23,851 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-15 06:13:23,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-15 06:13:23,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-15 06:13:23,852 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-15 06:13:23,852 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-15 06:13:23,853 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-15 06:13:23,853 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-15 06:13:23,853 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-15 06:13:23,854 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-15 06:13:23,854 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-15 06:13:23,854 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-15 06:13:23,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-15 06:13:23,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-15 06:13:23,854 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-15 06:13:23,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {35169#true} call ULTIMATE.init(); {35169#true} is VALID [2022-04-15 06:13:23,855 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-15 06:13:23,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535433866] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:13:23,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:13:23,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2022-04-15 06:13:23,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:23,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1031164541] [2022-04-15 06:13:23,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1031164541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:23,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:23,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:13:23,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791232601] [2022-04-15 06:13:23,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:23,856 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-15 06:13:23,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:23,857 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-15 06:13:23,925 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-15 06:13:23,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:13:23,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:23,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:13:23,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:13:23,926 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-15 06:13:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:28,530 INFO L93 Difference]: Finished difference Result 350 states and 539 transitions. [2022-04-15 06:13:28,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:13:28,530 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-15 06:13:28,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:28,531 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-15 06:13:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-04-15 06:13:28,532 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-15 06:13:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-04-15 06:13:28,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 151 transitions. [2022-04-15 06:13:28,672 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-15 06:13:28,679 INFO L225 Difference]: With dead ends: 350 [2022-04-15 06:13:28,679 INFO L226 Difference]: Without dead ends: 348 [2022-04-15 06:13:28,680 INFO L912 BasicCegarLoop]: 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-15 06:13:28,680 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 69 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:28,680 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 101 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 06:13:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-15 06:13:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 294. [2022-04-15 06:13:30,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:30,752 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-15 06:13:30,752 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-15 06:13:30,753 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-15 06:13:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:30,760 INFO L93 Difference]: Finished difference Result 348 states and 537 transitions. [2022-04-15 06:13:30,761 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 537 transitions. [2022-04-15 06:13:30,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:30,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:30,762 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-15 06:13:30,762 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-15 06:13:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:30,776 INFO L93 Difference]: Finished difference Result 348 states and 537 transitions. [2022-04-15 06:13:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 537 transitions. [2022-04-15 06:13:30,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:30,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:30,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:30,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:30,778 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-15 06:13:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 451 transitions. [2022-04-15 06:13:30,796 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 451 transitions. Word has length 111 [2022-04-15 06:13:30,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:30,798 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 451 transitions. [2022-04-15 06:13:30,798 INFO L479 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-15 06:13:30,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 294 states and 451 transitions. [2022-04-15 06:13:31,472 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-15 06:13:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 451 transitions. [2022-04-15 06:13:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 06:13:31,473 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:31,473 INFO L499 BasicCegarLoop]: 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-15 06:13:31,528 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-15 06:13:31,673 WARN L460 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-15 06:13:31,673 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:31,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:31,674 INFO L85 PathProgramCache]: Analyzing trace with hash 977427545, now seen corresponding path program 1 times [2022-04-15 06:13:31,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:31,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2098117421] [2022-04-15 06:13:31,674 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:13:31,674 INFO L85 PathProgramCache]: Analyzing trace with hash 977427545, now seen corresponding path program 2 times [2022-04-15 06:13:31,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:31,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171589067] [2022-04-15 06:13:31,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:31,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,770 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-15 06:13:31,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-15 06:13:31,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:13:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #118#return; {37933#true} is VALID [2022-04-15 06:13:31,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:13:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #120#return; {37933#true} is VALID [2022-04-15 06:13:31,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 06:13:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #130#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-15 06:13:31,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 06:13:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #132#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-15 06:13:31,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:13:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #110#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-15 06:13:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #112#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 06:13:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #114#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-15 06:13:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #116#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 06:13:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #118#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-15 06:13:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #120#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 06:13:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #122#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-15 06:13:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #124#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-15 06:13:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #126#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-15 06:13:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #128#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-15 06:13:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #118#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-15 06:13:31,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-15 06:13:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #120#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-15 06:13:31,847 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-15 06:13:31,847 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-15 06:13:31,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-15 06:13:31,847 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-15 06:13:31,847 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-15 06:13:31,847 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-15 06:13:31,848 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-15 06:13:31,848 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-15 06:13:31,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {37933#true} assume !!(~j~0 <= ~r~0); {37933#true} is VALID [2022-04-15 06:13:31,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {37933#true} assume !(~j~0 < ~r~0); {37933#true} is VALID [2022-04-15 06:13:31,848 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-15 06:13:31,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,848 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37933#true} {37933#true} #118#return; {37933#true} is VALID [2022-04-15 06:13:31,848 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-15 06:13:31,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,848 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37933#true} {37933#true} #120#return; {37933#true} is VALID [2022-04-15 06:13:31,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {37933#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {37933#true} is VALID [2022-04-15 06:13:31,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {37933#true} assume 0 != #t~nondet5;havoc #t~nondet5; {37933#true} is VALID [2022-04-15 06:13:31,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {37933#true} assume ~l~0 > 1; {37946#(<= 2 main_~l~0)} is VALID [2022-04-15 06:13:31,849 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-15 06:13:31,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,850 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #130#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-15 06:13:31,850 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-15 06:13:31,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,850 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #132#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-15 06:13:31,851 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-15 06:13:31,851 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-15 06:13:31,851 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-15 06:13:31,852 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-15 06:13:31,852 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-15 06:13:31,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,852 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #110#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,852 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-15 06:13:31,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,853 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #112#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,853 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-15 06:13:31,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,853 INFO L290 TraceCheckUtils]: 50: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,853 INFO L290 TraceCheckUtils]: 51: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,854 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #114#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,854 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-15 06:13:31,854 INFO L290 TraceCheckUtils]: 54: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,854 INFO L290 TraceCheckUtils]: 55: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,854 INFO L290 TraceCheckUtils]: 56: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,854 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #116#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,855 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-15 06:13:31,855 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-15 06:13:31,855 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-15 06:13:31,855 INFO L290 TraceCheckUtils]: 61: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,855 INFO L290 TraceCheckUtils]: 62: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,855 INFO L290 TraceCheckUtils]: 63: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,855 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #118#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,856 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-15 06:13:31,856 INFO L290 TraceCheckUtils]: 66: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,856 INFO L290 TraceCheckUtils]: 67: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,856 INFO L290 TraceCheckUtils]: 68: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,856 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #120#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,856 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-15 06:13:31,857 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-15 06:13:31,857 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-15 06:13:31,857 INFO L290 TraceCheckUtils]: 73: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,857 INFO L290 TraceCheckUtils]: 74: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,857 INFO L290 TraceCheckUtils]: 75: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,857 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #122#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,857 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-15 06:13:31,857 INFO L290 TraceCheckUtils]: 78: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,857 INFO L290 TraceCheckUtils]: 79: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,857 INFO L290 TraceCheckUtils]: 80: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,858 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #124#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,858 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-15 06:13:31,858 INFO L290 TraceCheckUtils]: 83: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,858 INFO L290 TraceCheckUtils]: 84: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,858 INFO L290 TraceCheckUtils]: 85: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,858 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #126#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,858 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-15 06:13:31,858 INFO L290 TraceCheckUtils]: 88: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,859 INFO L290 TraceCheckUtils]: 89: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,859 INFO L290 TraceCheckUtils]: 90: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,859 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #128#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-15 06:13:31,859 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-15 06:13:31,859 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-15 06:13:31,860 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-15 06:13:31,860 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-15 06:13:31,860 INFO L290 TraceCheckUtils]: 96: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,860 INFO L290 TraceCheckUtils]: 97: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,860 INFO L290 TraceCheckUtils]: 98: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,860 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #118#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-15 06:13:31,860 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-15 06:13:31,860 INFO L290 TraceCheckUtils]: 101: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:31,860 INFO L290 TraceCheckUtils]: 102: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:31,860 INFO L290 TraceCheckUtils]: 103: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:31,861 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #120#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-15 06:13:31,861 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-15 06:13:31,861 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-15 06:13:31,862 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-15 06:13:31,862 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-15 06:13:31,862 INFO L290 TraceCheckUtils]: 109: Hoare triple {38007#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {37934#false} is VALID [2022-04-15 06:13:31,862 INFO L290 TraceCheckUtils]: 110: Hoare triple {37934#false} assume !false; {37934#false} is VALID [2022-04-15 06:13:31,863 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-15 06:13:31,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:31,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171589067] [2022-04-15 06:13:31,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171589067] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:13:31,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589600906] [2022-04-15 06:13:31,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:13:31,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:31,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:31,864 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-15 06:13:31,865 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-15 06:13:31,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:13:31,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:13:31,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 06:13:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:13:34,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {37933#true} call ULTIMATE.init(); {37933#true} is VALID [2022-04-15 06:13:34,199 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-15 06:13:34,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-15 06:13:34,199 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-15 06:13:34,199 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-15 06:13:34,199 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-15 06:13:34,199 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-15 06:13:34,213 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-15 06:13:34,214 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-15 06:13:34,214 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-15 06:13:34,214 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-15 06:13:34,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,215 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-15 06:13:34,215 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-15 06:13:34,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,215 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-15 06:13:34,216 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-15 06:13:34,216 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-15 06:13:34,216 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-15 06:13:34,216 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-15 06:13:34,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,217 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-15 06:13:34,217 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-15 06:13:34,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,217 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-15 06:13:34,218 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-15 06:13:34,218 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-15 06:13:34,218 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-15 06:13:34,219 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-15 06:13:34,219 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-15 06:13:34,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,219 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-15 06:13:34,219 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-15 06:13:34,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,219 INFO L290 TraceCheckUtils]: 45: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,219 INFO L290 TraceCheckUtils]: 46: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,220 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-15 06:13:34,220 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-15 06:13:34,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,220 INFO L290 TraceCheckUtils]: 50: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,220 INFO L290 TraceCheckUtils]: 51: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,220 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-15 06:13:34,220 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-15 06:13:34,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,221 INFO L290 TraceCheckUtils]: 56: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,221 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-15 06:13:34,221 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-15 06:13:34,221 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-15 06:13:34,221 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-15 06:13:34,221 INFO L290 TraceCheckUtils]: 61: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,222 INFO L290 TraceCheckUtils]: 62: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,222 INFO L290 TraceCheckUtils]: 63: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,222 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-15 06:13:34,222 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-15 06:13:34,222 INFO L290 TraceCheckUtils]: 66: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,222 INFO L290 TraceCheckUtils]: 67: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,222 INFO L290 TraceCheckUtils]: 68: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,222 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-15 06:13:34,223 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-15 06:13:34,223 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-15 06:13:34,223 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-15 06:13:34,223 INFO L290 TraceCheckUtils]: 73: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,223 INFO L290 TraceCheckUtils]: 74: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,223 INFO L290 TraceCheckUtils]: 75: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,224 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-15 06:13:34,224 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-15 06:13:34,224 INFO L290 TraceCheckUtils]: 78: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,224 INFO L290 TraceCheckUtils]: 79: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,224 INFO L290 TraceCheckUtils]: 80: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,224 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-15 06:13:34,224 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-15 06:13:34,224 INFO L290 TraceCheckUtils]: 83: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,224 INFO L290 TraceCheckUtils]: 84: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,224 INFO L290 TraceCheckUtils]: 85: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,225 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-15 06:13:34,225 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-15 06:13:34,225 INFO L290 TraceCheckUtils]: 88: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,225 INFO L290 TraceCheckUtils]: 89: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,225 INFO L290 TraceCheckUtils]: 90: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,225 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-15 06:13:34,226 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-15 06:13:34,226 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-15 06:13:34,227 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-15 06:13:34,227 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-15 06:13:34,227 INFO L290 TraceCheckUtils]: 96: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,227 INFO L290 TraceCheckUtils]: 97: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,227 INFO L290 TraceCheckUtils]: 98: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,227 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #118#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-15 06:13:34,227 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-15 06:13:34,227 INFO L290 TraceCheckUtils]: 101: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:34,228 INFO L290 TraceCheckUtils]: 102: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:34,228 INFO L290 TraceCheckUtils]: 103: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:34,228 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #120#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-15 06:13:34,229 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-15 06:13:34,229 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-15 06:13:34,229 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-15 06:13:34,229 INFO L290 TraceCheckUtils]: 108: Hoare triple {38338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:13:34,230 INFO L290 TraceCheckUtils]: 109: Hoare triple {38342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37934#false} is VALID [2022-04-15 06:13:34,230 INFO L290 TraceCheckUtils]: 110: Hoare triple {37934#false} assume !false; {37934#false} is VALID [2022-04-15 06:13:34,230 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-15 06:13:34,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:13:35,443 INFO L290 TraceCheckUtils]: 110: Hoare triple {37934#false} assume !false; {37934#false} is VALID [2022-04-15 06:13:35,444 INFO L290 TraceCheckUtils]: 109: Hoare triple {38342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37934#false} is VALID [2022-04-15 06:13:35,444 INFO L290 TraceCheckUtils]: 108: Hoare triple {38338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:13:35,445 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-15 06:13:35,445 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-15 06:13:35,445 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-15 06:13:35,446 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {37933#true} {38358#(<= 1 main_~i~0)} #120#return; {38358#(<= 1 main_~i~0)} is VALID [2022-04-15 06:13:35,446 INFO L290 TraceCheckUtils]: 103: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,446 INFO L290 TraceCheckUtils]: 102: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,446 INFO L290 TraceCheckUtils]: 101: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,446 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-15 06:13:35,446 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {37933#true} {38358#(<= 1 main_~i~0)} #118#return; {38358#(<= 1 main_~i~0)} is VALID [2022-04-15 06:13:35,447 INFO L290 TraceCheckUtils]: 98: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,447 INFO L290 TraceCheckUtils]: 97: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,447 INFO L290 TraceCheckUtils]: 96: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,447 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-15 06:13:35,447 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-15 06:13:35,447 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-15 06:13:35,448 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-15 06:13:35,448 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-15 06:13:35,449 INFO L290 TraceCheckUtils]: 90: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,449 INFO L290 TraceCheckUtils]: 89: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,449 INFO L290 TraceCheckUtils]: 88: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,449 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-15 06:13:35,449 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-15 06:13:35,449 INFO L290 TraceCheckUtils]: 85: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,449 INFO L290 TraceCheckUtils]: 84: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,449 INFO L290 TraceCheckUtils]: 83: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,449 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-15 06:13:35,450 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-15 06:13:35,450 INFO L290 TraceCheckUtils]: 80: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,450 INFO L290 TraceCheckUtils]: 79: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,450 INFO L290 TraceCheckUtils]: 78: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,450 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-15 06:13:35,451 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-15 06:13:35,451 INFO L290 TraceCheckUtils]: 75: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,451 INFO L290 TraceCheckUtils]: 74: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,451 INFO L290 TraceCheckUtils]: 73: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,451 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-15 06:13:35,451 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-15 06:13:35,452 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-15 06:13:35,452 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-15 06:13:35,452 INFO L290 TraceCheckUtils]: 68: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,452 INFO L290 TraceCheckUtils]: 67: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,452 INFO L290 TraceCheckUtils]: 66: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,452 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-15 06:13:35,453 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-15 06:13:35,453 INFO L290 TraceCheckUtils]: 63: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,453 INFO L290 TraceCheckUtils]: 62: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,453 INFO L290 TraceCheckUtils]: 61: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,453 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-15 06:13:35,453 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-15 06:13:35,455 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-15 06:13:35,455 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-15 06:13:35,456 INFO L290 TraceCheckUtils]: 56: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,456 INFO L290 TraceCheckUtils]: 55: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,456 INFO L290 TraceCheckUtils]: 54: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,456 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-15 06:13:35,456 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-15 06:13:35,456 INFO L290 TraceCheckUtils]: 51: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,456 INFO L290 TraceCheckUtils]: 50: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,456 INFO L290 TraceCheckUtils]: 49: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,457 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-15 06:13:35,457 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-15 06:13:35,457 INFO L290 TraceCheckUtils]: 46: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,457 INFO L290 TraceCheckUtils]: 45: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,457 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-15 06:13:35,458 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-15 06:13:35,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,458 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-15 06:13:35,458 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-15 06:13:35,459 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-15 06:13:35,459 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-15 06:13:35,460 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-15 06:13:35,460 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-15 06:13:35,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,461 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-15 06:13:35,461 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-15 06:13:35,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,461 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-15 06:13:35,462 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-15 06:13:35,462 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-15 06:13:35,462 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-15 06:13:35,463 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-15 06:13:35,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,463 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-15 06:13:35,464 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-15 06:13:35,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-15 06:13:35,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-15 06:13:35,464 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-15 06:13:35,464 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-15 06:13:35,465 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-15 06:13:35,465 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-15 06:13:35,465 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-15 06:13:35,466 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-15 06:13:35,466 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-15 06:13:35,466 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-15 06:13:35,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-15 06:13:35,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-15 06:13:35,466 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-15 06:13:35,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {37933#true} call ULTIMATE.init(); {37933#true} is VALID [2022-04-15 06:13:35,466 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-15 06:13:35,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589600906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:13:35,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:13:35,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 22 [2022-04-15 06:13:35,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:35,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2098117421] [2022-04-15 06:13:35,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2098117421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:35,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:35,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:13:35,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924494457] [2022-04-15 06:13:35,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:35,468 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-15 06:13:35,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:35,468 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-15 06:13:35,513 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-15 06:13:35,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:13:35,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:35,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:13:35,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:13:35,514 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-15 06:13:37,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:37,880 INFO L93 Difference]: Finished difference Result 323 states and 492 transitions. [2022-04-15 06:13:37,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:13:37,880 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-15 06:13:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:37,880 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-15 06:13:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2022-04-15 06:13:37,881 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-15 06:13:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2022-04-15 06:13:37,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 107 transitions. [2022-04-15 06:13:37,946 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-15 06:13:37,952 INFO L225 Difference]: With dead ends: 323 [2022-04-15 06:13:37,952 INFO L226 Difference]: Without dead ends: 321 [2022-04-15 06:13:37,952 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:13:37,954 INFO L913 BasicCegarLoop]: 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-15 06:13:37,954 INFO L914 BasicCegarLoop]: 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-15 06:13:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-15 06:13:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 242. [2022-04-15 06:13:39,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:39,541 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-15 06:13:39,541 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-15 06:13:39,541 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-15 06:13:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:39,548 INFO L93 Difference]: Finished difference Result 321 states and 490 transitions. [2022-04-15 06:13:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 490 transitions. [2022-04-15 06:13:39,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:39,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:39,549 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-15 06:13:39,549 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-15 06:13:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:39,564 INFO L93 Difference]: Finished difference Result 321 states and 490 transitions. [2022-04-15 06:13:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 490 transitions. [2022-04-15 06:13:39,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:39,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:39,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:39,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:39,566 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-15 06:13:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 357 transitions. [2022-04-15 06:13:39,571 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 357 transitions. Word has length 111 [2022-04-15 06:13:39,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:39,571 INFO L478 AbstractCegarLoop]: Abstraction has 242 states and 357 transitions. [2022-04-15 06:13:39,571 INFO L479 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-15 06:13:39,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 357 transitions. [2022-04-15 06:13:40,053 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-15 06:13:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 357 transitions. [2022-04-15 06:13:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-15 06:13:40,054 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:40,054 INFO L499 BasicCegarLoop]: 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-15 06:13:40,071 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-15 06:13:40,271 WARN L460 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-15 06:13:40,272 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:40,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1099325000, now seen corresponding path program 3 times [2022-04-15 06:13:40,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:40,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291767306] [2022-04-15 06:13:40,275 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:13:40,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1099325000, now seen corresponding path program 4 times [2022-04-15 06:13:40,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:40,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171668018] [2022-04-15 06:13:40,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:40,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,386 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-15 06:13:40,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-15 06:13:40,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:13:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,389 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-15 06:13:40,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:13:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,398 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-15 06:13:40,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 06:13:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,400 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-15 06:13:40,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 06:13:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,403 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-15 06:13:40,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:13:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,405 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-15 06:13:40,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-15 06:13:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,408 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-15 06:13:40,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 06:13:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,418 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-15 06:13:40,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-15 06:13:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,421 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-15 06:13:40,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 06:13:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,435 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-15 06:13:40,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-15 06:13:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,439 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-15 06:13:40,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 06:13:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,441 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-15 06:13:40,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-15 06:13:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,443 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-15 06:13:40,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-15 06:13:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,446 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-15 06:13:40,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-15 06:13:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,453 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-15 06:13:40,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-15 06:13:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40478#false} #118#return; {40478#false} is VALID [2022-04-15 06:13:40,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-15 06:13:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40478#false} #120#return; {40478#false} is VALID [2022-04-15 06:13:40,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-04-15 06:13:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40478#false} #122#return; {40478#false} is VALID [2022-04-15 06:13:40,461 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-15 06:13:40,461 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-15 06:13:40,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-15 06:13:40,461 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-15 06:13:40,461 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-15 06:13:40,461 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-15 06:13:40,461 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-15 06:13:40,462 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-15 06:13:40,462 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-15 06:13:40,462 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-15 06:13:40,463 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-15 06:13:40,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,463 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-15 06:13:40,463 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-15 06:13:40,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,464 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-15 06:13:40,464 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-15 06:13:40,464 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-15 06:13:40,465 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-15 06:13:40,465 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-15 06:13:40,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,465 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-15 06:13:40,466 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-15 06:13:40,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,466 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-15 06:13:40,466 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-15 06:13:40,467 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-15 06:13:40,467 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-15 06:13:40,468 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-15 06:13:40,468 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-15 06:13:40,468 INFO L290 TraceCheckUtils]: 39: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,468 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-15 06:13:40,468 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-15 06:13:40,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,468 INFO L290 TraceCheckUtils]: 46: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,469 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-15 06:13:40,469 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-15 06:13:40,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,469 INFO L290 TraceCheckUtils]: 51: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,469 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-15 06:13:40,470 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-15 06:13:40,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,470 INFO L290 TraceCheckUtils]: 55: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,470 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-15 06:13:40,470 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-15 06:13:40,471 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-15 06:13:40,471 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-15 06:13:40,471 INFO L290 TraceCheckUtils]: 61: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,471 INFO L290 TraceCheckUtils]: 62: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,471 INFO L290 TraceCheckUtils]: 63: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,471 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-15 06:13:40,472 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-15 06:13:40,472 INFO L290 TraceCheckUtils]: 66: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,472 INFO L290 TraceCheckUtils]: 67: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,472 INFO L290 TraceCheckUtils]: 68: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,472 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-15 06:13:40,472 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-15 06:13:40,473 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-15 06:13:40,473 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-15 06:13:40,473 INFO L290 TraceCheckUtils]: 73: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,473 INFO L290 TraceCheckUtils]: 74: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,473 INFO L290 TraceCheckUtils]: 75: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,473 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-15 06:13:40,474 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-15 06:13:40,474 INFO L290 TraceCheckUtils]: 78: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,474 INFO L290 TraceCheckUtils]: 79: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,474 INFO L290 TraceCheckUtils]: 80: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,474 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-15 06:13:40,474 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-15 06:13:40,474 INFO L290 TraceCheckUtils]: 83: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,474 INFO L290 TraceCheckUtils]: 84: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,475 INFO L290 TraceCheckUtils]: 85: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,476 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-15 06:13:40,476 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-15 06:13:40,477 INFO L290 TraceCheckUtils]: 88: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,479 INFO L290 TraceCheckUtils]: 89: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,480 INFO L290 TraceCheckUtils]: 90: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,480 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-15 06:13:40,480 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-15 06:13:40,481 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-15 06:13:40,481 INFO L290 TraceCheckUtils]: 94: Hoare triple {40478#false} assume !(~j~0 < ~r~0); {40478#false} is VALID [2022-04-15 06:13:40,481 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-15 06:13:40,481 INFO L290 TraceCheckUtils]: 96: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,481 INFO L290 TraceCheckUtils]: 97: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,481 INFO L290 TraceCheckUtils]: 98: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,481 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {40477#true} {40478#false} #118#return; {40478#false} is VALID [2022-04-15 06:13:40,481 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-15 06:13:40,481 INFO L290 TraceCheckUtils]: 101: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,481 INFO L290 TraceCheckUtils]: 102: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,481 INFO L290 TraceCheckUtils]: 103: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,482 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {40477#true} {40478#false} #120#return; {40478#false} is VALID [2022-04-15 06:13:40,482 INFO L290 TraceCheckUtils]: 105: Hoare triple {40478#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40478#false} is VALID [2022-04-15 06:13:40,482 INFO L290 TraceCheckUtils]: 106: Hoare triple {40478#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {40478#false} is VALID [2022-04-15 06:13:40,482 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-15 06:13:40,482 INFO L290 TraceCheckUtils]: 108: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:40,482 INFO L290 TraceCheckUtils]: 109: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:40,482 INFO L290 TraceCheckUtils]: 110: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:40,482 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {40477#true} {40478#false} #122#return; {40478#false} is VALID [2022-04-15 06:13:40,482 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-15 06:13:40,482 INFO L290 TraceCheckUtils]: 113: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-15 06:13:40,482 INFO L290 TraceCheckUtils]: 114: Hoare triple {40478#false} assume 0 == ~cond; {40478#false} is VALID [2022-04-15 06:13:40,482 INFO L290 TraceCheckUtils]: 115: Hoare triple {40478#false} assume !false; {40478#false} is VALID [2022-04-15 06:13:40,483 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-15 06:13:40,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:40,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171668018] [2022-04-15 06:13:40,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171668018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:13:40,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386154325] [2022-04-15 06:13:40,483 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:13:40,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:40,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:40,484 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-15 06:13:40,486 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-15 06:13:40,540 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:13:40,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:13:40,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:13:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:13:44,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {40477#true} call ULTIMATE.init(); {40477#true} is VALID [2022-04-15 06:13:44,757 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-15 06:13:44,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:44,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-15 06:13:44,757 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-15 06:13:44,757 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-15 06:13:44,757 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-15 06:13:44,757 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-15 06:13:44,758 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-15 06:13:44,758 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-15 06:13:44,759 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-15 06:13:44,759 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-15 06:13:44,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:44,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:44,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:44,759 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-15 06:13:44,760 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-15 06:13:44,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:44,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:44,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:44,760 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-15 06:13:44,761 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-15 06:13:44,761 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-15 06:13:44,761 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-15 06:13:44,761 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-15 06:13:44,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:44,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:44,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:44,762 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-15 06:13:44,762 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-15 06:13:44,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:44,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:44,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:44,763 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-15 06:13:44,763 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-15 06:13:44,764 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-15 06:13:44,765 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-15 06:13:44,765 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-15 06:13:44,765 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-15 06:13:44,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:44,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:44,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:44,766 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-15 06:13:44,766 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-15 06:13:44,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:44,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:44,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:44,767 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-15 06:13:44,767 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-15 06:13:44,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:44,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:44,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:44,767 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-15 06:13:44,767 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-15 06:13:44,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:44,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:44,768 INFO L290 TraceCheckUtils]: 56: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:44,768 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-15 06:13:44,768 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-15 06:13:44,769 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-15 06:13:44,769 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-15 06:13:44,769 INFO L290 TraceCheckUtils]: 61: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:44,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:44,769 INFO L290 TraceCheckUtils]: 63: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:44,774 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-15 06:13:44,774 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-15 06:13:44,774 INFO L290 TraceCheckUtils]: 66: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:44,774 INFO L290 TraceCheckUtils]: 67: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:44,774 INFO L290 TraceCheckUtils]: 68: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:44,774 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-15 06:13:44,775 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-15 06:13:44,775 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-15 06:13:44,775 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-15 06:13:44,775 INFO L290 TraceCheckUtils]: 73: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:44,775 INFO L290 TraceCheckUtils]: 74: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:44,776 INFO L290 TraceCheckUtils]: 75: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:44,776 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-15 06:13:44,776 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-15 06:13:44,776 INFO L290 TraceCheckUtils]: 78: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:44,776 INFO L290 TraceCheckUtils]: 79: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:44,776 INFO L290 TraceCheckUtils]: 80: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:44,778 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-15 06:13:44,778 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-15 06:13:44,778 INFO L290 TraceCheckUtils]: 83: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:44,778 INFO L290 TraceCheckUtils]: 84: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:44,778 INFO L290 TraceCheckUtils]: 85: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:44,778 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-15 06:13:44,778 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-15 06:13:44,778 INFO L290 TraceCheckUtils]: 88: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:44,779 INFO L290 TraceCheckUtils]: 89: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:44,779 INFO L290 TraceCheckUtils]: 90: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:44,779 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-15 06:13:44,783 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-15 06:13:44,784 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-15 06:13:44,784 INFO L290 TraceCheckUtils]: 94: Hoare triple {40478#false} assume !(~j~0 < ~r~0); {40478#false} is VALID [2022-04-15 06:13:44,784 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-15 06:13:44,784 INFO L290 TraceCheckUtils]: 96: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-15 06:13:44,784 INFO L290 TraceCheckUtils]: 97: Hoare triple {40478#false} assume !(0 == ~cond); {40478#false} is VALID [2022-04-15 06:13:44,784 INFO L290 TraceCheckUtils]: 98: Hoare triple {40478#false} assume true; {40478#false} is VALID [2022-04-15 06:13:44,785 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {40478#false} {40478#false} #118#return; {40478#false} is VALID [2022-04-15 06:13:44,785 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-15 06:13:44,786 INFO L290 TraceCheckUtils]: 101: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-15 06:13:44,787 INFO L290 TraceCheckUtils]: 102: Hoare triple {40478#false} assume !(0 == ~cond); {40478#false} is VALID [2022-04-15 06:13:44,787 INFO L290 TraceCheckUtils]: 103: Hoare triple {40478#false} assume true; {40478#false} is VALID [2022-04-15 06:13:44,787 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {40478#false} {40478#false} #120#return; {40478#false} is VALID [2022-04-15 06:13:44,787 INFO L290 TraceCheckUtils]: 105: Hoare triple {40478#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40478#false} is VALID [2022-04-15 06:13:44,788 INFO L290 TraceCheckUtils]: 106: Hoare triple {40478#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {40478#false} is VALID [2022-04-15 06:13:44,788 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-15 06:13:44,788 INFO L290 TraceCheckUtils]: 108: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-15 06:13:44,788 INFO L290 TraceCheckUtils]: 109: Hoare triple {40478#false} assume !(0 == ~cond); {40478#false} is VALID [2022-04-15 06:13:44,788 INFO L290 TraceCheckUtils]: 110: Hoare triple {40478#false} assume true; {40478#false} is VALID [2022-04-15 06:13:44,788 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {40478#false} {40478#false} #122#return; {40478#false} is VALID [2022-04-15 06:13:44,793 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-15 06:13:44,793 INFO L290 TraceCheckUtils]: 113: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-15 06:13:44,793 INFO L290 TraceCheckUtils]: 114: Hoare triple {40478#false} assume 0 == ~cond; {40478#false} is VALID [2022-04-15 06:13:44,794 INFO L290 TraceCheckUtils]: 115: Hoare triple {40478#false} assume !false; {40478#false} is VALID [2022-04-15 06:13:44,795 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-15 06:13:44,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:13:45,682 INFO L290 TraceCheckUtils]: 115: Hoare triple {40478#false} assume !false; {40478#false} is VALID [2022-04-15 06:13:45,683 INFO L290 TraceCheckUtils]: 114: Hoare triple {40478#false} assume 0 == ~cond; {40478#false} is VALID [2022-04-15 06:13:45,683 INFO L290 TraceCheckUtils]: 113: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-15 06:13:45,683 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-15 06:13:45,683 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {40477#true} {40478#false} #122#return; {40478#false} is VALID [2022-04-15 06:13:45,683 INFO L290 TraceCheckUtils]: 110: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,683 INFO L290 TraceCheckUtils]: 109: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,683 INFO L290 TraceCheckUtils]: 108: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,683 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-15 06:13:45,683 INFO L290 TraceCheckUtils]: 106: Hoare triple {40478#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {40478#false} is VALID [2022-04-15 06:13:45,683 INFO L290 TraceCheckUtils]: 105: Hoare triple {40478#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40478#false} is VALID [2022-04-15 06:13:45,684 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {40477#true} {40478#false} #120#return; {40478#false} is VALID [2022-04-15 06:13:45,684 INFO L290 TraceCheckUtils]: 103: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,684 INFO L290 TraceCheckUtils]: 102: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,684 INFO L290 TraceCheckUtils]: 101: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,684 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-15 06:13:45,684 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {40477#true} {40478#false} #118#return; {40478#false} is VALID [2022-04-15 06:13:45,684 INFO L290 TraceCheckUtils]: 98: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,684 INFO L290 TraceCheckUtils]: 97: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,684 INFO L290 TraceCheckUtils]: 96: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,684 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-15 06:13:45,684 INFO L290 TraceCheckUtils]: 94: Hoare triple {40478#false} assume !(~j~0 < ~r~0); {40478#false} is VALID [2022-04-15 06:13:45,685 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-15 06:13:45,685 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-15 06:13:45,686 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-15 06:13:45,686 INFO L290 TraceCheckUtils]: 90: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,686 INFO L290 TraceCheckUtils]: 89: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,686 INFO L290 TraceCheckUtils]: 88: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,686 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-15 06:13:45,686 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-15 06:13:45,686 INFO L290 TraceCheckUtils]: 85: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,686 INFO L290 TraceCheckUtils]: 84: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,687 INFO L290 TraceCheckUtils]: 83: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,687 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-15 06:13:45,687 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-15 06:13:45,687 INFO L290 TraceCheckUtils]: 80: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,687 INFO L290 TraceCheckUtils]: 79: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,687 INFO L290 TraceCheckUtils]: 78: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,687 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-15 06:13:45,688 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-15 06:13:45,688 INFO L290 TraceCheckUtils]: 75: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,688 INFO L290 TraceCheckUtils]: 74: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,688 INFO L290 TraceCheckUtils]: 73: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,688 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-15 06:13:45,688 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-15 06:13:45,689 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-15 06:13:45,689 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-15 06:13:45,689 INFO L290 TraceCheckUtils]: 68: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,689 INFO L290 TraceCheckUtils]: 67: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,690 INFO L290 TraceCheckUtils]: 66: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,690 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-15 06:13:45,690 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-15 06:13:45,690 INFO L290 TraceCheckUtils]: 63: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,690 INFO L290 TraceCheckUtils]: 62: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,690 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-15 06:13:45,691 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-15 06:13:45,691 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-15 06:13:45,692 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-15 06:13:45,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,692 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-15 06:13:45,692 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-15 06:13:45,693 INFO L290 TraceCheckUtils]: 51: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,693 INFO L290 TraceCheckUtils]: 50: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,693 INFO L290 TraceCheckUtils]: 49: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,693 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-15 06:13:45,693 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-15 06:13:45,693 INFO L290 TraceCheckUtils]: 46: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,693 INFO L290 TraceCheckUtils]: 45: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,693 INFO L290 TraceCheckUtils]: 44: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,693 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-15 06:13:45,694 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-15 06:13:45,694 INFO L290 TraceCheckUtils]: 41: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,694 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-15 06:13:45,695 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-15 06:13:45,695 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-15 06:13:45,695 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-15 06:13:45,696 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-15 06:13:45,696 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-15 06:13:45,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,697 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-15 06:13:45,697 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-15 06:13:45,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,697 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-15 06:13:45,698 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-15 06:13:45,698 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-15 06:13:45,699 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-15 06:13:45,699 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-15 06:13:45,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,700 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-15 06:13:45,700 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-15 06:13:45,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-15 06:13:45,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-15 06:13:45,700 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-15 06:13:45,701 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-15 06:13:45,701 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-15 06:13:45,702 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-15 06:13:45,702 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-15 06:13:45,702 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-15 06:13:45,702 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-15 06:13:45,702 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-15 06:13:45,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-15 06:13:45,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-15 06:13:45,702 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-15 06:13:45,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {40477#true} call ULTIMATE.init(); {40477#true} is VALID [2022-04-15 06:13:45,703 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-15 06:13:45,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386154325] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:13:45,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:13:45,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-04-15 06:13:45,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:45,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291767306] [2022-04-15 06:13:45,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291767306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:45,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:45,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:13:45,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933302692] [2022-04-15 06:13:45,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:45,704 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-15 06:13:45,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:45,704 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-15 06:13:45,760 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-15 06:13:45,760 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:13:45,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:45,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:13:45,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:13:45,761 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-15 06:13:54,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:54,788 INFO L93 Difference]: Finished difference Result 756 states and 1173 transitions. [2022-04-15 06:13:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 06:13:54,788 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-15 06:13:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:54,788 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-15 06:13:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 472 transitions. [2022-04-15 06:13:54,797 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-15 06:13:54,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 472 transitions. [2022-04-15 06:13:54,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 472 transitions. [2022-04-15 06:13:55,255 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-15 06:13:55,274 INFO L225 Difference]: With dead ends: 756 [2022-04-15 06:13:55,274 INFO L226 Difference]: Without dead ends: 452 [2022-04-15 06:13:55,277 INFO L912 BasicCegarLoop]: 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-15 06:13:55,278 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 206 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:55,279 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 116 Invalid, 1877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 06:13:55,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-04-15 06:13:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 364. [2022-04-15 06:13:58,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:58,167 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-15 06:13:58,167 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-15 06:13:58,168 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-15 06:13:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:58,179 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2022-04-15 06:13:58,179 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 699 transitions. [2022-04-15 06:13:58,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:58,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:58,181 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-15 06:13:58,181 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-15 06:13:58,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:58,195 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2022-04-15 06:13:58,195 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 699 transitions. [2022-04-15 06:13:58,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:58,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:58,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:58,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:58,197 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-15 06:13:58,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 569 transitions. [2022-04-15 06:13:58,219 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 569 transitions. Word has length 116 [2022-04-15 06:13:58,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:58,219 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 569 transitions. [2022-04-15 06:13:58,219 INFO L479 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-15 06:13:58,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 569 transitions. [2022-04-15 06:13:59,236 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-15 06:13:59,236 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 569 transitions. [2022-04-15 06:13:59,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-15 06:13:59,237 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:59,237 INFO L499 BasicCegarLoop]: 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-15 06:13:59,295 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-15 06:13:59,438 WARN L460 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-15 06:13:59,438 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:59,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:59,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1934725046, now seen corresponding path program 3 times [2022-04-15 06:13:59,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:59,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [580762716] [2022-04-15 06:13:59,439 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:13:59,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1934725046, now seen corresponding path program 4 times [2022-04-15 06:13:59,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:59,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639885746] [2022-04-15 06:13:59,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,587 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-15 06:13:59,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-15 06:13:59,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:13:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,592 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-15 06:13:59,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:13:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,595 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-15 06:13:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 06:13:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,626 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-15 06:13:59,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 06:13:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,630 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-15 06:13:59,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:13:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,634 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-15 06:13:59,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-15 06:13:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,637 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-15 06:13:59,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 06:13:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,639 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-15 06:13:59,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-15 06:13:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,643 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-15 06:13:59,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 06:13:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,657 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-15 06:13:59,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-15 06:13:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,661 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-15 06:13:59,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 06:13:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,664 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-15 06:13:59,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-15 06:13:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,666 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-15 06:13:59,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-15 06:13:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,669 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-15 06:13:59,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-15 06:13:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,671 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-15 06:13:59,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-15 06:13:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,676 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-15 06:13:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-15 06:13:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,693 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-15 06:13:59,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-04-15 06:13:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,696 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-15 06:13:59,697 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-15 06:13:59,697 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-15 06:13:59,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-15 06:13:59,697 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-15 06:13:59,697 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-15 06:13:59,697 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-15 06:13:59,698 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-15 06:13:59,698 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-15 06:13:59,699 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-15 06:13:59,699 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-15 06:13:59,699 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-15 06:13:59,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,700 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-15 06:13:59,700 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-15 06:13:59,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,700 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-15 06:13:59,701 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-15 06:13:59,701 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-15 06:13:59,701 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-15 06:13:59,701 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-15 06:13:59,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,702 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-15 06:13:59,702 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-15 06:13:59,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,703 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-15 06:13:59,703 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-15 06:13:59,703 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-15 06:13:59,704 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-15 06:13:59,704 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-15 06:13:59,704 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-15 06:13:59,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,704 INFO L290 TraceCheckUtils]: 40: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,704 INFO L290 TraceCheckUtils]: 41: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,705 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-15 06:13:59,705 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-15 06:13:59,705 INFO L290 TraceCheckUtils]: 44: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,705 INFO L290 TraceCheckUtils]: 45: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,705 INFO L290 TraceCheckUtils]: 46: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,705 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-15 06:13:59,705 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-15 06:13:59,706 INFO L290 TraceCheckUtils]: 49: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,706 INFO L290 TraceCheckUtils]: 50: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,706 INFO L290 TraceCheckUtils]: 51: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,706 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-15 06:13:59,706 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-15 06:13:59,706 INFO L290 TraceCheckUtils]: 54: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,706 INFO L290 TraceCheckUtils]: 55: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,706 INFO L290 TraceCheckUtils]: 56: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,707 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-15 06:13:59,707 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-15 06:13:59,707 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-15 06:13:59,707 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-15 06:13:59,708 INFO L290 TraceCheckUtils]: 61: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,708 INFO L290 TraceCheckUtils]: 62: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,708 INFO L290 TraceCheckUtils]: 63: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,708 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-15 06:13:59,708 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-15 06:13:59,708 INFO L290 TraceCheckUtils]: 66: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,708 INFO L290 TraceCheckUtils]: 67: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,708 INFO L290 TraceCheckUtils]: 68: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,709 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-15 06:13:59,709 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-15 06:13:59,709 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-15 06:13:59,709 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-15 06:13:59,709 INFO L290 TraceCheckUtils]: 73: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,710 INFO L290 TraceCheckUtils]: 74: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,710 INFO L290 TraceCheckUtils]: 75: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,710 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-15 06:13:59,710 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-15 06:13:59,710 INFO L290 TraceCheckUtils]: 78: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,710 INFO L290 TraceCheckUtils]: 79: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,710 INFO L290 TraceCheckUtils]: 80: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,711 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-15 06:13:59,711 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-15 06:13:59,711 INFO L290 TraceCheckUtils]: 83: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,711 INFO L290 TraceCheckUtils]: 84: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,711 INFO L290 TraceCheckUtils]: 85: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,727 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-15 06:13:59,728 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-15 06:13:59,728 INFO L290 TraceCheckUtils]: 88: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,728 INFO L290 TraceCheckUtils]: 89: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,728 INFO L290 TraceCheckUtils]: 90: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,728 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-15 06:13:59,729 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-15 06:13:59,729 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-15 06:13:59,729 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-15 06:13:59,729 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-15 06:13:59,729 INFO L290 TraceCheckUtils]: 96: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,729 INFO L290 TraceCheckUtils]: 97: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,729 INFO L290 TraceCheckUtils]: 98: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,730 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-15 06:13:59,730 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-15 06:13:59,730 INFO L290 TraceCheckUtils]: 101: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,730 INFO L290 TraceCheckUtils]: 102: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,730 INFO L290 TraceCheckUtils]: 103: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,731 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-15 06:13:59,731 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-15 06:13:59,731 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-15 06:13:59,731 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-15 06:13:59,731 INFO L290 TraceCheckUtils]: 108: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:13:59,731 INFO L290 TraceCheckUtils]: 109: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:13:59,731 INFO L290 TraceCheckUtils]: 110: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:13:59,732 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-15 06:13:59,732 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-15 06:13:59,733 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-15 06:13:59,733 INFO L290 TraceCheckUtils]: 114: Hoare triple {44533#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {44454#false} is VALID [2022-04-15 06:13:59,733 INFO L290 TraceCheckUtils]: 115: Hoare triple {44454#false} assume !false; {44454#false} is VALID [2022-04-15 06:13:59,733 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-15 06:13:59,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:59,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639885746] [2022-04-15 06:13:59,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639885746] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:13:59,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138545947] [2022-04-15 06:13:59,734 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:13:59,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:59,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:59,736 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-15 06:13:59,791 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-15 06:13:59,893 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:13:59,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:13:59,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:13:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:59,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:02,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {44453#true} call ULTIMATE.init(); {44453#true} is VALID [2022-04-15 06:14:02,980 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-15 06:14:02,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:02,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-15 06:14:02,980 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-15 06:14:02,980 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-15 06:14:02,980 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-15 06:14:02,980 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-15 06:14:02,981 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-15 06:14:02,981 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-15 06:14:02,982 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-15 06:14:02,982 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-15 06:14:02,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:02,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:02,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:02,982 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-15 06:14:02,982 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-15 06:14:02,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {44453#true} ~cond := #in~cond; {44590#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:14:02,983 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-15 06:14:02,983 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-15 06:14:02,984 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-15 06:14:02,985 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-15 06:14:02,985 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-15 06:14:02,985 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-15 06:14:02,985 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-15 06:14:02,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:02,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:02,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:02,986 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-15 06:14:02,986 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-15 06:14:02,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:02,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:02,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:02,987 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-15 06:14:02,987 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-15 06:14:02,988 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-15 06:14:02,988 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-15 06:14:02,989 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-15 06:14:02,989 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-15 06:14:02,989 INFO L290 TraceCheckUtils]: 39: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:02,989 INFO L290 TraceCheckUtils]: 40: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:02,989 INFO L290 TraceCheckUtils]: 41: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:02,990 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-15 06:14:02,990 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-15 06:14:02,990 INFO L290 TraceCheckUtils]: 44: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:02,990 INFO L290 TraceCheckUtils]: 45: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:02,990 INFO L290 TraceCheckUtils]: 46: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:02,990 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-15 06:14:02,990 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-15 06:14:02,990 INFO L290 TraceCheckUtils]: 49: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:02,991 INFO L290 TraceCheckUtils]: 50: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:02,991 INFO L290 TraceCheckUtils]: 51: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:02,991 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-15 06:14:02,991 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-15 06:14:02,991 INFO L290 TraceCheckUtils]: 54: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:02,991 INFO L290 TraceCheckUtils]: 55: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:02,991 INFO L290 TraceCheckUtils]: 56: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:03,007 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-15 06:14:03,008 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-15 06:14:03,008 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-15 06:14:03,009 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-15 06:14:03,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:03,009 INFO L290 TraceCheckUtils]: 62: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:03,009 INFO L290 TraceCheckUtils]: 63: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:03,009 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-15 06:14:03,009 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-15 06:14:03,009 INFO L290 TraceCheckUtils]: 66: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:03,009 INFO L290 TraceCheckUtils]: 67: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:03,010 INFO L290 TraceCheckUtils]: 68: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:03,010 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-15 06:14:03,010 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-15 06:14:03,011 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-15 06:14:03,011 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-15 06:14:03,011 INFO L290 TraceCheckUtils]: 73: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:03,011 INFO L290 TraceCheckUtils]: 74: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:03,011 INFO L290 TraceCheckUtils]: 75: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:03,011 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-15 06:14:03,012 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-15 06:14:03,012 INFO L290 TraceCheckUtils]: 78: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:03,012 INFO L290 TraceCheckUtils]: 79: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:03,012 INFO L290 TraceCheckUtils]: 80: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:03,012 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-15 06:14:03,012 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-15 06:14:03,012 INFO L290 TraceCheckUtils]: 83: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:03,012 INFO L290 TraceCheckUtils]: 84: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:03,012 INFO L290 TraceCheckUtils]: 85: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:03,013 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-15 06:14:03,013 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-15 06:14:03,013 INFO L290 TraceCheckUtils]: 88: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:03,013 INFO L290 TraceCheckUtils]: 89: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:03,013 INFO L290 TraceCheckUtils]: 90: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:03,014 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-15 06:14:03,014 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-15 06:14:03,014 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-15 06:14:03,015 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-15 06:14:03,015 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-15 06:14:03,015 INFO L290 TraceCheckUtils]: 96: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:03,015 INFO L290 TraceCheckUtils]: 97: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:03,015 INFO L290 TraceCheckUtils]: 98: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:03,015 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-15 06:14:03,015 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-15 06:14:03,015 INFO L290 TraceCheckUtils]: 101: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:03,016 INFO L290 TraceCheckUtils]: 102: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:03,016 INFO L290 TraceCheckUtils]: 103: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:03,016 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-15 06:14:03,016 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-15 06:14:03,017 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-15 06:14:03,017 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-15 06:14:03,017 INFO L290 TraceCheckUtils]: 108: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:03,017 INFO L290 TraceCheckUtils]: 109: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:03,017 INFO L290 TraceCheckUtils]: 110: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:03,017 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-15 06:14:03,018 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-15 06:14:03,018 INFO L290 TraceCheckUtils]: 113: Hoare triple {44878#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {44882#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:14:03,019 INFO L290 TraceCheckUtils]: 114: Hoare triple {44882#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44454#false} is VALID [2022-04-15 06:14:03,019 INFO L290 TraceCheckUtils]: 115: Hoare triple {44454#false} assume !false; {44454#false} is VALID [2022-04-15 06:14:03,019 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-15 06:14:03,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:04,613 INFO L290 TraceCheckUtils]: 115: Hoare triple {44454#false} assume !false; {44454#false} is VALID [2022-04-15 06:14:04,613 INFO L290 TraceCheckUtils]: 114: Hoare triple {44882#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44454#false} is VALID [2022-04-15 06:14:04,614 INFO L290 TraceCheckUtils]: 113: Hoare triple {44878#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {44882#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:14:04,614 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-15 06:14:04,615 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-15 06:14:04,615 INFO L290 TraceCheckUtils]: 110: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,615 INFO L290 TraceCheckUtils]: 109: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,615 INFO L290 TraceCheckUtils]: 108: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,615 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-15 06:14:04,615 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-15 06:14:04,616 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-15 06:14:04,616 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-15 06:14:04,616 INFO L290 TraceCheckUtils]: 103: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,616 INFO L290 TraceCheckUtils]: 102: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,616 INFO L290 TraceCheckUtils]: 101: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,616 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-15 06:14:04,617 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-15 06:14:04,617 INFO L290 TraceCheckUtils]: 98: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,617 INFO L290 TraceCheckUtils]: 97: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,617 INFO L290 TraceCheckUtils]: 96: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,617 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-15 06:14:04,617 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-15 06:14:04,618 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-15 06:14:04,618 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-15 06:14:04,619 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-15 06:14:04,619 INFO L290 TraceCheckUtils]: 90: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,619 INFO L290 TraceCheckUtils]: 89: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,619 INFO L290 TraceCheckUtils]: 88: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,619 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-15 06:14:04,619 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-15 06:14:04,619 INFO L290 TraceCheckUtils]: 85: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,619 INFO L290 TraceCheckUtils]: 84: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,620 INFO L290 TraceCheckUtils]: 83: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,620 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-15 06:14:04,620 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-15 06:14:04,620 INFO L290 TraceCheckUtils]: 80: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,620 INFO L290 TraceCheckUtils]: 79: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,620 INFO L290 TraceCheckUtils]: 78: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,620 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-15 06:14:04,621 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-15 06:14:04,621 INFO L290 TraceCheckUtils]: 75: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,621 INFO L290 TraceCheckUtils]: 74: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,621 INFO L290 TraceCheckUtils]: 73: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,621 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-15 06:14:04,621 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-15 06:14:04,622 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-15 06:14:04,622 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-15 06:14:04,622 INFO L290 TraceCheckUtils]: 68: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,622 INFO L290 TraceCheckUtils]: 67: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,622 INFO L290 TraceCheckUtils]: 66: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,622 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-15 06:14:04,623 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-15 06:14:04,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,623 INFO L290 TraceCheckUtils]: 61: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,623 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-15 06:14:04,623 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-15 06:14:04,624 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-15 06:14:04,624 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-15 06:14:04,624 INFO L290 TraceCheckUtils]: 56: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,624 INFO L290 TraceCheckUtils]: 55: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,624 INFO L290 TraceCheckUtils]: 54: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,624 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-15 06:14:04,625 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-15 06:14:04,625 INFO L290 TraceCheckUtils]: 51: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,625 INFO L290 TraceCheckUtils]: 50: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,625 INFO L290 TraceCheckUtils]: 49: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,625 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-15 06:14:04,625 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-15 06:14:04,626 INFO L290 TraceCheckUtils]: 46: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,626 INFO L290 TraceCheckUtils]: 44: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,626 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-15 06:14:04,626 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-15 06:14:04,626 INFO L290 TraceCheckUtils]: 41: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,626 INFO L290 TraceCheckUtils]: 40: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,626 INFO L290 TraceCheckUtils]: 39: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,627 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-15 06:14:04,627 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-15 06:14:04,627 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-15 06:14:04,628 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-15 06:14:04,628 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-15 06:14:04,629 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-15 06:14:04,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,629 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-15 06:14:04,629 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-15 06:14:04,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,630 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-15 06:14:04,630 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-15 06:14:04,630 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-15 06:14:04,630 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-15 06:14:04,631 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-15 06:14:04,632 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-15 06:14:04,632 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-15 06:14:04,632 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-15 06:14:04,632 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-15 06:14:04,633 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-15 06:14:04,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-15 06:14:04,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-15 06:14:04,633 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-15 06:14:04,633 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-15 06:14:04,634 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-15 06:14:04,634 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-15 06:14:04,634 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-15 06:14:04,634 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-15 06:14:04,634 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-15 06:14:04,634 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-15 06:14:04,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-15 06:14:04,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-15 06:14:04,635 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-15 06:14:04,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {44453#true} call ULTIMATE.init(); {44453#true} is VALID [2022-04-15 06:14:04,635 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-15 06:14:04,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138545947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:04,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:04,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-04-15 06:14:04,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:04,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [580762716] [2022-04-15 06:14:04,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [580762716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:04,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:04,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:14:04,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890445520] [2022-04-15 06:14:04,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:04,637 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-15 06:14:04,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:04,637 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-15 06:14:04,707 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-15 06:14:04,707 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:14:04,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:04,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:14:04,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:14:04,708 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-15 06:14:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:13,219 INFO L93 Difference]: Finished difference Result 620 states and 983 transitions. [2022-04-15 06:14:13,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:14:13,219 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-15 06:14:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:13,220 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-15 06:14:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 245 transitions. [2022-04-15 06:14:13,223 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-15 06:14:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 245 transitions. [2022-04-15 06:14:13,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 245 transitions. [2022-04-15 06:14:13,477 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-15 06:14:13,497 INFO L225 Difference]: With dead ends: 620 [2022-04-15 06:14:13,497 INFO L226 Difference]: Without dead ends: 618 [2022-04-15 06:14:13,498 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=951, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 06:14:13,499 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 187 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:13,499 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 89 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 06:14:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-04-15 06:14:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 501. [2022-04-15 06:14:18,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:18,451 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-15 06:14:18,451 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-15 06:14:18,452 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-15 06:14:18,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:18,475 INFO L93 Difference]: Finished difference Result 618 states and 981 transitions. [2022-04-15 06:14:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2022-04-15 06:14:18,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:18,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:18,478 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-15 06:14:18,478 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-15 06:14:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:18,517 INFO L93 Difference]: Finished difference Result 618 states and 981 transitions. [2022-04-15 06:14:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2022-04-15 06:14:18,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:18,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:18,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:18,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:18,520 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-15 06:14:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 798 transitions. [2022-04-15 06:14:18,544 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 798 transitions. Word has length 116 [2022-04-15 06:14:18,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:18,545 INFO L478 AbstractCegarLoop]: Abstraction has 501 states and 798 transitions. [2022-04-15 06:14:18,545 INFO L479 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-15 06:14:18,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 501 states and 798 transitions. [2022-04-15 06:14:19,963 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-15 06:14:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 798 transitions. [2022-04-15 06:14:19,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-15 06:14:19,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:19,965 INFO L499 BasicCegarLoop]: 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-15 06:14:19,984 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-15 06:14:20,165 WARN L460 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-15 06:14:20,165 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:20,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1563563510, now seen corresponding path program 5 times [2022-04-15 06:14:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:20,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1847017670] [2022-04-15 06:14:20,166 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:14:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1563563510, now seen corresponding path program 6 times [2022-04-15 06:14:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:20,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867511386] [2022-04-15 06:14:20,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,336 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-15 06:14:20,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-15 06:14:20,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:14:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,353 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-15 06:14:20,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:14:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,356 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-15 06:14:20,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 06:14:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,359 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-15 06:14:20,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 06:14:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,362 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-15 06:14:20,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-15 06:14:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,364 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-15 06:14:20,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:14:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,367 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-15 06:14:20,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 06:14:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,385 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-15 06:14:20,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-15 06:14:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,389 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-15 06:14:20,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 06:14:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,391 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-15 06:14:20,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-15 06:14:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,394 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-15 06:14:20,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-15 06:14:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,397 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-15 06:14:20,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-04-15 06:14:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,417 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-15 06:14:20,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-15 06:14:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,427 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-15 06:14:20,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-15 06:14:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,430 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-15 06:14:20,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-15 06:14:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,449 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-15 06:14:20,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-04-15 06:14:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,452 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-15 06:14:20,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-15 06:14:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,455 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-15 06:14:20,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-04-15 06:14:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,458 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-15 06:14:20,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-15 06:14:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,460 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-15 06:14:20,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-15 06:14:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,464 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-15 06:14:20,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-15 06:14:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,467 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-15 06:14:20,468 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-15 06:14:20,468 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-15 06:14:20,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-15 06:14:20,468 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-15 06:14:20,468 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-15 06:14:20,469 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-15 06:14:20,469 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-15 06:14:20,469 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-15 06:14:20,470 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-15 06:14:20,483 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-15 06:14:20,484 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-15 06:14:20,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,484 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-15 06:14:20,484 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-15 06:14:20,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,485 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-15 06:14:20,485 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-15 06:14:20,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,486 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-15 06:14:20,486 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-15 06:14:20,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,486 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-15 06:14:20,487 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-15 06:14:20,487 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-15 06:14:20,487 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-15 06:14:20,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,488 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-15 06:14:20,488 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-15 06:14:20,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,488 INFO L290 TraceCheckUtils]: 41: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,489 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-15 06:14:20,489 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-15 06:14:20,489 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-15 06:14:20,490 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-15 06:14:20,490 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-15 06:14:20,490 INFO L290 TraceCheckUtils]: 47: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,490 INFO L290 TraceCheckUtils]: 48: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,490 INFO L290 TraceCheckUtils]: 49: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,490 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-15 06:14:20,490 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-15 06:14:20,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,491 INFO L290 TraceCheckUtils]: 53: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,491 INFO L290 TraceCheckUtils]: 54: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,491 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-15 06:14:20,491 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-15 06:14:20,492 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-15 06:14:20,492 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-15 06:14:20,492 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-15 06:14:20,492 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-15 06:14:20,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,493 INFO L290 TraceCheckUtils]: 62: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,493 INFO L290 TraceCheckUtils]: 63: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,493 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-15 06:14:20,493 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-15 06:14:20,493 INFO L290 TraceCheckUtils]: 66: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,493 INFO L290 TraceCheckUtils]: 67: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,493 INFO L290 TraceCheckUtils]: 68: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,494 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-15 06:14:20,494 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-15 06:14:20,494 INFO L290 TraceCheckUtils]: 71: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,494 INFO L290 TraceCheckUtils]: 72: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,494 INFO L290 TraceCheckUtils]: 73: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,494 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-15 06:14:20,494 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-15 06:14:20,495 INFO L290 TraceCheckUtils]: 76: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,495 INFO L290 TraceCheckUtils]: 77: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,495 INFO L290 TraceCheckUtils]: 78: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,495 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-15 06:14:20,495 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-15 06:14:20,496 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-15 06:14:20,496 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-15 06:14:20,496 INFO L290 TraceCheckUtils]: 83: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,496 INFO L290 TraceCheckUtils]: 84: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,496 INFO L290 TraceCheckUtils]: 85: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,496 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-15 06:14:20,497 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-15 06:14:20,497 INFO L290 TraceCheckUtils]: 88: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,497 INFO L290 TraceCheckUtils]: 89: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,497 INFO L290 TraceCheckUtils]: 90: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,497 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-15 06:14:20,497 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-15 06:14:20,498 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-15 06:14:20,498 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-15 06:14:20,498 INFO L290 TraceCheckUtils]: 95: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,498 INFO L290 TraceCheckUtils]: 96: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,498 INFO L290 TraceCheckUtils]: 97: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,498 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-15 06:14:20,499 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-15 06:14:20,499 INFO L290 TraceCheckUtils]: 100: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,499 INFO L290 TraceCheckUtils]: 101: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,499 INFO L290 TraceCheckUtils]: 102: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,499 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-15 06:14:20,499 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-15 06:14:20,499 INFO L290 TraceCheckUtils]: 105: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,499 INFO L290 TraceCheckUtils]: 106: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,499 INFO L290 TraceCheckUtils]: 107: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,500 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-15 06:14:20,500 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-15 06:14:20,500 INFO L290 TraceCheckUtils]: 110: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,500 INFO L290 TraceCheckUtils]: 111: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,500 INFO L290 TraceCheckUtils]: 112: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,500 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-15 06:14:20,501 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-15 06:14:20,501 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-15 06:14:20,502 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-15 06:14:20,502 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-15 06:14:20,502 INFO L290 TraceCheckUtils]: 118: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,502 INFO L290 TraceCheckUtils]: 119: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,502 INFO L290 TraceCheckUtils]: 120: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,502 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-15 06:14:20,502 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-15 06:14:20,502 INFO L290 TraceCheckUtils]: 123: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,503 INFO L290 TraceCheckUtils]: 124: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,503 INFO L290 TraceCheckUtils]: 125: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,503 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-15 06:14:20,507 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-15 06:14:20,507 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-15 06:14:20,507 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-15 06:14:20,507 INFO L290 TraceCheckUtils]: 130: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:20,508 INFO L290 TraceCheckUtils]: 131: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:20,508 INFO L290 TraceCheckUtils]: 132: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:20,508 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-15 06:14:20,509 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-15 06:14:20,509 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-15 06:14:20,509 INFO L290 TraceCheckUtils]: 136: Hoare triple {48840#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {48745#false} is VALID [2022-04-15 06:14:20,509 INFO L290 TraceCheckUtils]: 137: Hoare triple {48745#false} assume !false; {48745#false} is VALID [2022-04-15 06:14:20,510 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-15 06:14:20,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:20,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867511386] [2022-04-15 06:14:20,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867511386] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:20,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745600199] [2022-04-15 06:14:20,510 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:14:20,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:20,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:20,513 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-15 06:14:20,547 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-15 06:14:20,635 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 06:14:20,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:14:20,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:14:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:20,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:22,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {48744#true} call ULTIMATE.init(); {48744#true} is VALID [2022-04-15 06:14:22,101 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-15 06:14:22,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-15 06:14:22,101 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-15 06:14:22,101 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-15 06:14:22,102 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-15 06:14:22,102 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-15 06:14:22,103 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-15 06:14:22,103 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-15 06:14:22,103 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-15 06:14:22,103 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-15 06:14:22,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,104 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-15 06:14:22,104 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-15 06:14:22,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,105 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-15 06:14:22,105 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-15 06:14:22,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,105 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-15 06:14:22,105 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-15 06:14:22,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,106 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-15 06:14:22,106 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-15 06:14:22,107 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-15 06:14:22,107 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-15 06:14:22,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,107 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-15 06:14:22,108 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-15 06:14:22,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,108 INFO L290 TraceCheckUtils]: 40: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,108 INFO L290 TraceCheckUtils]: 41: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,108 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-15 06:14:22,109 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-15 06:14:22,109 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-15 06:14:22,109 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-15 06:14:22,109 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-15 06:14:22,109 INFO L290 TraceCheckUtils]: 47: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,109 INFO L290 TraceCheckUtils]: 48: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,109 INFO L290 TraceCheckUtils]: 49: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,110 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-15 06:14:22,110 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-15 06:14:22,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,110 INFO L290 TraceCheckUtils]: 53: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,110 INFO L290 TraceCheckUtils]: 54: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,111 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-15 06:14:22,111 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-15 06:14:22,111 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-15 06:14:22,112 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-15 06:14:22,112 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-15 06:14:22,112 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-15 06:14:22,112 INFO L290 TraceCheckUtils]: 61: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,112 INFO L290 TraceCheckUtils]: 62: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,113 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-15 06:14:22,113 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-15 06:14:22,113 INFO L290 TraceCheckUtils]: 66: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,113 INFO L290 TraceCheckUtils]: 67: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,113 INFO L290 TraceCheckUtils]: 68: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,113 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-15 06:14:22,114 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-15 06:14:22,114 INFO L290 TraceCheckUtils]: 71: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,114 INFO L290 TraceCheckUtils]: 72: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,114 INFO L290 TraceCheckUtils]: 73: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,114 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-15 06:14:22,114 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-15 06:14:22,114 INFO L290 TraceCheckUtils]: 76: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,114 INFO L290 TraceCheckUtils]: 77: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,115 INFO L290 TraceCheckUtils]: 78: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,115 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-15 06:14:22,115 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-15 06:14:22,116 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-15 06:14:22,116 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-15 06:14:22,116 INFO L290 TraceCheckUtils]: 83: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,116 INFO L290 TraceCheckUtils]: 84: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,117 INFO L290 TraceCheckUtils]: 85: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,118 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-15 06:14:22,118 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-15 06:14:22,118 INFO L290 TraceCheckUtils]: 88: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,118 INFO L290 TraceCheckUtils]: 89: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,118 INFO L290 TraceCheckUtils]: 90: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,118 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-15 06:14:22,119 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-15 06:14:22,119 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-15 06:14:22,119 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-15 06:14:22,119 INFO L290 TraceCheckUtils]: 95: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,119 INFO L290 TraceCheckUtils]: 96: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,119 INFO L290 TraceCheckUtils]: 97: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,120 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-15 06:14:22,120 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-15 06:14:22,120 INFO L290 TraceCheckUtils]: 100: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,120 INFO L290 TraceCheckUtils]: 101: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,120 INFO L290 TraceCheckUtils]: 102: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,121 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-15 06:14:22,121 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-15 06:14:22,121 INFO L290 TraceCheckUtils]: 105: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,121 INFO L290 TraceCheckUtils]: 106: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,121 INFO L290 TraceCheckUtils]: 107: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,121 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-15 06:14:22,121 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-15 06:14:22,121 INFO L290 TraceCheckUtils]: 110: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,122 INFO L290 TraceCheckUtils]: 111: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,122 INFO L290 TraceCheckUtils]: 112: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,122 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-15 06:14:22,123 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-15 06:14:22,123 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-15 06:14:22,124 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-15 06:14:22,124 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-15 06:14:22,124 INFO L290 TraceCheckUtils]: 118: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,124 INFO L290 TraceCheckUtils]: 119: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,124 INFO L290 TraceCheckUtils]: 120: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,124 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-15 06:14:22,125 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-15 06:14:22,125 INFO L290 TraceCheckUtils]: 123: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,125 INFO L290 TraceCheckUtils]: 124: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,125 INFO L290 TraceCheckUtils]: 125: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,126 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-15 06:14:22,126 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-15 06:14:22,126 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-15 06:14:22,127 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-15 06:14:22,127 INFO L290 TraceCheckUtils]: 130: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,127 INFO L290 TraceCheckUtils]: 131: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,127 INFO L290 TraceCheckUtils]: 132: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,127 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-15 06:14:22,128 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-15 06:14:22,128 INFO L290 TraceCheckUtils]: 135: Hoare triple {49250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:14:22,129 INFO L290 TraceCheckUtils]: 136: Hoare triple {49254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48745#false} is VALID [2022-04-15 06:14:22,129 INFO L290 TraceCheckUtils]: 137: Hoare triple {48745#false} assume !false; {48745#false} is VALID [2022-04-15 06:14:22,129 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-15 06:14:22,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:22,986 INFO L290 TraceCheckUtils]: 137: Hoare triple {48745#false} assume !false; {48745#false} is VALID [2022-04-15 06:14:22,986 INFO L290 TraceCheckUtils]: 136: Hoare triple {49254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48745#false} is VALID [2022-04-15 06:14:22,987 INFO L290 TraceCheckUtils]: 135: Hoare triple {49250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:14:22,987 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-15 06:14:22,988 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-15 06:14:22,988 INFO L290 TraceCheckUtils]: 132: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,988 INFO L290 TraceCheckUtils]: 131: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,988 INFO L290 TraceCheckUtils]: 130: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,988 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-15 06:14:22,988 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-15 06:14:22,988 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-15 06:14:22,989 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-15 06:14:22,989 INFO L290 TraceCheckUtils]: 125: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,989 INFO L290 TraceCheckUtils]: 124: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,989 INFO L290 TraceCheckUtils]: 123: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,989 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-15 06:14:22,990 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-15 06:14:22,990 INFO L290 TraceCheckUtils]: 120: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,990 INFO L290 TraceCheckUtils]: 119: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,990 INFO L290 TraceCheckUtils]: 118: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,990 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-15 06:14:22,990 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-15 06:14:22,991 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-15 06:14:22,991 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-15 06:14:22,992 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-15 06:14:22,992 INFO L290 TraceCheckUtils]: 112: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,992 INFO L290 TraceCheckUtils]: 111: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,992 INFO L290 TraceCheckUtils]: 110: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,992 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-15 06:14:22,993 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-15 06:14:22,993 INFO L290 TraceCheckUtils]: 107: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,993 INFO L290 TraceCheckUtils]: 106: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,993 INFO L290 TraceCheckUtils]: 105: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,993 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-15 06:14:22,993 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-15 06:14:22,993 INFO L290 TraceCheckUtils]: 102: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,993 INFO L290 TraceCheckUtils]: 101: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,993 INFO L290 TraceCheckUtils]: 100: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,994 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-15 06:14:22,994 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-15 06:14:22,994 INFO L290 TraceCheckUtils]: 97: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,994 INFO L290 TraceCheckUtils]: 96: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,994 INFO L290 TraceCheckUtils]: 95: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,994 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-15 06:14:22,995 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-15 06:14:22,995 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-15 06:14:22,995 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-15 06:14:22,995 INFO L290 TraceCheckUtils]: 90: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,996 INFO L290 TraceCheckUtils]: 89: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,996 INFO L290 TraceCheckUtils]: 88: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,996 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-15 06:14:22,996 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-15 06:14:22,996 INFO L290 TraceCheckUtils]: 85: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,996 INFO L290 TraceCheckUtils]: 84: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,996 INFO L290 TraceCheckUtils]: 83: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,996 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-15 06:14:22,997 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-15 06:14:22,997 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-15 06:14:22,997 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-15 06:14:22,998 INFO L290 TraceCheckUtils]: 78: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,998 INFO L290 TraceCheckUtils]: 77: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,998 INFO L290 TraceCheckUtils]: 76: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:22,998 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-15 06:14:22,998 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-15 06:14:22,998 INFO L290 TraceCheckUtils]: 73: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:22,998 INFO L290 TraceCheckUtils]: 72: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:22,998 INFO L290 TraceCheckUtils]: 71: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:23,007 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-15 06:14:23,020 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-15 06:14:23,020 INFO L290 TraceCheckUtils]: 68: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:23,020 INFO L290 TraceCheckUtils]: 67: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:23,020 INFO L290 TraceCheckUtils]: 66: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:23,020 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-15 06:14:23,021 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-15 06:14:23,021 INFO L290 TraceCheckUtils]: 63: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:23,021 INFO L290 TraceCheckUtils]: 62: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:23,021 INFO L290 TraceCheckUtils]: 61: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:23,021 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-15 06:14:23,021 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-15 06:14:23,022 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-15 06:14:23,022 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-15 06:14:23,022 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-15 06:14:23,023 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-15 06:14:23,023 INFO L290 TraceCheckUtils]: 54: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:23,023 INFO L290 TraceCheckUtils]: 53: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:23,023 INFO L290 TraceCheckUtils]: 52: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:23,023 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-15 06:14:23,024 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-15 06:14:23,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:23,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:23,024 INFO L290 TraceCheckUtils]: 47: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:23,024 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-15 06:14:23,024 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-15 06:14:23,025 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-15 06:14:23,025 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-15 06:14:23,025 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-15 06:14:23,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:23,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:23,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:23,026 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-15 06:14:23,026 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-15 06:14:23,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:23,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:23,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:23,026 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-15 06:14:23,027 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-15 06:14:23,027 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-15 06:14:23,028 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-15 06:14:23,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:23,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:23,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:23,028 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-15 06:14:23,028 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-15 06:14:23,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:23,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:23,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:23,029 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-15 06:14:23,029 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-15 06:14:23,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:23,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:23,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:23,029 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-15 06:14:23,030 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-15 06:14:23,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:23,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-15 06:14:23,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-15 06:14:23,030 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-15 06:14:23,031 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-15 06:14:23,031 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-15 06:14:23,031 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-15 06:14:23,032 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-15 06:14:23,032 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-15 06:14:23,033 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-15 06:14:23,033 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-15 06:14:23,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-15 06:14:23,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-15 06:14:23,033 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-15 06:14:23,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {48744#true} call ULTIMATE.init(); {48744#true} is VALID [2022-04-15 06:14:23,034 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-15 06:14:23,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745600199] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:23,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:23,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2022-04-15 06:14:23,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:23,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1847017670] [2022-04-15 06:14:23,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1847017670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:23,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:23,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:14:23,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428508365] [2022-04-15 06:14:23,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:23,037 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-15 06:14:23,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:23,039 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-15 06:14:23,128 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-15 06:14:23,129 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:14:23,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:23,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:14:23,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:14:23,129 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-15 06:14:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:34,377 INFO L93 Difference]: Finished difference Result 770 states and 1246 transitions. [2022-04-15 06:14:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:14:34,378 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-15 06:14:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:34,378 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-15 06:14:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 240 transitions. [2022-04-15 06:14:34,381 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-15 06:14:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 240 transitions. [2022-04-15 06:14:34,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 240 transitions. [2022-04-15 06:14:34,651 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-15 06:14:34,658 INFO L225 Difference]: With dead ends: 770 [2022-04-15 06:14:34,658 INFO L226 Difference]: Without dead ends: 309 [2022-04-15 06:14:34,660 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:14:34,660 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 132 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:34,660 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 105 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 06:14:34,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-15 06:14:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 213. [2022-04-15 06:14:36,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:36,393 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-15 06:14:36,394 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-15 06:14:36,394 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-15 06:14:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:36,411 INFO L93 Difference]: Finished difference Result 309 states and 449 transitions. [2022-04-15 06:14:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 449 transitions. [2022-04-15 06:14:36,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:36,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:36,412 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-15 06:14:36,412 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-15 06:14:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:36,419 INFO L93 Difference]: Finished difference Result 309 states and 449 transitions. [2022-04-15 06:14:36,419 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 449 transitions. [2022-04-15 06:14:36,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:36,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:36,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:36,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:36,420 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-15 06:14:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 280 transitions. [2022-04-15 06:14:36,424 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 280 transitions. Word has length 138 [2022-04-15 06:14:36,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:36,424 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 280 transitions. [2022-04-15 06:14:36,424 INFO L479 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-15 06:14:36,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 280 transitions. [2022-04-15 06:14:36,978 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-15 06:14:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 280 transitions. [2022-04-15 06:14:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-15 06:14:36,979 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:36,979 INFO L499 BasicCegarLoop]: 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-15 06:14:36,998 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-15 06:14:37,180 WARN L460 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-15 06:14:37,180 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:37,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:37,180 INFO L85 PathProgramCache]: Analyzing trace with hash -915763573, now seen corresponding path program 1 times [2022-04-15 06:14:37,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:37,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [142869084] [2022-04-15 06:14:37,181 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:14:37,181 INFO L85 PathProgramCache]: Analyzing trace with hash -915763573, now seen corresponding path program 2 times [2022-04-15 06:14:37,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:37,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949114159] [2022-04-15 06:14:37,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:37,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,350 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-15 06:14:37,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-15 06:14:37,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:14:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,358 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-15 06:14:37,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:14:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,361 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-15 06:14:37,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 06:14:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,372 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-15 06:14:37,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 06:14:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,375 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-15 06:14:37,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:14:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,378 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-15 06:14:37,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-15 06:14:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,392 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-15 06:14:37,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 06:14:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,395 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-15 06:14:37,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-15 06:14:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,398 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-15 06:14:37,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 06:14:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,400 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-15 06:14:37,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-15 06:14:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,403 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-15 06:14:37,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 06:14:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,411 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-15 06:14:37,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-15 06:14:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,414 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-15 06:14:37,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-15 06:14:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,418 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-15 06:14:37,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-15 06:14:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,437 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-15 06:14:37,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-15 06:14:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,440 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-15 06:14:37,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-15 06:14:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,444 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-15 06:14:37,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-04-15 06:14:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,447 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-15 06:14:37,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-15 06:14:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,450 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-15 06:14:37,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-15 06:14:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,452 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-15 06:14:37,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-15 06:14:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,454 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-15 06:14:37,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-15 06:14:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,457 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-15 06:14:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-15 06:14:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,467 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-15 06:14:37,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-04-15 06:14:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,471 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-15 06:14:37,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-15 06:14:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,473 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-15 06:14:37,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-04-15 06:14:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-15 06:14:37,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-04-15 06:14:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-15 06:14:37,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-04-15 06:14:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-15 06:14:37,494 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-15 06:14:37,494 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-15 06:14:37,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-15 06:14:37,494 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-15 06:14:37,494 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-15 06:14:37,495 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-15 06:14:37,495 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-15 06:14:37,495 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-15 06:14:37,495 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-15 06:14:37,496 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-15 06:14:37,496 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-15 06:14:37,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,496 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-15 06:14:37,496 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-15 06:14:37,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,497 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-15 06:14:37,497 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-15 06:14:37,498 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-15 06:14:37,498 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-15 06:14:37,498 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-15 06:14:37,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,499 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-15 06:14:37,499 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-15 06:14:37,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,499 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-15 06:14:37,500 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-15 06:14:37,500 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-15 06:14:37,501 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-15 06:14:37,501 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-15 06:14:37,501 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-15 06:14:37,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,501 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-15 06:14:37,501 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-15 06:14:37,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,502 INFO L290 TraceCheckUtils]: 45: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,502 INFO L290 TraceCheckUtils]: 46: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,502 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-15 06:14:37,502 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-15 06:14:37,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,502 INFO L290 TraceCheckUtils]: 51: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,503 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-15 06:14:37,503 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-15 06:14:37,503 INFO L290 TraceCheckUtils]: 54: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,503 INFO L290 TraceCheckUtils]: 55: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,503 INFO L290 TraceCheckUtils]: 56: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,503 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-15 06:14:37,504 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-15 06:14:37,504 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-15 06:14:37,504 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-15 06:14:37,504 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,504 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,504 INFO L290 TraceCheckUtils]: 63: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,505 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-15 06:14:37,505 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-15 06:14:37,505 INFO L290 TraceCheckUtils]: 66: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,505 INFO L290 TraceCheckUtils]: 67: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,505 INFO L290 TraceCheckUtils]: 68: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,505 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-15 06:14:37,505 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-15 06:14:37,511 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-15 06:14:37,511 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-15 06:14:37,511 INFO L290 TraceCheckUtils]: 73: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,511 INFO L290 TraceCheckUtils]: 74: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,511 INFO L290 TraceCheckUtils]: 75: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,511 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-15 06:14:37,512 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-15 06:14:37,512 INFO L290 TraceCheckUtils]: 78: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,512 INFO L290 TraceCheckUtils]: 79: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,512 INFO L290 TraceCheckUtils]: 80: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,512 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-15 06:14:37,512 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-15 06:14:37,512 INFO L290 TraceCheckUtils]: 83: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,512 INFO L290 TraceCheckUtils]: 84: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,512 INFO L290 TraceCheckUtils]: 85: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,513 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-15 06:14:37,513 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-15 06:14:37,513 INFO L290 TraceCheckUtils]: 88: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,513 INFO L290 TraceCheckUtils]: 89: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,513 INFO L290 TraceCheckUtils]: 90: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,513 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-15 06:14:37,514 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-15 06:14:37,514 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-15 06:14:37,515 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-15 06:14:37,515 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-15 06:14:37,515 INFO L290 TraceCheckUtils]: 96: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,515 INFO L290 TraceCheckUtils]: 97: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,515 INFO L290 TraceCheckUtils]: 98: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,515 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-15 06:14:37,515 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-15 06:14:37,516 INFO L290 TraceCheckUtils]: 101: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,516 INFO L290 TraceCheckUtils]: 102: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,516 INFO L290 TraceCheckUtils]: 103: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,516 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-15 06:14:37,516 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-15 06:14:37,516 INFO L290 TraceCheckUtils]: 106: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,516 INFO L290 TraceCheckUtils]: 107: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,516 INFO L290 TraceCheckUtils]: 108: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,517 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-15 06:14:37,517 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-15 06:14:37,517 INFO L290 TraceCheckUtils]: 111: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,517 INFO L290 TraceCheckUtils]: 112: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,517 INFO L290 TraceCheckUtils]: 113: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,517 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-15 06:14:37,531 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-15 06:14:37,532 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-15 06:14:37,532 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-15 06:14:37,532 INFO L290 TraceCheckUtils]: 118: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,532 INFO L290 TraceCheckUtils]: 119: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,532 INFO L290 TraceCheckUtils]: 120: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,533 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-15 06:14:37,533 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-15 06:14:37,533 INFO L290 TraceCheckUtils]: 123: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,533 INFO L290 TraceCheckUtils]: 124: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,533 INFO L290 TraceCheckUtils]: 125: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,533 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-15 06:14:37,534 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-15 06:14:37,534 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-15 06:14:37,534 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-15 06:14:37,534 INFO L290 TraceCheckUtils]: 130: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,534 INFO L290 TraceCheckUtils]: 131: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,534 INFO L290 TraceCheckUtils]: 132: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,535 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-15 06:14:37,535 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-15 06:14:37,535 INFO L290 TraceCheckUtils]: 135: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,535 INFO L290 TraceCheckUtils]: 136: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,535 INFO L290 TraceCheckUtils]: 137: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,535 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-15 06:14:37,536 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-15 06:14:37,536 INFO L290 TraceCheckUtils]: 140: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,536 INFO L290 TraceCheckUtils]: 141: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,536 INFO L290 TraceCheckUtils]: 142: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,536 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-15 06:14:37,536 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-15 06:14:37,536 INFO L290 TraceCheckUtils]: 145: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,536 INFO L290 TraceCheckUtils]: 146: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,536 INFO L290 TraceCheckUtils]: 147: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,537 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-15 06:14:37,537 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-15 06:14:37,538 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-15 06:14:37,538 INFO L290 TraceCheckUtils]: 151: Hoare triple {52290#false} assume !(~j~0 < ~r~0); {52290#false} is VALID [2022-04-15 06:14:37,538 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-15 06:14:37,538 INFO L290 TraceCheckUtils]: 153: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,538 INFO L290 TraceCheckUtils]: 154: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,538 INFO L290 TraceCheckUtils]: 155: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,538 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-15 06:14:37,538 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-15 06:14:37,538 INFO L290 TraceCheckUtils]: 158: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,538 INFO L290 TraceCheckUtils]: 159: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,538 INFO L290 TraceCheckUtils]: 160: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,538 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-15 06:14:37,538 INFO L290 TraceCheckUtils]: 162: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-15 06:14:37,538 INFO L290 TraceCheckUtils]: 163: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-15 06:14:37,539 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-15 06:14:37,539 INFO L290 TraceCheckUtils]: 165: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:37,539 INFO L290 TraceCheckUtils]: 166: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:37,539 INFO L290 TraceCheckUtils]: 167: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:37,539 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-15 06:14:37,539 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-15 06:14:37,539 INFO L290 TraceCheckUtils]: 170: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:37,539 INFO L290 TraceCheckUtils]: 171: Hoare triple {52290#false} assume 0 == ~cond; {52290#false} is VALID [2022-04-15 06:14:37,539 INFO L290 TraceCheckUtils]: 172: Hoare triple {52290#false} assume !false; {52290#false} is VALID [2022-04-15 06:14:37,540 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-15 06:14:37,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:37,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949114159] [2022-04-15 06:14:37,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949114159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:37,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708233972] [2022-04-15 06:14:37,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:14:37,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:37,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:37,556 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-15 06:14:37,588 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-15 06:14:37,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:14:37,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:14:37,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:14:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:37,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:42,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {52289#true} call ULTIMATE.init(); {52289#true} is VALID [2022-04-15 06:14:42,842 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-15 06:14:42,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:42,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-15 06:14:42,842 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-15 06:14:42,842 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-15 06:14:42,843 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-15 06:14:42,843 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-15 06:14:42,843 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-15 06:14:42,843 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-15 06:14:42,844 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-15 06:14:42,844 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-15 06:14:42,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:42,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:42,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:42,845 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-15 06:14:42,845 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-15 06:14:42,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:42,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:42,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:42,845 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-15 06:14:42,846 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-15 06:14:42,846 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-15 06:14:42,846 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-15 06:14:42,847 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-15 06:14:42,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:42,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:42,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:42,847 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-15 06:14:42,847 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-15 06:14:42,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:42,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:42,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:42,848 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-15 06:14:42,848 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-15 06:14:42,849 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-15 06:14:42,849 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-15 06:14:42,850 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-15 06:14:42,850 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-15 06:14:42,850 INFO L290 TraceCheckUtils]: 39: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:42,850 INFO L290 TraceCheckUtils]: 40: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:42,850 INFO L290 TraceCheckUtils]: 41: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:42,851 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-15 06:14:42,851 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-15 06:14:42,851 INFO L290 TraceCheckUtils]: 44: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:42,851 INFO L290 TraceCheckUtils]: 45: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:42,851 INFO L290 TraceCheckUtils]: 46: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:42,851 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-15 06:14:42,851 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-15 06:14:42,851 INFO L290 TraceCheckUtils]: 49: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:42,852 INFO L290 TraceCheckUtils]: 50: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:42,852 INFO L290 TraceCheckUtils]: 51: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:42,852 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-15 06:14:42,852 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-15 06:14:42,852 INFO L290 TraceCheckUtils]: 54: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:42,852 INFO L290 TraceCheckUtils]: 55: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:42,852 INFO L290 TraceCheckUtils]: 56: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:42,853 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-15 06:14:42,853 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-15 06:14:42,854 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-15 06:14:42,854 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-15 06:14:42,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:42,854 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:42,854 INFO L290 TraceCheckUtils]: 63: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:42,854 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-15 06:14:42,854 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-15 06:14:42,854 INFO L290 TraceCheckUtils]: 66: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:42,854 INFO L290 TraceCheckUtils]: 67: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:42,855 INFO L290 TraceCheckUtils]: 68: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:42,855 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-15 06:14:42,855 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-15 06:14:42,856 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-15 06:14:42,856 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-15 06:14:42,856 INFO L290 TraceCheckUtils]: 73: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:42,856 INFO L290 TraceCheckUtils]: 74: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:42,856 INFO L290 TraceCheckUtils]: 75: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:42,857 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-15 06:14:42,857 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-15 06:14:42,857 INFO L290 TraceCheckUtils]: 78: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:42,857 INFO L290 TraceCheckUtils]: 79: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:42,857 INFO L290 TraceCheckUtils]: 80: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:42,857 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-15 06:14:42,857 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-15 06:14:42,857 INFO L290 TraceCheckUtils]: 83: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:42,858 INFO L290 TraceCheckUtils]: 84: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:42,858 INFO L290 TraceCheckUtils]: 85: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:42,858 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-15 06:14:42,858 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-15 06:14:42,858 INFO L290 TraceCheckUtils]: 88: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:42,858 INFO L290 TraceCheckUtils]: 89: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:42,858 INFO L290 TraceCheckUtils]: 90: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:42,859 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-15 06:14:42,860 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-15 06:14:42,860 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-15 06:14:42,860 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-15 06:14:42,861 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-15 06:14:42,861 INFO L290 TraceCheckUtils]: 96: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:42,861 INFO L290 TraceCheckUtils]: 97: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-15 06:14:42,861 INFO L290 TraceCheckUtils]: 98: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-15 06:14:42,861 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52290#false} {52290#false} #110#return; {52290#false} is VALID [2022-04-15 06:14:42,861 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-15 06:14:42,861 INFO L290 TraceCheckUtils]: 101: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:42,861 INFO L290 TraceCheckUtils]: 102: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-15 06:14:42,861 INFO L290 TraceCheckUtils]: 103: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-15 06:14:42,861 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {52290#false} {52290#false} #112#return; {52290#false} is VALID [2022-04-15 06:14:42,861 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-15 06:14:42,861 INFO L290 TraceCheckUtils]: 106: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:42,861 INFO L290 TraceCheckUtils]: 107: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-15 06:14:42,861 INFO L290 TraceCheckUtils]: 108: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-15 06:14:42,862 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {52290#false} {52290#false} #114#return; {52290#false} is VALID [2022-04-15 06:14:42,862 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-15 06:14:42,862 INFO L290 TraceCheckUtils]: 111: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:42,862 INFO L290 TraceCheckUtils]: 112: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-15 06:14:42,862 INFO L290 TraceCheckUtils]: 113: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-15 06:14:42,862 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {52290#false} {52290#false} #116#return; {52290#false} is VALID [2022-04-15 06:14:42,862 INFO L290 TraceCheckUtils]: 115: Hoare triple {52290#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52290#false} is VALID [2022-04-15 06:14:42,862 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-15 06:14:42,862 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-15 06:14:42,862 INFO L290 TraceCheckUtils]: 118: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:42,862 INFO L290 TraceCheckUtils]: 119: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-15 06:14:42,862 INFO L290 TraceCheckUtils]: 120: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-15 06:14:42,862 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {52290#false} {52290#false} #118#return; {52290#false} is VALID [2022-04-15 06:14:42,862 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-15 06:14:42,863 INFO L290 TraceCheckUtils]: 123: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:42,863 INFO L290 TraceCheckUtils]: 124: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-15 06:14:42,863 INFO L290 TraceCheckUtils]: 125: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-15 06:14:42,863 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {52290#false} {52290#false} #120#return; {52290#false} is VALID [2022-04-15 06:14:42,863 INFO L290 TraceCheckUtils]: 127: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-15 06:14:42,863 INFO L290 TraceCheckUtils]: 128: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-15 06:14:42,863 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-15 06:14:42,863 INFO L290 TraceCheckUtils]: 130: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:42,863 INFO L290 TraceCheckUtils]: 131: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-15 06:14:42,863 INFO L290 TraceCheckUtils]: 132: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-15 06:14:42,864 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {52290#false} {52290#false} #122#return; {52290#false} is VALID [2022-04-15 06:14:42,864 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-15 06:14:42,864 INFO L290 TraceCheckUtils]: 135: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:42,864 INFO L290 TraceCheckUtils]: 136: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-15 06:14:42,864 INFO L290 TraceCheckUtils]: 137: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-15 06:14:42,864 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {52290#false} {52290#false} #124#return; {52290#false} is VALID [2022-04-15 06:14:42,864 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-15 06:14:42,864 INFO L290 TraceCheckUtils]: 140: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:42,864 INFO L290 TraceCheckUtils]: 141: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-15 06:14:42,864 INFO L290 TraceCheckUtils]: 142: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-15 06:14:42,865 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {52290#false} {52290#false} #126#return; {52290#false} is VALID [2022-04-15 06:14:42,865 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-15 06:14:42,865 INFO L290 TraceCheckUtils]: 145: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:42,865 INFO L290 TraceCheckUtils]: 146: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-15 06:14:42,865 INFO L290 TraceCheckUtils]: 147: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-15 06:14:42,865 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {52290#false} {52290#false} #128#return; {52290#false} is VALID [2022-04-15 06:14:42,865 INFO L290 TraceCheckUtils]: 149: Hoare triple {52290#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52290#false} is VALID [2022-04-15 06:14:42,865 INFO L290 TraceCheckUtils]: 150: Hoare triple {52290#false} assume !!(~j~0 <= ~r~0); {52290#false} is VALID [2022-04-15 06:14:42,865 INFO L290 TraceCheckUtils]: 151: Hoare triple {52290#false} assume !(~j~0 < ~r~0); {52290#false} is VALID [2022-04-15 06:14:42,865 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-15 06:14:42,865 INFO L290 TraceCheckUtils]: 153: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:42,865 INFO L290 TraceCheckUtils]: 154: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-15 06:14:42,865 INFO L290 TraceCheckUtils]: 155: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-15 06:14:42,865 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {52290#false} {52290#false} #118#return; {52290#false} is VALID [2022-04-15 06:14:42,866 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-15 06:14:42,866 INFO L290 TraceCheckUtils]: 158: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:42,866 INFO L290 TraceCheckUtils]: 159: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-15 06:14:42,866 INFO L290 TraceCheckUtils]: 160: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-15 06:14:42,866 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {52290#false} {52290#false} #120#return; {52290#false} is VALID [2022-04-15 06:14:42,866 INFO L290 TraceCheckUtils]: 162: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-15 06:14:42,866 INFO L290 TraceCheckUtils]: 163: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-15 06:14:42,866 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-15 06:14:42,868 INFO L290 TraceCheckUtils]: 165: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:42,868 INFO L290 TraceCheckUtils]: 166: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-15 06:14:42,868 INFO L290 TraceCheckUtils]: 167: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-15 06:14:42,868 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {52290#false} {52290#false} #122#return; {52290#false} is VALID [2022-04-15 06:14:42,869 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-15 06:14:42,869 INFO L290 TraceCheckUtils]: 170: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:42,869 INFO L290 TraceCheckUtils]: 171: Hoare triple {52290#false} assume 0 == ~cond; {52290#false} is VALID [2022-04-15 06:14:42,869 INFO L290 TraceCheckUtils]: 172: Hoare triple {52290#false} assume !false; {52290#false} is VALID [2022-04-15 06:14:42,870 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-15 06:14:42,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:44,066 INFO L290 TraceCheckUtils]: 172: Hoare triple {52290#false} assume !false; {52290#false} is VALID [2022-04-15 06:14:44,066 INFO L290 TraceCheckUtils]: 171: Hoare triple {52290#false} assume 0 == ~cond; {52290#false} is VALID [2022-04-15 06:14:44,066 INFO L290 TraceCheckUtils]: 170: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-15 06:14:44,066 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-15 06:14:44,066 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-15 06:14:44,066 INFO L290 TraceCheckUtils]: 167: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,067 INFO L290 TraceCheckUtils]: 166: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,067 INFO L290 TraceCheckUtils]: 165: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,067 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-15 06:14:44,067 INFO L290 TraceCheckUtils]: 163: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-15 06:14:44,067 INFO L290 TraceCheckUtils]: 162: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-15 06:14:44,067 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-15 06:14:44,067 INFO L290 TraceCheckUtils]: 160: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,067 INFO L290 TraceCheckUtils]: 159: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,067 INFO L290 TraceCheckUtils]: 158: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,067 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-15 06:14:44,067 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-15 06:14:44,067 INFO L290 TraceCheckUtils]: 155: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,067 INFO L290 TraceCheckUtils]: 154: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,067 INFO L290 TraceCheckUtils]: 153: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,068 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-15 06:14:44,068 INFO L290 TraceCheckUtils]: 151: Hoare triple {52290#false} assume !(~j~0 < ~r~0); {52290#false} is VALID [2022-04-15 06:14:44,068 INFO L290 TraceCheckUtils]: 150: Hoare triple {52290#false} assume !!(~j~0 <= ~r~0); {52290#false} is VALID [2022-04-15 06:14:44,068 INFO L290 TraceCheckUtils]: 149: Hoare triple {52290#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52290#false} is VALID [2022-04-15 06:14:44,068 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {52289#true} {52290#false} #128#return; {52290#false} is VALID [2022-04-15 06:14:44,068 INFO L290 TraceCheckUtils]: 147: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,068 INFO L290 TraceCheckUtils]: 146: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,068 INFO L290 TraceCheckUtils]: 145: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,068 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-15 06:14:44,068 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {52289#true} {52290#false} #126#return; {52290#false} is VALID [2022-04-15 06:14:44,068 INFO L290 TraceCheckUtils]: 142: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,068 INFO L290 TraceCheckUtils]: 141: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,068 INFO L290 TraceCheckUtils]: 140: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,068 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-15 06:14:44,069 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {52289#true} {52290#false} #124#return; {52290#false} is VALID [2022-04-15 06:14:44,069 INFO L290 TraceCheckUtils]: 137: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,069 INFO L290 TraceCheckUtils]: 136: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,069 INFO L290 TraceCheckUtils]: 135: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,069 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-15 06:14:44,069 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-15 06:14:44,069 INFO L290 TraceCheckUtils]: 132: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,069 INFO L290 TraceCheckUtils]: 131: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,069 INFO L290 TraceCheckUtils]: 130: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,069 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-15 06:14:44,069 INFO L290 TraceCheckUtils]: 128: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-15 06:14:44,069 INFO L290 TraceCheckUtils]: 127: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-15 06:14:44,069 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-15 06:14:44,069 INFO L290 TraceCheckUtils]: 125: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,070 INFO L290 TraceCheckUtils]: 124: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,070 INFO L290 TraceCheckUtils]: 123: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,070 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-15 06:14:44,070 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-15 06:14:44,070 INFO L290 TraceCheckUtils]: 120: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,070 INFO L290 TraceCheckUtils]: 119: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,070 INFO L290 TraceCheckUtils]: 118: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,070 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-15 06:14:44,070 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-15 06:14:44,070 INFO L290 TraceCheckUtils]: 115: Hoare triple {52290#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52290#false} is VALID [2022-04-15 06:14:44,070 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {52289#true} {52290#false} #116#return; {52290#false} is VALID [2022-04-15 06:14:44,070 INFO L290 TraceCheckUtils]: 113: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,070 INFO L290 TraceCheckUtils]: 112: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,070 INFO L290 TraceCheckUtils]: 111: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,071 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-15 06:14:44,071 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {52289#true} {52290#false} #114#return; {52290#false} is VALID [2022-04-15 06:14:44,071 INFO L290 TraceCheckUtils]: 108: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,071 INFO L290 TraceCheckUtils]: 107: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,071 INFO L290 TraceCheckUtils]: 106: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,071 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-15 06:14:44,071 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {52289#true} {52290#false} #112#return; {52290#false} is VALID [2022-04-15 06:14:44,071 INFO L290 TraceCheckUtils]: 103: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,071 INFO L290 TraceCheckUtils]: 102: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,071 INFO L290 TraceCheckUtils]: 101: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,071 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-15 06:14:44,071 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52289#true} {52290#false} #110#return; {52290#false} is VALID [2022-04-15 06:14:44,071 INFO L290 TraceCheckUtils]: 98: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,071 INFO L290 TraceCheckUtils]: 97: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,072 INFO L290 TraceCheckUtils]: 96: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,072 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-15 06:14:44,072 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-15 06:14:44,072 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-15 06:14:44,073 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-15 06:14:44,073 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-15 06:14:44,073 INFO L290 TraceCheckUtils]: 90: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,073 INFO L290 TraceCheckUtils]: 89: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,074 INFO L290 TraceCheckUtils]: 88: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,074 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-15 06:14:44,074 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-15 06:14:44,074 INFO L290 TraceCheckUtils]: 85: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,074 INFO L290 TraceCheckUtils]: 84: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,074 INFO L290 TraceCheckUtils]: 83: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,074 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-15 06:14:44,075 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-15 06:14:44,075 INFO L290 TraceCheckUtils]: 80: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,075 INFO L290 TraceCheckUtils]: 79: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,075 INFO L290 TraceCheckUtils]: 78: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,075 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-15 06:14:44,076 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-15 06:14:44,076 INFO L290 TraceCheckUtils]: 75: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,076 INFO L290 TraceCheckUtils]: 74: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,076 INFO L290 TraceCheckUtils]: 73: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,076 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-15 06:14:44,076 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-15 06:14:44,076 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-15 06:14:44,077 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-15 06:14:44,077 INFO L290 TraceCheckUtils]: 68: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,077 INFO L290 TraceCheckUtils]: 67: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,077 INFO L290 TraceCheckUtils]: 66: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,077 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-15 06:14:44,078 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-15 06:14:44,078 INFO L290 TraceCheckUtils]: 63: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,078 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,078 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,078 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-15 06:14:44,078 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-15 06:14:44,079 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-15 06:14:44,079 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-15 06:14:44,079 INFO L290 TraceCheckUtils]: 56: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,079 INFO L290 TraceCheckUtils]: 55: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,079 INFO L290 TraceCheckUtils]: 54: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,079 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-15 06:14:44,080 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-15 06:14:44,080 INFO L290 TraceCheckUtils]: 51: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,080 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-15 06:14:44,080 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-15 06:14:44,081 INFO L290 TraceCheckUtils]: 46: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,081 INFO L290 TraceCheckUtils]: 45: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,081 INFO L290 TraceCheckUtils]: 44: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,081 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-15 06:14:44,081 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-15 06:14:44,081 INFO L290 TraceCheckUtils]: 41: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,081 INFO L290 TraceCheckUtils]: 40: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,081 INFO L290 TraceCheckUtils]: 39: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,081 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-15 06:14:44,082 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-15 06:14:44,082 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-15 06:14:44,083 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-15 06:14:44,083 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-15 06:14:44,084 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-15 06:14:44,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,084 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-15 06:14:44,084 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-15 06:14:44,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,085 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-15 06:14:44,094 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-15 06:14:44,095 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-15 06:14:44,095 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-15 06:14:44,096 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-15 06:14:44,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,096 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-15 06:14:44,097 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-15 06:14:44,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-15 06:14:44,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-15 06:14:44,097 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-15 06:14:44,098 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-15 06:14:44,098 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-15 06:14:44,099 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-15 06:14:44,099 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-15 06:14:44,099 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-15 06:14:44,099 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-15 06:14:44,099 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-15 06:14:44,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-15 06:14:44,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-15 06:14:44,099 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-15 06:14:44,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {52289#true} call ULTIMATE.init(); {52289#true} is VALID [2022-04-15 06:14:44,100 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-15 06:14:44,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708233972] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:44,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:44,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2022-04-15 06:14:44,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:44,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [142869084] [2022-04-15 06:14:44,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [142869084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:44,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:44,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:14:44,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266867682] [2022-04-15 06:14:44,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:44,101 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-15 06:14:44,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:44,102 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-15 06:14:44,199 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-15 06:14:44,199 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:14:44,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:44,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:14:44,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:14:44,200 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-15 06:14:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:49,060 INFO L93 Difference]: Finished difference Result 399 states and 535 transitions. [2022-04-15 06:14:49,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:14:49,061 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-15 06:14:49,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:49,061 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-15 06:14:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 223 transitions. [2022-04-15 06:14:49,063 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-15 06:14:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 223 transitions. [2022-04-15 06:14:49,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 223 transitions. [2022-04-15 06:14:49,281 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-15 06:14:49,285 INFO L225 Difference]: With dead ends: 399 [2022-04-15 06:14:49,285 INFO L226 Difference]: Without dead ends: 246 [2022-04-15 06:14:49,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=868, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:14:49,286 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 88 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:49,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 104 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:14:49,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-04-15 06:14:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 211. [2022-04-15 06:14:50,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:50,811 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-15 06:14:50,811 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-15 06:14:50,811 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-15 06:14:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:50,815 INFO L93 Difference]: Finished difference Result 246 states and 325 transitions. [2022-04-15 06:14:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 325 transitions. [2022-04-15 06:14:50,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:50,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:50,816 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-15 06:14:50,817 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-15 06:14:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:50,821 INFO L93 Difference]: Finished difference Result 246 states and 325 transitions. [2022-04-15 06:14:50,821 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 325 transitions. [2022-04-15 06:14:50,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:50,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:50,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:50,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:50,822 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-15 06:14:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2022-04-15 06:14:50,833 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 173 [2022-04-15 06:14:50,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:50,842 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2022-04-15 06:14:50,842 INFO L479 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-15 06:14:50,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 276 transitions. [2022-04-15 06:14:51,444 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-15 06:14:51,445 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2022-04-15 06:14:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-15 06:14:51,445 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:51,446 INFO L499 BasicCegarLoop]: 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-15 06:14:51,465 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-15 06:14:51,646 WARN L460 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-15 06:14:51,646 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:51,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash 345153677, now seen corresponding path program 5 times [2022-04-15 06:14:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:51,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1828856294] [2022-04-15 06:14:51,647 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:14:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash 345153677, now seen corresponding path program 6 times [2022-04-15 06:14:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:51,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21896096] [2022-04-15 06:14:51,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,775 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-15 06:14:51,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-15 06:14:51,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:14:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,779 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-15 06:14:51,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:14:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,797 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-15 06:14:51,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 06:14:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,800 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-15 06:14:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 06:14:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,803 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-15 06:14:51,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:14:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,806 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-15 06:14:51,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-15 06:14:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,808 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-15 06:14:51,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 06:14:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,811 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-15 06:14:51,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-15 06:14:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,837 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-15 06:14:51,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 06:14:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,840 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-15 06:14:51,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-15 06:14:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,843 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-15 06:14:51,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 06:14:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,847 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-15 06:14:51,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-15 06:14:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,850 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-15 06:14:51,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-15 06:14:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,854 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-15 06:14:51,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-15 06:14:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,873 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-15 06:14:51,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-15 06:14:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #110#return; {55195#false} is VALID [2022-04-15 06:14:51,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-15 06:14:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #112#return; {55195#false} is VALID [2022-04-15 06:14:51,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-04-15 06:14:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #114#return; {55195#false} is VALID [2022-04-15 06:14:51,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-15 06:14:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #116#return; {55195#false} is VALID [2022-04-15 06:14:51,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-15 06:14:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-15 06:14:51,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-15 06:14:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-15 06:14:51,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-15 06:14:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-15 06:14:51,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-15 06:14:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #124#return; {55195#false} is VALID [2022-04-15 06:14:51,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-04-15 06:14:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #126#return; {55195#false} is VALID [2022-04-15 06:14:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-15 06:14:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #128#return; {55195#false} is VALID [2022-04-15 06:14:51,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-04-15 06:14:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-15 06:14:51,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-04-15 06:14:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-15 06:14:51,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-04-15 06:14:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-15 06:14:51,934 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-15 06:14:51,934 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-15 06:14:51,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-15 06:14:51,934 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-15 06:14:51,934 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-15 06:14:51,934 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-15 06:14:51,934 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-15 06:14:51,934 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-15 06:14:51,935 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-15 06:14:51,935 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-15 06:14:51,935 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-15 06:14:51,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,936 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-15 06:14:51,936 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-15 06:14:51,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,945 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-15 06:14:51,945 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-15 06:14:51,946 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-15 06:14:51,946 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-15 06:14:51,946 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-15 06:14:51,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,947 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-15 06:14:51,947 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-15 06:14:51,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,948 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-15 06:14:51,948 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-15 06:14:51,948 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-15 06:14:51,949 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-15 06:14:51,949 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-15 06:14:51,949 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-15 06:14:51,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,950 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-15 06:14:51,950 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-15 06:14:51,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,950 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-15 06:14:51,950 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-15 06:14:51,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,951 INFO L290 TraceCheckUtils]: 51: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,951 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-15 06:14:51,951 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-15 06:14:51,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,952 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-15 06:14:51,952 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-15 06:14:51,952 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-15 06:14:51,952 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-15 06:14:51,952 INFO L290 TraceCheckUtils]: 61: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,953 INFO L290 TraceCheckUtils]: 62: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,953 INFO L290 TraceCheckUtils]: 63: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,953 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-15 06:14:51,953 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-15 06:14:51,953 INFO L290 TraceCheckUtils]: 66: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,953 INFO L290 TraceCheckUtils]: 67: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,953 INFO L290 TraceCheckUtils]: 68: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,954 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-15 06:14:51,954 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-15 06:14:51,954 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-15 06:14:51,954 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-15 06:14:51,954 INFO L290 TraceCheckUtils]: 73: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,954 INFO L290 TraceCheckUtils]: 74: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,954 INFO L290 TraceCheckUtils]: 75: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,955 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-15 06:14:51,955 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-15 06:14:51,955 INFO L290 TraceCheckUtils]: 78: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,955 INFO L290 TraceCheckUtils]: 79: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,955 INFO L290 TraceCheckUtils]: 80: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,956 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-15 06:14:51,956 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-15 06:14:51,956 INFO L290 TraceCheckUtils]: 83: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,956 INFO L290 TraceCheckUtils]: 84: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,956 INFO L290 TraceCheckUtils]: 85: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,956 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-15 06:14:51,956 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-15 06:14:51,956 INFO L290 TraceCheckUtils]: 88: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,956 INFO L290 TraceCheckUtils]: 89: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,957 INFO L290 TraceCheckUtils]: 90: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,971 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-15 06:14:51,972 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-15 06:14:51,972 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-15 06:14:51,973 INFO L290 TraceCheckUtils]: 94: Hoare triple {55260#(<= main_~r~0 main_~j~0)} assume ~j~0 < ~r~0; {55195#false} is VALID [2022-04-15 06:14:51,973 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-15 06:14:51,973 INFO L290 TraceCheckUtils]: 96: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,973 INFO L290 TraceCheckUtils]: 97: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,973 INFO L290 TraceCheckUtils]: 98: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,973 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {55194#true} {55195#false} #110#return; {55195#false} is VALID [2022-04-15 06:14:51,973 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-15 06:14:51,973 INFO L290 TraceCheckUtils]: 101: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,973 INFO L290 TraceCheckUtils]: 102: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,973 INFO L290 TraceCheckUtils]: 103: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,973 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {55194#true} {55195#false} #112#return; {55195#false} is VALID [2022-04-15 06:14:51,973 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-15 06:14:51,973 INFO L290 TraceCheckUtils]: 106: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,973 INFO L290 TraceCheckUtils]: 107: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,974 INFO L290 TraceCheckUtils]: 108: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,974 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {55194#true} {55195#false} #114#return; {55195#false} is VALID [2022-04-15 06:14:51,974 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-15 06:14:51,974 INFO L290 TraceCheckUtils]: 111: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,974 INFO L290 TraceCheckUtils]: 112: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,974 INFO L290 TraceCheckUtils]: 113: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,974 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {55194#true} {55195#false} #116#return; {55195#false} is VALID [2022-04-15 06:14:51,974 INFO L290 TraceCheckUtils]: 115: Hoare triple {55195#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {55195#false} is VALID [2022-04-15 06:14:51,974 INFO L290 TraceCheckUtils]: 116: Hoare triple {55195#false} assume !(0 != #t~nondet4);havoc #t~nondet4; {55195#false} is VALID [2022-04-15 06:14:51,974 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-15 06:14:51,974 INFO L290 TraceCheckUtils]: 118: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,974 INFO L290 TraceCheckUtils]: 119: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,974 INFO L290 TraceCheckUtils]: 120: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,974 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-15 06:14:51,975 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-15 06:14:51,975 INFO L290 TraceCheckUtils]: 123: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,975 INFO L290 TraceCheckUtils]: 124: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,975 INFO L290 TraceCheckUtils]: 125: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,975 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-15 06:14:51,975 INFO L290 TraceCheckUtils]: 127: Hoare triple {55195#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55195#false} is VALID [2022-04-15 06:14:51,975 INFO L290 TraceCheckUtils]: 128: Hoare triple {55195#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {55195#false} is VALID [2022-04-15 06:14:51,975 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-15 06:14:51,975 INFO L290 TraceCheckUtils]: 130: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,975 INFO L290 TraceCheckUtils]: 131: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,975 INFO L290 TraceCheckUtils]: 132: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,975 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-15 06:14:51,975 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-15 06:14:51,975 INFO L290 TraceCheckUtils]: 135: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,975 INFO L290 TraceCheckUtils]: 136: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,976 INFO L290 TraceCheckUtils]: 137: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,976 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {55194#true} {55195#false} #124#return; {55195#false} is VALID [2022-04-15 06:14:51,976 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-15 06:14:51,976 INFO L290 TraceCheckUtils]: 140: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,976 INFO L290 TraceCheckUtils]: 141: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,976 INFO L290 TraceCheckUtils]: 142: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,976 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {55194#true} {55195#false} #126#return; {55195#false} is VALID [2022-04-15 06:14:51,976 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-15 06:14:51,976 INFO L290 TraceCheckUtils]: 145: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,976 INFO L290 TraceCheckUtils]: 146: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,976 INFO L290 TraceCheckUtils]: 147: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,976 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {55194#true} {55195#false} #128#return; {55195#false} is VALID [2022-04-15 06:14:51,976 INFO L290 TraceCheckUtils]: 149: Hoare triple {55195#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {55195#false} is VALID [2022-04-15 06:14:51,976 INFO L290 TraceCheckUtils]: 150: Hoare triple {55195#false} assume !!(~j~0 <= ~r~0); {55195#false} is VALID [2022-04-15 06:14:51,976 INFO L290 TraceCheckUtils]: 151: Hoare triple {55195#false} assume !(~j~0 < ~r~0); {55195#false} is VALID [2022-04-15 06:14:51,977 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-15 06:14:51,977 INFO L290 TraceCheckUtils]: 153: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,977 INFO L290 TraceCheckUtils]: 154: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,977 INFO L290 TraceCheckUtils]: 155: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,977 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-15 06:14:51,977 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-15 06:14:51,977 INFO L290 TraceCheckUtils]: 158: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,977 INFO L290 TraceCheckUtils]: 159: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,977 INFO L290 TraceCheckUtils]: 160: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,977 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-15 06:14:51,977 INFO L290 TraceCheckUtils]: 162: Hoare triple {55195#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55195#false} is VALID [2022-04-15 06:14:51,977 INFO L290 TraceCheckUtils]: 163: Hoare triple {55195#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {55195#false} is VALID [2022-04-15 06:14:51,977 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-15 06:14:51,977 INFO L290 TraceCheckUtils]: 165: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:51,977 INFO L290 TraceCheckUtils]: 166: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:51,978 INFO L290 TraceCheckUtils]: 167: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:51,978 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-15 06:14:51,978 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-15 06:14:51,978 INFO L290 TraceCheckUtils]: 170: Hoare triple {55195#false} ~cond := #in~cond; {55195#false} is VALID [2022-04-15 06:14:51,978 INFO L290 TraceCheckUtils]: 171: Hoare triple {55195#false} assume 0 == ~cond; {55195#false} is VALID [2022-04-15 06:14:51,978 INFO L290 TraceCheckUtils]: 172: Hoare triple {55195#false} assume !false; {55195#false} is VALID [2022-04-15 06:14:51,978 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-15 06:14:51,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:51,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21896096] [2022-04-15 06:14:51,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21896096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:51,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043556927] [2022-04-15 06:14:51,979 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:14:51,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:51,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:51,983 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-15 06:14:51,991 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-15 06:14:52,073 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 06:14:52,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:14:52,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:14:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:52,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:53,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {55194#true} call ULTIMATE.init(); {55194#true} is VALID [2022-04-15 06:14:53,428 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-15 06:14:53,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-15 06:14:53,428 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-15 06:14:53,428 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-15 06:14:53,428 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-15 06:14:53,432 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-15 06:14:53,432 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-15 06:14:53,432 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-15 06:14:53,433 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-15 06:14:53,433 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-15 06:14:53,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,433 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-15 06:14:53,433 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-15 06:14:53,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,434 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-15 06:14:53,434 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-15 06:14:53,435 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-15 06:14:53,435 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-15 06:14:53,435 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-15 06:14:53,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,436 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-15 06:14:53,436 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-15 06:14:53,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,436 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-15 06:14:53,437 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-15 06:14:53,437 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-15 06:14:53,437 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-15 06:14:53,438 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-15 06:14:53,438 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-15 06:14:53,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,440 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-15 06:14:53,440 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-15 06:14:53,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,441 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-15 06:14:53,441 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-15 06:14:53,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,441 INFO L290 TraceCheckUtils]: 50: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,441 INFO L290 TraceCheckUtils]: 51: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,441 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-15 06:14:53,441 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-15 06:14:53,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,442 INFO L290 TraceCheckUtils]: 55: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,444 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-15 06:14:53,444 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-15 06:14:53,444 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-15 06:14:53,444 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-15 06:14:53,444 INFO L290 TraceCheckUtils]: 61: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,445 INFO L290 TraceCheckUtils]: 62: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,445 INFO L290 TraceCheckUtils]: 63: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,445 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-15 06:14:53,445 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-15 06:14:53,445 INFO L290 TraceCheckUtils]: 66: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,445 INFO L290 TraceCheckUtils]: 67: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,445 INFO L290 TraceCheckUtils]: 68: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,446 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-15 06:14:53,446 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-15 06:14:53,446 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-15 06:14:53,447 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-15 06:14:53,447 INFO L290 TraceCheckUtils]: 73: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,447 INFO L290 TraceCheckUtils]: 74: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,447 INFO L290 TraceCheckUtils]: 75: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,447 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-15 06:14:53,447 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-15 06:14:53,447 INFO L290 TraceCheckUtils]: 78: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,447 INFO L290 TraceCheckUtils]: 79: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,448 INFO L290 TraceCheckUtils]: 80: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,448 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-15 06:14:53,448 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-15 06:14:53,448 INFO L290 TraceCheckUtils]: 83: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,448 INFO L290 TraceCheckUtils]: 84: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,448 INFO L290 TraceCheckUtils]: 85: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,449 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-15 06:14:53,449 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-15 06:14:53,449 INFO L290 TraceCheckUtils]: 88: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,449 INFO L290 TraceCheckUtils]: 89: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,449 INFO L290 TraceCheckUtils]: 90: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,449 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-15 06:14:53,450 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-15 06:14:53,450 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-15 06:14:53,450 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-15 06:14:53,450 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-15 06:14:53,451 INFO L290 TraceCheckUtils]: 96: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,451 INFO L290 TraceCheckUtils]: 97: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,451 INFO L290 TraceCheckUtils]: 98: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,451 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-15 06:14:53,451 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-15 06:14:53,451 INFO L290 TraceCheckUtils]: 101: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,451 INFO L290 TraceCheckUtils]: 102: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,451 INFO L290 TraceCheckUtils]: 103: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,452 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-15 06:14:53,452 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-15 06:14:53,452 INFO L290 TraceCheckUtils]: 106: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,452 INFO L290 TraceCheckUtils]: 107: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,452 INFO L290 TraceCheckUtils]: 108: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,453 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-15 06:14:53,453 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-15 06:14:53,453 INFO L290 TraceCheckUtils]: 111: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,453 INFO L290 TraceCheckUtils]: 112: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,453 INFO L290 TraceCheckUtils]: 113: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,453 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-15 06:14:53,454 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-15 06:14:53,454 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-15 06:14:53,454 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-15 06:14:53,454 INFO L290 TraceCheckUtils]: 118: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,454 INFO L290 TraceCheckUtils]: 119: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,454 INFO L290 TraceCheckUtils]: 120: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,455 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-15 06:14:53,455 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-15 06:14:53,455 INFO L290 TraceCheckUtils]: 123: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,455 INFO L290 TraceCheckUtils]: 124: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,455 INFO L290 TraceCheckUtils]: 125: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,455 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-15 06:14:53,456 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-15 06:14:53,456 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-15 06:14:53,456 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-15 06:14:53,456 INFO L290 TraceCheckUtils]: 130: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,456 INFO L290 TraceCheckUtils]: 131: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,456 INFO L290 TraceCheckUtils]: 132: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,457 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-15 06:14:53,457 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-15 06:14:53,457 INFO L290 TraceCheckUtils]: 135: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,457 INFO L290 TraceCheckUtils]: 136: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,457 INFO L290 TraceCheckUtils]: 137: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,458 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-15 06:14:53,458 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-15 06:14:53,458 INFO L290 TraceCheckUtils]: 140: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,458 INFO L290 TraceCheckUtils]: 141: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,458 INFO L290 TraceCheckUtils]: 142: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,458 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-15 06:14:53,458 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-15 06:14:53,458 INFO L290 TraceCheckUtils]: 145: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,458 INFO L290 TraceCheckUtils]: 146: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,459 INFO L290 TraceCheckUtils]: 147: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,459 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-15 06:14:53,460 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-15 06:14:53,460 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-15 06:14:53,460 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-15 06:14:53,461 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-15 06:14:53,461 INFO L290 TraceCheckUtils]: 153: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,461 INFO L290 TraceCheckUtils]: 154: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,461 INFO L290 TraceCheckUtils]: 155: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,461 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-15 06:14:53,461 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-15 06:14:53,461 INFO L290 TraceCheckUtils]: 158: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,461 INFO L290 TraceCheckUtils]: 159: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,462 INFO L290 TraceCheckUtils]: 160: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,462 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-15 06:14:53,462 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-15 06:14:53,463 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-15 06:14:53,463 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-15 06:14:53,463 INFO L290 TraceCheckUtils]: 165: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:53,463 INFO L290 TraceCheckUtils]: 166: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:53,463 INFO L290 TraceCheckUtils]: 167: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:53,464 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-15 06:14:53,464 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-15 06:14:53,465 INFO L290 TraceCheckUtils]: 170: Hoare triple {55828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {55832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:14:53,465 INFO L290 TraceCheckUtils]: 171: Hoare triple {55832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {55195#false} is VALID [2022-04-15 06:14:53,465 INFO L290 TraceCheckUtils]: 172: Hoare triple {55195#false} assume !false; {55195#false} is VALID [2022-04-15 06:14:53,466 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-15 06:14:53,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:54,336 INFO L290 TraceCheckUtils]: 172: Hoare triple {55195#false} assume !false; {55195#false} is VALID [2022-04-15 06:14:54,336 INFO L290 TraceCheckUtils]: 171: Hoare triple {55832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {55195#false} is VALID [2022-04-15 06:14:54,337 INFO L290 TraceCheckUtils]: 170: Hoare triple {55828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {55832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:14:54,337 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-15 06:14:54,338 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-15 06:14:54,338 INFO L290 TraceCheckUtils]: 167: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,338 INFO L290 TraceCheckUtils]: 166: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,338 INFO L290 TraceCheckUtils]: 165: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,338 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-15 06:14:54,338 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-15 06:14:54,338 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-15 06:14:54,339 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-15 06:14:54,339 INFO L290 TraceCheckUtils]: 160: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,339 INFO L290 TraceCheckUtils]: 159: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,339 INFO L290 TraceCheckUtils]: 158: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,339 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-15 06:14:54,340 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-15 06:14:54,340 INFO L290 TraceCheckUtils]: 155: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,340 INFO L290 TraceCheckUtils]: 154: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,340 INFO L290 TraceCheckUtils]: 153: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,340 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-15 06:14:54,340 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-15 06:14:54,340 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-15 06:14:54,341 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-15 06:14:54,342 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-15 06:14:54,342 INFO L290 TraceCheckUtils]: 147: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,342 INFO L290 TraceCheckUtils]: 146: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,342 INFO L290 TraceCheckUtils]: 145: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,342 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-15 06:14:54,342 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-15 06:14:54,342 INFO L290 TraceCheckUtils]: 142: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,342 INFO L290 TraceCheckUtils]: 141: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,343 INFO L290 TraceCheckUtils]: 140: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,343 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-15 06:14:54,343 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-15 06:14:54,343 INFO L290 TraceCheckUtils]: 137: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,343 INFO L290 TraceCheckUtils]: 136: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,343 INFO L290 TraceCheckUtils]: 135: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,343 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-15 06:14:54,344 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-15 06:14:54,344 INFO L290 TraceCheckUtils]: 132: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,344 INFO L290 TraceCheckUtils]: 131: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,344 INFO L290 TraceCheckUtils]: 130: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,344 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-15 06:14:54,344 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-15 06:14:54,345 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-15 06:14:54,345 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-15 06:14:54,345 INFO L290 TraceCheckUtils]: 125: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,345 INFO L290 TraceCheckUtils]: 124: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,345 INFO L290 TraceCheckUtils]: 123: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,345 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-15 06:14:54,346 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-15 06:14:54,346 INFO L290 TraceCheckUtils]: 120: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,346 INFO L290 TraceCheckUtils]: 119: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,346 INFO L290 TraceCheckUtils]: 118: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,346 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-15 06:14:54,346 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-15 06:14:54,347 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-15 06:14:54,347 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-15 06:14:54,347 INFO L290 TraceCheckUtils]: 113: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,347 INFO L290 TraceCheckUtils]: 112: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,347 INFO L290 TraceCheckUtils]: 111: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,347 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-15 06:14:54,348 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-15 06:14:54,348 INFO L290 TraceCheckUtils]: 108: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,348 INFO L290 TraceCheckUtils]: 107: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,348 INFO L290 TraceCheckUtils]: 106: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,348 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-15 06:14:54,348 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-15 06:14:54,349 INFO L290 TraceCheckUtils]: 103: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,349 INFO L290 TraceCheckUtils]: 102: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,349 INFO L290 TraceCheckUtils]: 101: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,349 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-15 06:14:54,349 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-15 06:14:54,349 INFO L290 TraceCheckUtils]: 98: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,349 INFO L290 TraceCheckUtils]: 97: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,349 INFO L290 TraceCheckUtils]: 96: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,349 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-15 06:14:54,350 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-15 06:14:54,350 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-15 06:14:54,350 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-15 06:14:54,351 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-15 06:14:54,351 INFO L290 TraceCheckUtils]: 90: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,351 INFO L290 TraceCheckUtils]: 89: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,351 INFO L290 TraceCheckUtils]: 88: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,351 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-15 06:14:54,351 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-15 06:14:54,352 INFO L290 TraceCheckUtils]: 85: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,352 INFO L290 TraceCheckUtils]: 84: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,352 INFO L290 TraceCheckUtils]: 83: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,352 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-15 06:14:54,352 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-15 06:14:54,352 INFO L290 TraceCheckUtils]: 80: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,352 INFO L290 TraceCheckUtils]: 79: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,352 INFO L290 TraceCheckUtils]: 78: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,352 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-15 06:14:54,353 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-15 06:14:54,353 INFO L290 TraceCheckUtils]: 75: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,353 INFO L290 TraceCheckUtils]: 74: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,353 INFO L290 TraceCheckUtils]: 73: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,353 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-15 06:14:54,353 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-15 06:14:54,354 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-15 06:14:54,354 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-15 06:14:54,354 INFO L290 TraceCheckUtils]: 68: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,354 INFO L290 TraceCheckUtils]: 67: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,354 INFO L290 TraceCheckUtils]: 66: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,354 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-15 06:14:54,355 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-15 06:14:54,355 INFO L290 TraceCheckUtils]: 63: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,355 INFO L290 TraceCheckUtils]: 62: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,355 INFO L290 TraceCheckUtils]: 61: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,355 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-15 06:14:54,355 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-15 06:14:54,356 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-15 06:14:54,356 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-15 06:14:54,356 INFO L290 TraceCheckUtils]: 56: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,356 INFO L290 TraceCheckUtils]: 55: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,356 INFO L290 TraceCheckUtils]: 54: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,356 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-15 06:14:54,357 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-15 06:14:54,357 INFO L290 TraceCheckUtils]: 51: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,357 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-15 06:14:54,358 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-15 06:14:54,358 INFO L290 TraceCheckUtils]: 46: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,358 INFO L290 TraceCheckUtils]: 45: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,358 INFO L290 TraceCheckUtils]: 44: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,358 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-15 06:14:54,358 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-15 06:14:54,358 INFO L290 TraceCheckUtils]: 41: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,359 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-15 06:14:54,359 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-15 06:14:54,359 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-15 06:14:54,360 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-15 06:14:54,360 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-15 06:14:54,360 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-15 06:14:54,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,361 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-15 06:14:54,361 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-15 06:14:54,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,361 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-15 06:14:54,362 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-15 06:14:54,362 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-15 06:14:54,362 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-15 06:14:54,363 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-15 06:14:54,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,363 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-15 06:14:54,364 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-15 06:14:54,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-15 06:14:54,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-15 06:14:54,364 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-15 06:14:54,364 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-15 06:14:54,365 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-15 06:14:54,365 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-15 06:14:54,365 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-15 06:14:54,366 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-15 06:14:54,366 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-15 06:14:54,366 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-15 06:14:54,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-15 06:14:54,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-15 06:14:54,367 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-15 06:14:54,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {55194#true} call ULTIMATE.init(); {55194#true} is VALID [2022-04-15 06:14:54,368 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-15 06:14:54,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043556927] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:54,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:54,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-04-15 06:14:54,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:54,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1828856294] [2022-04-15 06:14:54,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1828856294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:54,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:54,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:14:54,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015912148] [2022-04-15 06:14:54,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:54,372 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-15 06:14:54,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:54,372 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-15 06:14:54,434 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-15 06:14:54,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:14:54,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:54,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:14:54,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:14:54,436 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-15 06:14:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:57,105 INFO L93 Difference]: Finished difference Result 318 states and 407 transitions. [2022-04-15 06:14:57,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:14:57,105 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-15 06:14:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:57,106 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-15 06:14:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2022-04-15 06:14:57,108 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-15 06:14:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2022-04-15 06:14:57,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 173 transitions. [2022-04-15 06:14:57,262 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-15 06:14:57,262 INFO L225 Difference]: With dead ends: 318 [2022-04-15 06:14:57,262 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 06:14:57,263 INFO L912 BasicCegarLoop]: 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-15 06:14:57,264 INFO L913 BasicCegarLoop]: 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-15 06:14:57,264 INFO L914 BasicCegarLoop]: 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-15 06:14:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 06:14:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 06:14:57,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:57,264 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-15 06:14:57,264 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-15 06:14:57,264 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-15 06:14:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:57,265 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:14:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:14:57,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:57,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:57,287 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-15 06:14:57,287 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-15 06:14:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:57,287 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:14:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:14:57,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:57,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:57,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:57,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:57,288 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-15 06:14:57,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 06:14:57,288 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2022-04-15 06:14:57,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:57,288 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 06:14:57,288 INFO L479 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-15 06:14:57,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 06:14:57,288 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-15 06:14:57,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:14:57,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:57,292 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 06:14:57,335 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-15 06:14:57,507 WARN L460 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-15 06:14:57,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 06:16:31,937 WARN L232 SmtUtils]: Spent 1.57m 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)