/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:28:19,709 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:28:19,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:28:19,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:28:19,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:28:19,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:28:19,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:28:19,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:28:19,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:28:19,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:28:19,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:28:19,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:28:19,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:28:19,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:28:19,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:28:19,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:28:19,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:28:19,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:28:19,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:28:19,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:28:19,741 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:28:19,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:28:19,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:28:19,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:28:19,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:28:19,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:28:19,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:28:19,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:28:19,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:28:19,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:28:19,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:28:19,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:28:19,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:28:19,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:28:19,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:28:19,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:28:19,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:28:19,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:28:19,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:28:19,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:28:19,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:28:19,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:28:19,750 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:28:19,756 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:28:19,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:28:19,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:28:19,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:28:19,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:28:19,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:28:19,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:28:19,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:28:19,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:28:19,757 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:28:19,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:28:19,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:28:19,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:28:19,758 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:28:19,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:28:19,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:28:19,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:28:19,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:28:19,758 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:28:19,758 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:28:19,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:28:19,759 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:28:19,759 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-08 09:28:19,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:28:19,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:28:19,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:28:19,972 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:28:19,974 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:28:19,975 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-08 09:28:20,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0420436a4/581f21e47f014d1e858454a741ad420a/FLAG2f0377d16 [2022-04-08 09:28:20,411 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:28:20,411 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2022-04-08 09:28:20,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0420436a4/581f21e47f014d1e858454a741ad420a/FLAG2f0377d16 [2022-04-08 09:28:20,431 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0420436a4/581f21e47f014d1e858454a741ad420a [2022-04-08 09:28:20,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:28:20,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:28:20,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:28:20,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:28:20,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:28:20,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:28:20" (1/1) ... [2022-04-08 09:28:20,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc1eac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:28:20, skipping insertion in model container [2022-04-08 09:28:20,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:28:20" (1/1) ... [2022-04-08 09:28:20,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:28:20,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:28:20,626 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-08 09:28:20,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:28:20,667 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:28:20,678 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-08 09:28:20,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:28:20,701 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:28:20,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:28:20 WrapperNode [2022-04-08 09:28:20,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:28:20,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:28:20,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:28:20,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:28:20,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:28:20" (1/1) ... [2022-04-08 09:28:20,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:28:20" (1/1) ... [2022-04-08 09:28:20,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:28:20" (1/1) ... [2022-04-08 09:28:20,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:28:20" (1/1) ... [2022-04-08 09:28:20,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:28:20" (1/1) ... [2022-04-08 09:28:20,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:28:20" (1/1) ... [2022-04-08 09:28:20,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:28:20" (1/1) ... [2022-04-08 09:28:20,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:28:20,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:28:20,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:28:20,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:28:20,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:28:20" (1/1) ... [2022-04-08 09:28:20,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:28:20,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:28:20,753 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-08 09:28:20,765 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-08 09:28:20,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:28:20,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:28:20,777 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:28:20,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:28:20,777 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:28:20,777 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:28:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:28:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:28:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:28:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:28:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:28:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:28:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:28:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:28:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:28:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:28:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:28:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:28:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:28:20,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:28:20,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:28:20,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:28:20,828 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:28:20,829 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:28:21,050 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:28:21,054 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:28:21,055 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 09:28:21,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:28:21 BoogieIcfgContainer [2022-04-08 09:28:21,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:28:21,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:28:21,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:28:21,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:28:21,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:28:20" (1/3) ... [2022-04-08 09:28:21,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6242f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:28:21, skipping insertion in model container [2022-04-08 09:28:21,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:28:20" (2/3) ... [2022-04-08 09:28:21,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6242f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:28:21, skipping insertion in model container [2022-04-08 09:28:21,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:28:21" (3/3) ... [2022-04-08 09:28:21,079 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2022-04-08 09:28:21,084 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:28:21,085 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:28:21,123 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:28:21,129 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-08 09:28:21,129 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:28:21,147 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-08 09:28:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:28:21,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:28:21,152 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:28:21,152 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:28:21,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:28:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash -250128701, now seen corresponding path program 1 times [2022-04-08 09:28:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:21,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2025601416] [2022-04-08 09:28:21,172 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:28:21,173 INFO L85 PathProgramCache]: Analyzing trace with hash -250128701, now seen corresponding path program 2 times [2022-04-08 09:28:21,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:28:21,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789033169] [2022-04-08 09:28:21,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:28:21,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:28:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:21,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:28:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:21,418 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-08 09:28:21,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2022-04-08 09:28:21,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #138#return; {47#true} is VALID [2022-04-08 09:28:21,420 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-08 09:28:21,421 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-08 09:28:21,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2022-04-08 09:28:21,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #138#return; {47#true} is VALID [2022-04-08 09:28:21,421 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-08 09:28:21,421 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-08 09:28:21,421 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-08 09:28:21,422 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-08 09:28:21,422 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-08 09:28:21,423 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-08 09:28:21,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {52#(<= 1 main_~r~0)} assume !(~l~0 > 1); {52#(<= 1 main_~r~0)} is VALID [2022-04-08 09:28:21,424 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-08 09:28:21,425 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-08 09:28:21,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {54#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {48#false} is VALID [2022-04-08 09:28:21,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {48#false} assume !false; {48#false} is VALID [2022-04-08 09:28:21,425 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-08 09:28:21,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:28:21,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789033169] [2022-04-08 09:28:21,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789033169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:21,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:21,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:28:21,428 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:28:21,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2025601416] [2022-04-08 09:28:21,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2025601416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:21,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:21,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:28:21,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795854157] [2022-04-08 09:28:21,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:28:21,433 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-08 09:28:21,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:28:21,436 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-08 09:28:21,455 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-08 09:28:21,455 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:28:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:21,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:28:21,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:28:21,478 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-08 09:28:22,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:22,120 INFO L93 Difference]: Finished difference Result 88 states and 148 transitions. [2022-04-08 09:28:22,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:28:22,121 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-08 09:28:22,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:28:22,122 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-08 09:28:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-08 09:28:22,141 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-08 09:28:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-08 09:28:22,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 148 transitions. [2022-04-08 09:28:22,278 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-08 09:28:22,285 INFO L225 Difference]: With dead ends: 88 [2022-04-08 09:28:22,285 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 09:28:22,287 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-08 09:28:22,289 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-08 09:28:22,290 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-08 09:28:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 09:28:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-08 09:28:22,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:28:22,331 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-08 09:28:22,332 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-08 09:28:22,332 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-08 09:28:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:22,336 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-04-08 09:28:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-08 09:28:22,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:22,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:22,337 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-08 09:28:22,337 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-08 09:28:22,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:22,341 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-04-08 09:28:22,341 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-08 09:28:22,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:22,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:22,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:28:22,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:28:22,342 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-08 09:28:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-08 09:28:22,345 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 15 [2022-04-08 09:28:22,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:28:22,345 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-08 09:28:22,346 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-08 09:28:22,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 61 transitions. [2022-04-08 09:28:22,393 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-08 09:28:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-08 09:28:22,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:28:22,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:28:22,394 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:28:22,394 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:28:22,394 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:28:22,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:28:22,395 INFO L85 PathProgramCache]: Analyzing trace with hash -254865470, now seen corresponding path program 1 times [2022-04-08 09:28:22,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:22,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [102185430] [2022-04-08 09:28:22,395 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:28:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash -254865470, now seen corresponding path program 2 times [2022-04-08 09:28:22,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:28:22,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018877433] [2022-04-08 09:28:22,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:28:22,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:28:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:22,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:28:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:22,487 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-08 09:28:22,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 09:28:22,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {417#true} {417#true} #138#return; {417#true} is VALID [2022-04-08 09:28:22,493 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-08 09:28:22,493 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-08 09:28:22,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 09:28:22,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #138#return; {417#true} is VALID [2022-04-08 09:28:22,494 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-08 09:28:22,494 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-08 09:28:22,494 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-08 09:28:22,494 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-08 09:28:22,494 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-08 09:28:22,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#true} assume !(~j~0 <= ~r~0); {417#true} is VALID [2022-04-08 09:28:22,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {417#true} assume ~l~0 > 1; {422#(<= 1 main_~l~0)} is VALID [2022-04-08 09:28:22,497 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-08 09:28:22,498 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-08 09:28:22,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {418#false} is VALID [2022-04-08 09:28:22,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-08 09:28:22,498 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-08 09:28:22,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:28:22,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018877433] [2022-04-08 09:28:22,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018877433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:22,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:22,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:28:22,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:28:22,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [102185430] [2022-04-08 09:28:22,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [102185430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:22,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:22,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:28:22,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623716057] [2022-04-08 09:28:22,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:28:22,500 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-08 09:28:22,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:28:22,500 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-08 09:28:22,511 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-08 09:28:22,511 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:28:22,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:22,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:28:22,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:28:22,512 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-08 09:28:23,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:23,145 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2022-04-08 09:28:23,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:28:23,146 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-08 09:28:23,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:28:23,146 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-08 09:28:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-08 09:28:23,148 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-08 09:28:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-08 09:28:23,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 102 transitions. [2022-04-08 09:28:23,244 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-08 09:28:23,246 INFO L225 Difference]: With dead ends: 71 [2022-04-08 09:28:23,246 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 09:28:23,247 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-08 09:28:23,249 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-08 09:28:23,250 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-08 09:28:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 09:28:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2022-04-08 09:28:23,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:28:23,277 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-08 09:28:23,278 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-08 09:28:23,278 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-08 09:28:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:23,282 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2022-04-08 09:28:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2022-04-08 09:28:23,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:23,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:23,284 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-08 09:28:23,284 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-08 09:28:23,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:23,287 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2022-04-08 09:28:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2022-04-08 09:28:23,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:23,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:23,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:28:23,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:28:23,289 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-08 09:28:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-08 09:28:23,291 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 15 [2022-04-08 09:28:23,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:28:23,291 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-08 09:28:23,291 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-08 09:28:23,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 64 transitions. [2022-04-08 09:28:23,359 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-08 09:28:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-08 09:28:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:28:23,360 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:28:23,360 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:28:23,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:28:23,360 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:28:23,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:28:23,360 INFO L85 PathProgramCache]: Analyzing trace with hash -216435080, now seen corresponding path program 1 times [2022-04-08 09:28:23,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:23,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1993709783] [2022-04-08 09:28:23,361 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:28:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash -216435080, now seen corresponding path program 2 times [2022-04-08 09:28:23,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:28:23,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573644875] [2022-04-08 09:28:23,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:28:23,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:28:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:23,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:28:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:23,449 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-08 09:28:23,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {811#true} assume true; {811#true} is VALID [2022-04-08 09:28:23,451 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {811#true} {811#true} #138#return; {811#true} is VALID [2022-04-08 09:28:23,451 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-08 09:28:23,455 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-08 09:28:23,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {811#true} assume true; {811#true} is VALID [2022-04-08 09:28:23,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {811#true} {811#true} #138#return; {811#true} is VALID [2022-04-08 09:28:23,456 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-08 09:28:23,456 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-08 09:28:23,456 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-08 09:28:23,456 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-08 09:28:23,458 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-08 09:28:23,458 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-08 09:28:23,461 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-08 09:28:23,462 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-08 09:28:23,463 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-08 09:28:23,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {819#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {812#false} is VALID [2022-04-08 09:28:23,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {812#false} assume !false; {812#false} is VALID [2022-04-08 09:28:23,465 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-08 09:28:23,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:28:23,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573644875] [2022-04-08 09:28:23,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573644875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:23,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:23,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:28:23,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:28:23,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1993709783] [2022-04-08 09:28:23,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1993709783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:23,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:23,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:28:23,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336761912] [2022-04-08 09:28:23,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:28:23,467 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-08 09:28:23,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:28:23,467 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-08 09:28:23,493 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-08 09:28:23,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:28:23,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:23,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:28:23,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:28:23,495 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-08 09:28:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:24,317 INFO L93 Difference]: Finished difference Result 80 states and 115 transitions. [2022-04-08 09:28:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:28:24,317 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-08 09:28:24,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:28:24,317 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-08 09:28:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-08 09:28:24,319 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-08 09:28:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-08 09:28:24,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2022-04-08 09:28:24,410 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-08 09:28:24,412 INFO L225 Difference]: With dead ends: 80 [2022-04-08 09:28:24,412 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 09:28:24,412 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-08 09:28:24,413 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:28:24,413 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.3s Time] [2022-04-08 09:28:24,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 09:28:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2022-04-08 09:28:24,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:28:24,481 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-08 09:28:24,482 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-08 09:28:24,482 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-08 09:28:24,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:24,500 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2022-04-08 09:28:24,500 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2022-04-08 09:28:24,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:24,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:24,501 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-08 09:28:24,502 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-08 09:28:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:24,505 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2022-04-08 09:28:24,505 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2022-04-08 09:28:24,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:24,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:24,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:28:24,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:28:24,506 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-08 09:28:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2022-04-08 09:28:24,508 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 15 [2022-04-08 09:28:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:28:24,508 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2022-04-08 09:28:24,509 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-08 09:28:24,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 98 transitions. [2022-04-08 09:28:24,595 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-08 09:28:24,595 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2022-04-08 09:28:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:28:24,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:28:24,596 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:28:24,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 09:28:24,596 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:28:24,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:28:24,596 INFO L85 PathProgramCache]: Analyzing trace with hash -228679181, now seen corresponding path program 1 times [2022-04-08 09:28:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:24,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [552152980] [2022-04-08 09:28:24,597 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:28:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash -228679181, now seen corresponding path program 2 times [2022-04-08 09:28:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:28:24,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039629106] [2022-04-08 09:28:24,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:28:24,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:28:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:24,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:28:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:24,646 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-08 09:28:24,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {1287#true} assume true; {1287#true} is VALID [2022-04-08 09:28:24,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1287#true} {1287#true} #138#return; {1287#true} is VALID [2022-04-08 09:28:24,647 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-08 09:28:24,647 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-08 09:28:24,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {1287#true} assume true; {1287#true} is VALID [2022-04-08 09:28:24,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1287#true} {1287#true} #138#return; {1287#true} is VALID [2022-04-08 09:28:24,647 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-08 09:28:24,647 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-08 09:28:24,647 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-08 09:28:24,648 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-08 09:28:24,648 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-08 09:28:24,648 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-08 09:28:24,649 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-08 09:28:24,649 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-08 09:28:24,650 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-08 09:28:24,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {1295#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1288#false} is VALID [2022-04-08 09:28:24,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {1288#false} assume !false; {1288#false} is VALID [2022-04-08 09:28:24,650 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-08 09:28:24,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:28:24,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039629106] [2022-04-08 09:28:24,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039629106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:24,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:24,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:28:24,651 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:28:24,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [552152980] [2022-04-08 09:28:24,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [552152980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:24,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:24,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:28:24,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851257170] [2022-04-08 09:28:24,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:28:24,652 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-08 09:28:24,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:28:24,652 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-08 09:28:24,660 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-08 09:28:24,660 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:28:24,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:24,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:28:24,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:28:24,661 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-08 09:28:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:25,525 INFO L93 Difference]: Finished difference Result 122 states and 183 transitions. [2022-04-08 09:28:25,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:28:25,525 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-08 09:28:25,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:28:25,526 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-08 09:28:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-08 09:28:25,527 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-08 09:28:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-08 09:28:25,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2022-04-08 09:28:25,615 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-08 09:28:25,618 INFO L225 Difference]: With dead ends: 122 [2022-04-08 09:28:25,618 INFO L226 Difference]: Without dead ends: 120 [2022-04-08 09:28:25,618 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:28:25,619 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 09:28:25,619 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.4s Time] [2022-04-08 09:28:25,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-08 09:28:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2022-04-08 09:28:25,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:28:25,728 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-08 09:28:25,728 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-08 09:28:25,728 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-08 09:28:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:25,733 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2022-04-08 09:28:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2022-04-08 09:28:25,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:25,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:25,734 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-08 09:28:25,735 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-08 09:28:25,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:25,739 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2022-04-08 09:28:25,739 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2022-04-08 09:28:25,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:25,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:25,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:28:25,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:28:25,741 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-08 09:28:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2022-04-08 09:28:25,744 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 15 [2022-04-08 09:28:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:28:25,744 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2022-04-08 09:28:25,744 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-08 09:28:25,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 140 transitions. [2022-04-08 09:28:25,881 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-08 09:28:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2022-04-08 09:28:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:28:25,882 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:28:25,882 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-08 09:28:25,882 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 09:28:25,883 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:28:25,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:28:25,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1266022048, now seen corresponding path program 1 times [2022-04-08 09:28:25,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:25,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1566205783] [2022-04-08 09:28:25,884 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:28:25,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1266022048, now seen corresponding path program 2 times [2022-04-08 09:28:25,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:28:25,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927910041] [2022-04-08 09:28:25,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:28:25,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:28:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:25,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:28:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:25,957 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-08 09:28:25,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-08 09:28:25,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1984#true} {1984#true} #138#return; {1984#true} is VALID [2022-04-08 09:28:25,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:28:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:25,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {1984#true} ~cond := #in~cond; {1984#true} is VALID [2022-04-08 09:28:25,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {1984#true} assume !(0 == ~cond); {1984#true} is VALID [2022-04-08 09:28:25,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-08 09:28:25,968 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-08 09:28:25,969 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-08 09:28:25,969 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-08 09:28:25,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-08 09:28:25,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1984#true} {1984#true} #138#return; {1984#true} is VALID [2022-04-08 09:28:25,969 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-08 09:28:25,970 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-08 09:28:25,970 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-08 09:28:25,971 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-08 09:28:25,971 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-08 09:28:25,971 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-08 09:28:25,972 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-08 09:28:25,972 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-08 09:28:25,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {1984#true} ~cond := #in~cond; {1984#true} is VALID [2022-04-08 09:28:25,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {1984#true} assume !(0 == ~cond); {1984#true} is VALID [2022-04-08 09:28:25,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-08 09:28:25,973 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-08 09:28:25,973 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-08 09:28:25,973 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-08 09:28:25,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {1995#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1985#false} is VALID [2022-04-08 09:28:25,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {1985#false} assume !false; {1985#false} is VALID [2022-04-08 09:28:25,974 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-08 09:28:25,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:28:25,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927910041] [2022-04-08 09:28:25,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927910041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:25,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:25,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:28:25,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:28:25,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1566205783] [2022-04-08 09:28:25,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1566205783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:25,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:25,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:28:25,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298182409] [2022-04-08 09:28:25,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:28:25,976 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-08 09:28:25,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:28:25,976 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-08 09:28:25,987 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-08 09:28:25,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:28:25,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:25,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:28:25,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:28:25,988 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-08 09:28:26,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:26,516 INFO L93 Difference]: Finished difference Result 100 states and 145 transitions. [2022-04-08 09:28:26,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:28:26,517 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-08 09:28:26,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:28:26,517 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-08 09:28:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-08 09:28:26,518 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-08 09:28:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-08 09:28:26,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-08 09:28:26,581 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-08 09:28:26,583 INFO L225 Difference]: With dead ends: 100 [2022-04-08 09:28:26,584 INFO L226 Difference]: Without dead ends: 98 [2022-04-08 09:28:26,584 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-08 09:28:26,585 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-08 09:28:26,585 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-08 09:28:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-08 09:28:26,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-04-08 09:28:26,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:28:26,727 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-08 09:28:26,727 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-08 09:28:26,728 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-08 09:28:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:26,731 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-08 09:28:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-08 09:28:26,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:26,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:26,732 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-08 09:28:26,732 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-08 09:28:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:26,735 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-08 09:28:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-08 09:28:26,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:26,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:26,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:28:26,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:28:26,736 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-08 09:28:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2022-04-08 09:28:26,739 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 20 [2022-04-08 09:28:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:28:26,740 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2022-04-08 09:28:26,740 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-08 09:28:26,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 143 transitions. [2022-04-08 09:28:26,873 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-08 09:28:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-08 09:28:26,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:28:26,874 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:28:26,874 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-08 09:28:26,874 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 09:28:26,874 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:28:26,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:28:26,874 INFO L85 PathProgramCache]: Analyzing trace with hash 884659585, now seen corresponding path program 1 times [2022-04-08 09:28:26,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:26,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1676273050] [2022-04-08 09:28:26,875 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:28:26,875 INFO L85 PathProgramCache]: Analyzing trace with hash 884659585, now seen corresponding path program 2 times [2022-04-08 09:28:26,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:28:26,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441037652] [2022-04-08 09:28:26,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:28:26,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:28:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:26,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:28:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:26,945 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-08 09:28:26,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-08 09:28:26,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2599#true} {2599#true} #138#return; {2599#true} is VALID [2022-04-08 09:28:26,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:28:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:26,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2022-04-08 09:28:26,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2022-04-08 09:28:26,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-08 09:28:26,950 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-08 09:28:26,951 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-08 09:28:26,951 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-08 09:28:26,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-08 09:28:26,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2599#true} {2599#true} #138#return; {2599#true} is VALID [2022-04-08 09:28:26,951 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-08 09:28:26,951 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-08 09:28:26,952 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-08 09:28:26,952 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-08 09:28:26,953 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-08 09:28:26,953 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-08 09:28:26,953 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-08 09:28:26,954 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-08 09:28:26,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2022-04-08 09:28:26,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2022-04-08 09:28:26,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-08 09:28:26,954 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-08 09:28:26,955 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-08 09:28:26,955 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-08 09:28:26,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {2612#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2600#false} is VALID [2022-04-08 09:28:26,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {2600#false} assume !false; {2600#false} is VALID [2022-04-08 09:28:26,956 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-08 09:28:26,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:28:26,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441037652] [2022-04-08 09:28:26,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441037652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:26,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:26,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:28:26,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:28:26,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1676273050] [2022-04-08 09:28:26,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1676273050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:26,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:26,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:28:26,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476648029] [2022-04-08 09:28:26,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:28:26,957 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-08 09:28:26,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:28:26,957 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-08 09:28:26,967 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-08 09:28:26,967 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:28:26,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:26,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:28:26,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:28:26,968 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-08 09:28:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:28,106 INFO L93 Difference]: Finished difference Result 131 states and 194 transitions. [2022-04-08 09:28:28,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:28:28,106 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-08 09:28:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:28:28,106 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-08 09:28:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-08 09:28:28,108 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-08 09:28:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-08 09:28:28,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-08 09:28:28,201 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-08 09:28:28,203 INFO L225 Difference]: With dead ends: 131 [2022-04-08 09:28:28,204 INFO L226 Difference]: Without dead ends: 129 [2022-04-08 09:28:28,204 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-08 09:28:28,204 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-08 09:28:28,205 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-08 09:28:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-08 09:28:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2022-04-08 09:28:28,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:28:28,494 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-08 09:28:28,494 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-08 09:28:28,495 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-08 09:28:28,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:28,499 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2022-04-08 09:28:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2022-04-08 09:28:28,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:28,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:28,500 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-08 09:28:28,500 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-08 09:28:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:28,504 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2022-04-08 09:28:28,504 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2022-04-08 09:28:28,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:28,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:28,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:28:28,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:28:28,505 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-08 09:28:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 189 transitions. [2022-04-08 09:28:28,509 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 189 transitions. Word has length 20 [2022-04-08 09:28:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:28:28,509 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 189 transitions. [2022-04-08 09:28:28,510 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-08 09:28:28,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 189 transitions. [2022-04-08 09:28:28,717 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-08 09:28:28,717 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 189 transitions. [2022-04-08 09:28:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:28:28,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:28:28,718 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-08 09:28:28,718 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 09:28:28,718 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:28:28,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:28:28,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1424204299, now seen corresponding path program 1 times [2022-04-08 09:28:28,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:28,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [233509190] [2022-04-08 09:28:28,719 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:28:28,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1424204299, now seen corresponding path program 2 times [2022-04-08 09:28:28,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:28:28,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089508543] [2022-04-08 09:28:28,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:28:28,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:28:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:28,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:28:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:28,807 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-08 09:28:28,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-08 09:28:28,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3400#true} {3400#true} #138#return; {3400#true} is VALID [2022-04-08 09:28:28,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:28:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:28,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {3400#true} ~cond := #in~cond; {3400#true} is VALID [2022-04-08 09:28:28,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {3400#true} assume !(0 == ~cond); {3400#true} is VALID [2022-04-08 09:28:28,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-08 09:28:28,811 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-08 09:28:28,812 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-08 09:28:28,812 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-08 09:28:28,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-08 09:28:28,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3400#true} {3400#true} #138#return; {3400#true} is VALID [2022-04-08 09:28:28,812 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-08 09:28:28,813 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-08 09:28:28,813 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-08 09:28:28,813 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-08 09:28:28,813 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-08 09:28:28,814 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-08 09:28:28,814 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-08 09:28:28,814 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-08 09:28:28,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {3400#true} ~cond := #in~cond; {3400#true} is VALID [2022-04-08 09:28:28,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {3400#true} assume !(0 == ~cond); {3400#true} is VALID [2022-04-08 09:28:28,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-08 09:28:28,815 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-08 09:28:28,815 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-08 09:28:28,816 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-08 09:28:28,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {3412#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3401#false} is VALID [2022-04-08 09:28:28,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {3401#false} assume !false; {3401#false} is VALID [2022-04-08 09:28:28,816 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-08 09:28:28,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:28:28,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089508543] [2022-04-08 09:28:28,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089508543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:28,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:28,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:28:28,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:28:28,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [233509190] [2022-04-08 09:28:28,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [233509190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:28,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:28,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:28:28,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207967795] [2022-04-08 09:28:28,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:28:28,817 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-08 09:28:28,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:28:28,817 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-08 09:28:28,827 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-08 09:28:28,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:28:28,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:28,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:28:28,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:28:28,828 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-08 09:28:29,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:29,914 INFO L93 Difference]: Finished difference Result 188 states and 291 transitions. [2022-04-08 09:28:29,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:28:29,914 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-08 09:28:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:28:29,915 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-08 09:28:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-08 09:28:29,917 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-08 09:28:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-08 09:28:29,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-08 09:28:29,995 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-08 09:28:29,999 INFO L225 Difference]: With dead ends: 188 [2022-04-08 09:28:29,999 INFO L226 Difference]: Without dead ends: 186 [2022-04-08 09:28:30,000 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-08 09:28:30,001 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-08 09:28:30,001 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-08 09:28:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-08 09:28:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2022-04-08 09:28:30,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:28:30,407 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-08 09:28:30,407 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-08 09:28:30,407 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-08 09:28:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:30,414 INFO L93 Difference]: Finished difference Result 186 states and 289 transitions. [2022-04-08 09:28:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2022-04-08 09:28:30,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:30,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:30,415 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-08 09:28:30,416 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-08 09:28:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:30,423 INFO L93 Difference]: Finished difference Result 186 states and 289 transitions. [2022-04-08 09:28:30,423 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2022-04-08 09:28:30,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:30,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:30,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:28:30,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:28:30,424 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-08 09:28:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 252 transitions. [2022-04-08 09:28:30,430 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 252 transitions. Word has length 20 [2022-04-08 09:28:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:28:30,431 INFO L478 AbstractCegarLoop]: Abstraction has 162 states and 252 transitions. [2022-04-08 09:28:30,431 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-08 09:28:30,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 162 states and 252 transitions. [2022-04-08 09:28:30,710 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-08 09:28:30,710 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 252 transitions. [2022-04-08 09:28:30,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:28:30,710 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:28:30,711 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-08 09:28:30,711 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 09:28:30,711 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:28:30,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:28:30,712 INFO L85 PathProgramCache]: Analyzing trace with hash 297853571, now seen corresponding path program 1 times [2022-04-08 09:28:30,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:30,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [231750064] [2022-04-08 09:28:30,713 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:28:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash 297853571, now seen corresponding path program 2 times [2022-04-08 09:28:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:28:30,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785058824] [2022-04-08 09:28:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:28:30,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:28:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:30,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:28:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:30,758 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-08 09:28:30,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-08 09:28:30,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4498#true} {4498#true} #138#return; {4498#true} is VALID [2022-04-08 09:28:30,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:28:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:30,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-08 09:28:30,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-08 09:28:30,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-08 09:28:30,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4498#true} {4499#false} #130#return; {4499#false} is VALID [2022-04-08 09:28:30,765 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-08 09:28:30,765 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-08 09:28:30,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-08 09:28:30,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4498#true} {4498#true} #138#return; {4498#true} is VALID [2022-04-08 09:28:30,765 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-08 09:28:30,765 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-08 09:28:30,765 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-08 09:28:30,766 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-08 09:28:30,766 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-08 09:28:30,766 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-08 09:28:30,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {4503#(<= main_~l~0 1)} assume ~l~0 > 1; {4499#false} is VALID [2022-04-08 09:28:30,766 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-08 09:28:30,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-08 09:28:30,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-08 09:28:30,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-08 09:28:30,767 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4498#true} {4499#false} #130#return; {4499#false} is VALID [2022-04-08 09:28:30,767 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-08 09:28:30,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {4499#false} ~cond := #in~cond; {4499#false} is VALID [2022-04-08 09:28:30,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {4499#false} assume 0 == ~cond; {4499#false} is VALID [2022-04-08 09:28:30,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {4499#false} assume !false; {4499#false} is VALID [2022-04-08 09:28:30,767 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-08 09:28:30,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:28:30,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785058824] [2022-04-08 09:28:30,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785058824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:30,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:30,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:28:30,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:28:30,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [231750064] [2022-04-08 09:28:30,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [231750064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:30,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:30,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:28:30,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939487400] [2022-04-08 09:28:30,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:28:30,768 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-08 09:28:30,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:28:30,769 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-08 09:28:30,780 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-08 09:28:30,781 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:28:30,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:30,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:28:30,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:28:30,782 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-08 09:28:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:31,656 INFO L93 Difference]: Finished difference Result 329 states and 524 transitions. [2022-04-08 09:28:31,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:28:31,656 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-08 09:28:31,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:28:31,657 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-08 09:28:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-08 09:28:31,658 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-08 09:28:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-08 09:28:31,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-08 09:28:31,771 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-08 09:28:31,776 INFO L225 Difference]: With dead ends: 329 [2022-04-08 09:28:31,776 INFO L226 Difference]: Without dead ends: 239 [2022-04-08 09:28:31,777 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-08 09:28:31,777 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-08 09:28:31,777 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-08 09:28:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-08 09:28:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 209. [2022-04-08 09:28:32,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:28:32,367 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-08 09:28:32,368 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-08 09:28:32,369 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-08 09:28:32,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:32,378 INFO L93 Difference]: Finished difference Result 239 states and 389 transitions. [2022-04-08 09:28:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2022-04-08 09:28:32,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:32,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:32,379 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-08 09:28:32,380 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-08 09:28:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:32,393 INFO L93 Difference]: Finished difference Result 239 states and 389 transitions. [2022-04-08 09:28:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2022-04-08 09:28:32,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:32,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:32,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:28:32,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:28:32,395 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-08 09:28:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 336 transitions. [2022-04-08 09:28:32,412 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 336 transitions. Word has length 20 [2022-04-08 09:28:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:28:32,412 INFO L478 AbstractCegarLoop]: Abstraction has 209 states and 336 transitions. [2022-04-08 09:28:32,413 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-08 09:28:32,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 209 states and 336 transitions. [2022-04-08 09:28:32,767 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-08 09:28:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 336 transitions. [2022-04-08 09:28:32,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 09:28:32,768 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:28:32,768 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-08 09:28:32,768 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 09:28:32,769 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:28:32,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:28:32,769 INFO L85 PathProgramCache]: Analyzing trace with hash 288094237, now seen corresponding path program 1 times [2022-04-08 09:28:32,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:32,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2060595246] [2022-04-08 09:28:32,769 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:28:32,769 INFO L85 PathProgramCache]: Analyzing trace with hash 288094237, now seen corresponding path program 2 times [2022-04-08 09:28:32,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:28:32,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845270811] [2022-04-08 09:28:32,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:28:32,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:28:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:32,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:28:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:32,855 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-08 09:28:32,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-08 09:28:32,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6067#true} {6067#true} #138#return; {6067#true} is VALID [2022-04-08 09:28:32,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:28:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:32,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-08 09:28:32,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-08 09:28:32,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-08 09:28:32,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #118#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-08 09:28:32,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:28:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:32,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-08 09:28:32,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-08 09:28:32,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-08 09:28:32,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #120#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-08 09:28:32,863 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-08 09:28:32,863 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-08 09:28:32,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-08 09:28:32,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6067#true} #138#return; {6067#true} is VALID [2022-04-08 09:28:32,864 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-08 09:28:32,864 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-08 09:28:32,864 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-08 09:28:32,864 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-08 09:28:32,864 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-08 09:28:32,865 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-08 09:28:32,865 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-08 09:28:32,865 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-08 09:28:32,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-08 09:28:32,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-08 09:28:32,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-08 09:28:32,866 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #118#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-08 09:28:32,866 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-08 09:28:32,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-08 09:28:32,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-08 09:28:32,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-08 09:28:32,866 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #120#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-08 09:28:32,867 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-08 09:28:32,867 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-08 09:28:32,867 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-08 09:28:32,868 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-08 09:28:32,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {6083#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6068#false} is VALID [2022-04-08 09:28:32,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {6068#false} assume !false; {6068#false} is VALID [2022-04-08 09:28:32,868 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-08 09:28:32,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:28:32,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845270811] [2022-04-08 09:28:32,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845270811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:32,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:32,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:28:32,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:28:32,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2060595246] [2022-04-08 09:28:32,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2060595246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:32,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:32,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:28:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430207040] [2022-04-08 09:28:32,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:28:32,869 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-08 09:28:32,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:28:32,869 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-08 09:28:32,881 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-08 09:28:32,882 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:28:32,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:32,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:28:32,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:28:32,882 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-08 09:28:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:34,446 INFO L93 Difference]: Finished difference Result 275 states and 448 transitions. [2022-04-08 09:28:34,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:28:34,447 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-08 09:28:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:28:34,447 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-08 09:28:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-08 09:28:34,448 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-08 09:28:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-08 09:28:34,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2022-04-08 09:28:34,565 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-08 09:28:34,571 INFO L225 Difference]: With dead ends: 275 [2022-04-08 09:28:34,571 INFO L226 Difference]: Without dead ends: 273 [2022-04-08 09:28:34,571 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:28:34,572 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 81 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 09:28:34,572 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.4s Time] [2022-04-08 09:28:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-08 09:28:35,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 249. [2022-04-08 09:28:35,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:28:35,273 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-08 09:28:35,274 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-08 09:28:35,274 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-08 09:28:35,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:35,291 INFO L93 Difference]: Finished difference Result 273 states and 446 transitions. [2022-04-08 09:28:35,291 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 446 transitions. [2022-04-08 09:28:35,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:35,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:35,293 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-08 09:28:35,293 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-08 09:28:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:35,304 INFO L93 Difference]: Finished difference Result 273 states and 446 transitions. [2022-04-08 09:28:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 446 transitions. [2022-04-08 09:28:35,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:35,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:35,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:28:35,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:28:35,306 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-08 09:28:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 405 transitions. [2022-04-08 09:28:35,320 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 405 transitions. Word has length 27 [2022-04-08 09:28:35,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:28:35,321 INFO L478 AbstractCegarLoop]: Abstraction has 249 states and 405 transitions. [2022-04-08 09:28:35,322 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-08 09:28:35,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 249 states and 405 transitions. [2022-04-08 09:28:35,785 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-08 09:28:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 405 transitions. [2022-04-08 09:28:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 09:28:35,786 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:28:35,786 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-08 09:28:35,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 09:28:35,786 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:28:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:28:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash -870562259, now seen corresponding path program 1 times [2022-04-08 09:28:35,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:35,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1653199929] [2022-04-08 09:28:35,787 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:28:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash -870562259, now seen corresponding path program 2 times [2022-04-08 09:28:35,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:28:35,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198206025] [2022-04-08 09:28:35,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:28:35,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:28:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:35,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:28:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:35,865 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-08 09:28:35,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-08 09:28:35,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7694#true} {7694#true} #138#return; {7694#true} is VALID [2022-04-08 09:28:35,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:28:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:35,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-08 09:28:35,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-08 09:28:35,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-08 09:28:35,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7695#false} #130#return; {7695#false} is VALID [2022-04-08 09:28:35,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:28:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:35,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-08 09:28:35,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-08 09:28:35,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-08 09:28:35,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7695#false} #132#return; {7695#false} is VALID [2022-04-08 09:28:35,871 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-08 09:28:35,871 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-08 09:28:35,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-08 09:28:35,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7694#true} #138#return; {7694#true} is VALID [2022-04-08 09:28:35,871 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-08 09:28:35,871 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-08 09:28:35,872 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-08 09:28:35,872 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-08 09:28:35,873 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-08 09:28:35,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {7701#(<= main_~j~0 main_~r~0)} assume !(~j~0 <= ~r~0); {7695#false} is VALID [2022-04-08 09:28:35,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {7695#false} assume ~l~0 > 1; {7695#false} is VALID [2022-04-08 09:28:35,873 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-08 09:28:35,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-08 09:28:35,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-08 09:28:35,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-08 09:28:35,874 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7694#true} {7695#false} #130#return; {7695#false} is VALID [2022-04-08 09:28:35,874 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-08 09:28:35,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-08 09:28:35,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-08 09:28:35,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-08 09:28:35,874 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7694#true} {7695#false} #132#return; {7695#false} is VALID [2022-04-08 09:28:35,874 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-08 09:28:35,874 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-08 09:28:35,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {7695#false} assume !!(~j~0 <= ~r~0); {7695#false} is VALID [2022-04-08 09:28:35,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {7695#false} assume ~j~0 < ~r~0; {7695#false} is VALID [2022-04-08 09:28:35,874 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-08 09:28:35,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {7695#false} ~cond := #in~cond; {7695#false} is VALID [2022-04-08 09:28:35,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {7695#false} assume 0 == ~cond; {7695#false} is VALID [2022-04-08 09:28:35,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {7695#false} assume !false; {7695#false} is VALID [2022-04-08 09:28:35,875 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-08 09:28:35,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:28:35,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198206025] [2022-04-08 09:28:35,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198206025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:35,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:35,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:28:35,875 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:28:35,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1653199929] [2022-04-08 09:28:35,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1653199929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:35,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:35,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:28:35,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298166897] [2022-04-08 09:28:35,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:28:35,876 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-08 09:28:35,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:28:35,876 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-08 09:28:35,890 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-08 09:28:35,890 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:28:35,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:35,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:28:35,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:28:35,890 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-08 09:28:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:38,253 INFO L93 Difference]: Finished difference Result 593 states and 971 transitions. [2022-04-08 09:28:38,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:28:38,254 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-08 09:28:38,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:28:38,254 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-08 09:28:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-04-08 09:28:38,257 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-08 09:28:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-04-08 09:28:38,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 258 transitions. [2022-04-08 09:28:38,475 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-08 09:28:38,485 INFO L225 Difference]: With dead ends: 593 [2022-04-08 09:28:38,485 INFO L226 Difference]: Without dead ends: 396 [2022-04-08 09:28:38,487 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:28:38,487 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 09:28:38,487 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.5s Time] [2022-04-08 09:28:38,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-08 09:28:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 250. [2022-04-08 09:28:39,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:28:39,297 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-08 09:28:39,297 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-08 09:28:39,297 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-08 09:28:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:39,312 INFO L93 Difference]: Finished difference Result 396 states and 653 transitions. [2022-04-08 09:28:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 653 transitions. [2022-04-08 09:28:39,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:39,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:39,314 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-08 09:28:39,315 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-08 09:28:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:39,329 INFO L93 Difference]: Finished difference Result 396 states and 653 transitions. [2022-04-08 09:28:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 653 transitions. [2022-04-08 09:28:39,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:39,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:39,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:28:39,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:28:39,332 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-08 09:28:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 405 transitions. [2022-04-08 09:28:39,340 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 405 transitions. Word has length 29 [2022-04-08 09:28:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:28:39,340 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 405 transitions. [2022-04-08 09:28:39,340 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-08 09:28:39,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 405 transitions. [2022-04-08 09:28:39,845 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-08 09:28:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 405 transitions. [2022-04-08 09:28:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 09:28:39,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:28:39,846 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-08 09:28:39,846 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 09:28:39,846 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:28:39,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:28:39,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1319777776, now seen corresponding path program 1 times [2022-04-08 09:28:39,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:39,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [560793794] [2022-04-08 09:28:39,846 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:28:39,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1319777776, now seen corresponding path program 2 times [2022-04-08 09:28:39,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:28:39,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96016153] [2022-04-08 09:28:39,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:28:39,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:28:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:39,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:28:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:39,901 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-08 09:28:39,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 09:28:39,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10201#true} {10201#true} #138#return; {10201#true} is VALID [2022-04-08 09:28:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:28:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:39,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-08 09:28:39,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-08 09:28:39,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 09:28:39,905 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-08 09:28:39,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:28:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:39,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-08 09:28:39,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-08 09:28:39,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 09:28:39,910 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-08 09:28:39,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-08 09:28:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:39,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-08 09:28:39,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-08 09:28:39,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 09:28:39,918 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-08 09:28:39,919 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-08 09:28:39,919 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-08 09:28:39,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 09:28:39,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10201#true} #138#return; {10201#true} is VALID [2022-04-08 09:28:39,919 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-08 09:28:39,919 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-08 09:28:39,920 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-08 09:28:39,920 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-08 09:28:39,920 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-08 09:28:39,920 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-08 09:28:39,921 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-08 09:28:39,921 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-08 09:28:39,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-08 09:28:39,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-08 09:28:39,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 09:28:39,921 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-08 09:28:39,921 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-08 09:28:39,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-08 09:28:39,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-08 09:28:39,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 09:28:39,922 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-08 09:28:39,922 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-08 09:28:39,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-08 09:28:39,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-08 09:28:39,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-08 09:28:39,923 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-08 09:28:39,923 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-08 09:28:39,924 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-08 09:28:39,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {10221#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10202#false} is VALID [2022-04-08 09:28:39,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {10202#false} assume !false; {10202#false} is VALID [2022-04-08 09:28:39,925 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-08 09:28:39,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:28:39,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96016153] [2022-04-08 09:28:39,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96016153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:39,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:39,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:28:39,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:28:39,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [560793794] [2022-04-08 09:28:39,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [560793794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:39,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:39,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:28:39,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797577561] [2022-04-08 09:28:39,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:28:39,926 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-08 09:28:39,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:28:39,927 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-08 09:28:39,939 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-08 09:28:39,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:28:39,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:39,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:28:39,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:28:39,939 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-08 09:28:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:41,768 INFO L93 Difference]: Finished difference Result 324 states and 521 transitions. [2022-04-08 09:28:41,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:28:41,768 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-08 09:28:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:28:41,768 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-08 09:28:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-08 09:28:41,769 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-08 09:28:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-08 09:28:41,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-08 09:28:41,859 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-08 09:28:41,866 INFO L225 Difference]: With dead ends: 324 [2022-04-08 09:28:41,866 INFO L226 Difference]: Without dead ends: 322 [2022-04-08 09:28:41,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:28:41,867 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:28:41,867 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.3s Time] [2022-04-08 09:28:41,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-08 09:28:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 300. [2022-04-08 09:28:42,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:28:42,908 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-08 09:28:42,908 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-08 09:28:42,908 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-08 09:28:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:42,918 INFO L93 Difference]: Finished difference Result 322 states and 519 transitions. [2022-04-08 09:28:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2022-04-08 09:28:42,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:42,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:42,920 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-08 09:28:42,920 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-08 09:28:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:42,929 INFO L93 Difference]: Finished difference Result 322 states and 519 transitions. [2022-04-08 09:28:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2022-04-08 09:28:42,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:42,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:42,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:28:42,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:28:42,931 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-08 09:28:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 489 transitions. [2022-04-08 09:28:42,941 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 489 transitions. Word has length 30 [2022-04-08 09:28:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:28:42,941 INFO L478 AbstractCegarLoop]: Abstraction has 300 states and 489 transitions. [2022-04-08 09:28:42,941 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-08 09:28:42,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 489 transitions. [2022-04-08 09:28:43,536 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-08 09:28:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 489 transitions. [2022-04-08 09:28:43,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 09:28:43,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:28:43,537 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-08 09:28:43,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 09:28:43,537 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:28:43,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:28:43,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1828949766, now seen corresponding path program 1 times [2022-04-08 09:28:43,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:43,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [235672613] [2022-04-08 09:28:43,538 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:28:43,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1828949766, now seen corresponding path program 2 times [2022-04-08 09:28:43,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:28:43,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563917803] [2022-04-08 09:28:43,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:28:43,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:28:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:43,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:28:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:43,600 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-08 09:28:43,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 09:28:43,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12128#true} {12128#true} #138#return; {12128#true} is VALID [2022-04-08 09:28:43,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:28:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:43,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-08 09:28:43,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-08 09:28:43,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 09:28:43,603 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-08 09:28:43,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:28:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:43,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-08 09:28:43,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-08 09:28:43,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 09:28:43,609 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-08 09:28:43,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-08 09:28:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:43,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-08 09:28:43,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-08 09:28:43,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 09:28:43,614 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-08 09:28:43,615 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-08 09:28:43,615 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-08 09:28:43,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 09:28:43,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12128#true} #138#return; {12128#true} is VALID [2022-04-08 09:28:43,615 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-08 09:28:43,615 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-08 09:28:43,616 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-08 09:28:43,616 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-08 09:28:43,617 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-08 09:28:43,617 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-08 09:28:43,617 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-08 09:28:43,617 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-08 09:28:43,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-08 09:28:43,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-08 09:28:43,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 09:28:43,618 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-08 09:28:43,618 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-08 09:28:43,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-08 09:28:43,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-08 09:28:43,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 09:28:43,618 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-08 09:28:43,619 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-08 09:28:43,619 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-08 09:28:43,619 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-08 09:28:43,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-08 09:28:43,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-08 09:28:43,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-08 09:28:43,620 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-08 09:28:43,620 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-08 09:28:43,620 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-08 09:28:43,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {12149#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12129#false} is VALID [2022-04-08 09:28:43,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {12129#false} assume !false; {12129#false} is VALID [2022-04-08 09:28:43,621 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-08 09:28:43,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:28:43,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563917803] [2022-04-08 09:28:43,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563917803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:43,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:43,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:28:43,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:28:43,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [235672613] [2022-04-08 09:28:43,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [235672613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:43,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:43,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:28:43,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671720020] [2022-04-08 09:28:43,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:28:43,624 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-08 09:28:43,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:28:43,624 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-08 09:28:43,638 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-08 09:28:43,638 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:28:43,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:43,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:28:43,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:28:43,639 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-08 09:28:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:46,791 INFO L93 Difference]: Finished difference Result 470 states and 788 transitions. [2022-04-08 09:28:46,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:28:46,791 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-08 09:28:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:28:46,791 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-08 09:28:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-04-08 09:28:46,793 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-08 09:28:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-04-08 09:28:46,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 145 transitions. [2022-04-08 09:28:46,917 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-08 09:28:46,929 INFO L225 Difference]: With dead ends: 470 [2022-04-08 09:28:46,930 INFO L226 Difference]: Without dead ends: 468 [2022-04-08 09:28:46,930 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-08 09:28:46,931 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 98 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-08 09:28:46,931 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-08 09:28:46,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-08 09:28:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 422. [2022-04-08 09:28:48,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:28:48,781 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-08 09:28:48,781 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-08 09:28:48,782 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-08 09:28:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:48,800 INFO L93 Difference]: Finished difference Result 468 states and 786 transitions. [2022-04-08 09:28:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 786 transitions. [2022-04-08 09:28:48,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:48,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:48,802 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-08 09:28:48,803 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-08 09:28:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:48,821 INFO L93 Difference]: Finished difference Result 468 states and 786 transitions. [2022-04-08 09:28:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 786 transitions. [2022-04-08 09:28:48,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:48,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:48,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:28:48,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:28:48,824 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-08 09:28:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 708 transitions. [2022-04-08 09:28:48,841 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 708 transitions. Word has length 32 [2022-04-08 09:28:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:28:48,842 INFO L478 AbstractCegarLoop]: Abstraction has 422 states and 708 transitions. [2022-04-08 09:28:48,842 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-08 09:28:48,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 422 states and 708 transitions. [2022-04-08 09:28:49,810 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-08 09:28:49,811 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 708 transitions. [2022-04-08 09:28:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 09:28:49,811 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:28:49,811 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-08 09:28:49,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 09:28:49,811 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:28:49,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:28:49,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1969498376, now seen corresponding path program 1 times [2022-04-08 09:28:49,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:49,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1329146707] [2022-04-08 09:28:49,812 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:28:49,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1969498376, now seen corresponding path program 2 times [2022-04-08 09:28:49,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:28:49,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135507270] [2022-04-08 09:28:49,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:28:49,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:28:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:49,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:28:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:49,867 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-08 09:28:49,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 09:28:49,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14885#true} {14885#true} #138#return; {14885#true} is VALID [2022-04-08 09:28:49,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:28:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:49,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-08 09:28:49,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-08 09:28:49,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 09:28:49,872 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-08 09:28:49,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:28:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:49,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-08 09:28:49,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-08 09:28:49,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 09:28:49,880 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-08 09:28:49,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-08 09:28:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:49,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-08 09:28:49,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-08 09:28:49,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 09:28:49,886 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-08 09:28:49,886 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-08 09:28:49,886 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-08 09:28:49,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 09:28:49,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14885#true} #138#return; {14885#true} is VALID [2022-04-08 09:28:49,887 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-08 09:28:49,887 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-08 09:28:49,887 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-08 09:28:49,887 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-08 09:28:49,888 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-08 09:28:49,891 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-08 09:28:49,891 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-08 09:28:49,891 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-08 09:28:49,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-08 09:28:49,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-08 09:28:49,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 09:28:49,894 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-08 09:28:49,895 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-08 09:28:49,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-08 09:28:49,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-08 09:28:49,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 09:28:49,897 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-08 09:28:49,898 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-08 09:28:49,898 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-08 09:28:49,898 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-08 09:28:49,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-08 09:28:49,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-08 09:28:49,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-08 09:28:49,898 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-08 09:28:49,899 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-08 09:28:49,899 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-08 09:28:49,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {14906#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14886#false} is VALID [2022-04-08 09:28:49,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {14886#false} assume !false; {14886#false} is VALID [2022-04-08 09:28:49,900 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-08 09:28:49,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:28:49,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135507270] [2022-04-08 09:28:49,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135507270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:49,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:49,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:28:49,901 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:28:49,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1329146707] [2022-04-08 09:28:49,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1329146707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:49,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:49,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:28:49,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862118269] [2022-04-08 09:28:49,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:28:49,901 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-08 09:28:49,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:28:49,902 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-08 09:28:49,915 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-08 09:28:49,915 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:28:49,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:49,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:28:49,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:28:49,916 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-08 09:28:53,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:53,288 INFO L93 Difference]: Finished difference Result 489 states and 817 transitions. [2022-04-08 09:28:53,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:28:53,288 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-08 09:28:53,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:28:53,289 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-08 09:28:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-08 09:28:53,290 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-08 09:28:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-08 09:28:53,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2022-04-08 09:28:53,382 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-08 09:28:53,395 INFO L225 Difference]: With dead ends: 489 [2022-04-08 09:28:53,395 INFO L226 Difference]: Without dead ends: 487 [2022-04-08 09:28:53,395 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:28:53,396 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-08 09:28:53,397 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-08 09:28:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-04-08 09:28:55,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 429. [2022-04-08 09:28:55,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:28:55,624 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-08 09:28:55,624 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-08 09:28:55,625 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-08 09:28:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:55,660 INFO L93 Difference]: Finished difference Result 487 states and 815 transitions. [2022-04-08 09:28:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 815 transitions. [2022-04-08 09:28:55,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:55,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:55,664 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-08 09:28:55,664 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-08 09:28:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:28:55,690 INFO L93 Difference]: Finished difference Result 487 states and 815 transitions. [2022-04-08 09:28:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 815 transitions. [2022-04-08 09:28:55,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:28:55,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:28:55,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:28:55,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:28:55,693 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-08 09:28:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 717 transitions. [2022-04-08 09:28:55,712 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 717 transitions. Word has length 32 [2022-04-08 09:28:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:28:55,712 INFO L478 AbstractCegarLoop]: Abstraction has 429 states and 717 transitions. [2022-04-08 09:28:55,712 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-08 09:28:55,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 429 states and 717 transitions. [2022-04-08 09:28:56,718 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-08 09:28:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 717 transitions. [2022-04-08 09:28:56,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 09:28:56,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:28:56,720 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-08 09:28:56,720 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 09:28:56,720 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:28:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:28:56,720 INFO L85 PathProgramCache]: Analyzing trace with hash 154781133, now seen corresponding path program 1 times [2022-04-08 09:28:56,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:56,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1662619237] [2022-04-08 09:28:56,724 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:28:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash 154781133, now seen corresponding path program 2 times [2022-04-08 09:28:56,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:28:56,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310192853] [2022-04-08 09:28:56,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:28:56,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:28:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:56,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:28:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:56,799 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-08 09:28:56,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 09:28:56,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17730#true} {17730#true} #138#return; {17730#true} is VALID [2022-04-08 09:28:56,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:28:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:56,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 09:28:56,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 09:28:56,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 09:28:56,803 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-08 09:28:56,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:28:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:56,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 09:28:56,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 09:28:56,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 09:28:56,807 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-08 09:28:56,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-08 09:28:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:56,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 09:28:56,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 09:28:56,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 09:28:56,811 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-08 09:28:56,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 09:28:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:56,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 09:28:56,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 09:28:56,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 09:28:56,814 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-08 09:28:56,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 09:28:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:28:56,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 09:28:56,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 09:28:56,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 09:28:56,818 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-08 09:28:56,818 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-08 09:28:56,818 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-08 09:28:56,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 09:28:56,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17730#true} #138#return; {17730#true} is VALID [2022-04-08 09:28:56,818 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-08 09:28:56,818 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-08 09:28:56,819 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-08 09:28:56,819 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-08 09:28:56,819 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-08 09:28:56,820 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-08 09:28:56,820 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-08 09:28:56,820 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-08 09:28:56,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 09:28:56,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 09:28:56,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 09:28:56,821 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-08 09:28:56,821 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-08 09:28:56,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 09:28:56,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 09:28:56,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 09:28:56,821 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-08 09:28:56,821 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-08 09:28:56,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 09:28:56,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 09:28:56,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 09:28:56,822 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-08 09:28:56,822 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-08 09:28:56,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 09:28:56,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 09:28:56,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 09:28:56,823 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-08 09:28:56,823 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-08 09:28:56,823 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-08 09:28:56,823 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-08 09:28:56,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-08 09:28:56,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-08 09:28:56,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-08 09:28:56,824 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-08 09:28:56,824 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-08 09:28:56,825 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-08 09:28:56,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {17759#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17731#false} is VALID [2022-04-08 09:28:56,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {17731#false} assume !false; {17731#false} is VALID [2022-04-08 09:28:56,825 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-08 09:28:56,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:28:56,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310192853] [2022-04-08 09:28:56,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310192853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:56,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:56,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:28:56,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:28:56,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1662619237] [2022-04-08 09:28:56,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1662619237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:28:56,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:28:56,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:28:56,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024732228] [2022-04-08 09:28:56,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:28:56,826 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-08 09:28:56,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:28:56,826 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-08 09:28:56,845 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-08 09:28:56,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:28:56,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:28:56,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:28:56,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:28:56,845 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-08 09:29:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:00,189 INFO L93 Difference]: Finished difference Result 484 states and 791 transitions. [2022-04-08 09:29:00,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:29:00,189 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-08 09:29:00,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:00,190 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-08 09:29:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-08 09:29:00,191 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-08 09:29:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-08 09:29:00,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2022-04-08 09:29:00,276 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-08 09:29:00,288 INFO L225 Difference]: With dead ends: 484 [2022-04-08 09:29:00,288 INFO L226 Difference]: Without dead ends: 482 [2022-04-08 09:29:00,288 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-08 09:29:00,289 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-08 09:29:00,290 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-08 09:29:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-04-08 09:29:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 433. [2022-04-08 09:29:02,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:02,443 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-08 09:29:02,443 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-08 09:29:02,444 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-08 09:29:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:02,459 INFO L93 Difference]: Finished difference Result 482 states and 789 transitions. [2022-04-08 09:29:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 789 transitions. [2022-04-08 09:29:02,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:02,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:02,462 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-08 09:29:02,462 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-08 09:29:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:02,483 INFO L93 Difference]: Finished difference Result 482 states and 789 transitions. [2022-04-08 09:29:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 789 transitions. [2022-04-08 09:29:02,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:02,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:02,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:02,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:02,485 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-08 09:29:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 720 transitions. [2022-04-08 09:29:02,502 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 720 transitions. Word has length 42 [2022-04-08 09:29:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:02,502 INFO L478 AbstractCegarLoop]: Abstraction has 433 states and 720 transitions. [2022-04-08 09:29:02,502 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-08 09:29:02,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 433 states and 720 transitions. [2022-04-08 09:29:03,509 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-08 09:29:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 720 transitions. [2022-04-08 09:29:03,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 09:29:03,510 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:03,511 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-08 09:29:03,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 09:29:03,511 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:03,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:03,511 INFO L85 PathProgramCache]: Analyzing trace with hash -756625364, now seen corresponding path program 1 times [2022-04-08 09:29:03,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:03,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1207894651] [2022-04-08 09:29:03,511 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:03,511 INFO L85 PathProgramCache]: Analyzing trace with hash -756625364, now seen corresponding path program 2 times [2022-04-08 09:29:03,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:03,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668015673] [2022-04-08 09:29:03,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:03,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:03,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:03,607 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-08 09:29:03,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 09:29:03,607 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20574#true} {20574#true} #138#return; {20574#true} is VALID [2022-04-08 09:29:03,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:29:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:03,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 09:29:03,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 09:29:03,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 09:29:03,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #118#return; {20574#true} is VALID [2022-04-08 09:29:03,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:29:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:03,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 09:29:03,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 09:29:03,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 09:29:03,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #120#return; {20574#true} is VALID [2022-04-08 09:29:03,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 09:29:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:03,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 09:29:03,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 09:29:03,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 09:29:03,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #130#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:03,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 09:29:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:03,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 09:29:03,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 09:29:03,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 09:29:03,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #132#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:03,620 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-08 09:29:03,620 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-08 09:29:03,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 09:29:03,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #138#return; {20574#true} is VALID [2022-04-08 09:29:03,620 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-08 09:29:03,621 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-08 09:29:03,621 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-08 09:29:03,621 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-08 09:29:03,621 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-08 09:29:03,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {20574#true} assume !!(~j~0 <= ~r~0); {20574#true} is VALID [2022-04-08 09:29:03,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {20574#true} assume !(~j~0 < ~r~0); {20574#true} is VALID [2022-04-08 09:29:03,621 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-08 09:29:03,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 09:29:03,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 09:29:03,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 09:29:03,621 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20574#true} {20574#true} #118#return; {20574#true} is VALID [2022-04-08 09:29:03,621 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-08 09:29:03,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 09:29:03,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 09:29:03,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 09:29:03,622 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20574#true} {20574#true} #120#return; {20574#true} is VALID [2022-04-08 09:29:03,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {20574#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20574#true} is VALID [2022-04-08 09:29:03,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {20574#true} assume 0 != #t~nondet5;havoc #t~nondet5; {20574#true} is VALID [2022-04-08 09:29:03,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {20574#true} assume ~l~0 > 1; {20587#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:03,628 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-08 09:29:03,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 09:29:03,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 09:29:03,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 09:29:03,628 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #130#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:03,628 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-08 09:29:03,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-08 09:29:03,628 INFO L290 TraceCheckUtils]: 31: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-08 09:29:03,628 INFO L290 TraceCheckUtils]: 32: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-08 09:29:03,629 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #132#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:03,629 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-08 09:29:03,629 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-08 09:29:03,630 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-08 09:29:03,630 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-08 09:29:03,630 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-08 09:29:03,630 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-08 09:29:03,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {20599#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20575#false} is VALID [2022-04-08 09:29:03,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {20575#false} assume !false; {20575#false} is VALID [2022-04-08 09:29:03,631 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-08 09:29:03,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:03,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668015673] [2022-04-08 09:29:03,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668015673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:03,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:03,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:29:03,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:03,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1207894651] [2022-04-08 09:29:03,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1207894651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:03,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:03,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:29:03,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440631677] [2022-04-08 09:29:03,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:03,632 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-08 09:29:03,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:03,632 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-08 09:29:03,650 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-08 09:29:03,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:29:03,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:03,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:29:03,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:29:03,651 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-08 09:29:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:06,304 INFO L93 Difference]: Finished difference Result 440 states and 726 transitions. [2022-04-08 09:29:06,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:29:06,305 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-08 09:29:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:06,305 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-08 09:29:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-08 09:29:06,307 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-08 09:29:06,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-08 09:29:06,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-08 09:29:06,361 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-08 09:29:06,372 INFO L225 Difference]: With dead ends: 440 [2022-04-08 09:29:06,373 INFO L226 Difference]: Without dead ends: 438 [2022-04-08 09:29:06,375 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-08 09:29:06,377 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-08 09:29:06,377 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-08 09:29:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-04-08 09:29:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 437. [2022-04-08 09:29:08,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:08,527 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-08 09:29:08,528 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-08 09:29:08,528 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-08 09:29:08,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:08,542 INFO L93 Difference]: Finished difference Result 438 states and 724 transitions. [2022-04-08 09:29:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 724 transitions. [2022-04-08 09:29:08,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:08,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:08,544 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-08 09:29:08,545 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-08 09:29:08,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:08,559 INFO L93 Difference]: Finished difference Result 438 states and 724 transitions. [2022-04-08 09:29:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 724 transitions. [2022-04-08 09:29:08,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:08,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:08,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:08,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:08,561 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-08 09:29:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 723 transitions. [2022-04-08 09:29:08,578 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 723 transitions. Word has length 42 [2022-04-08 09:29:08,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:08,578 INFO L478 AbstractCegarLoop]: Abstraction has 437 states and 723 transitions. [2022-04-08 09:29:08,578 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-08 09:29:08,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 437 states and 723 transitions. [2022-04-08 09:29:09,563 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-08 09:29:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 723 transitions. [2022-04-08 09:29:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 09:29:09,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:09,564 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-08 09:29:09,564 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 09:29:09,564 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:09,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:09,564 INFO L85 PathProgramCache]: Analyzing trace with hash 202086614, now seen corresponding path program 1 times [2022-04-08 09:29:09,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:09,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [612714334] [2022-04-08 09:29:09,565 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:09,565 INFO L85 PathProgramCache]: Analyzing trace with hash 202086614, now seen corresponding path program 2 times [2022-04-08 09:29:09,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:09,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442825678] [2022-04-08 09:29:09,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:09,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:09,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:09,627 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-08 09:29:09,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 09:29:09,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23248#true} {23248#true} #138#return; {23248#true} is VALID [2022-04-08 09:29:09,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:29:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:09,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 09:29:09,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 09:29:09,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 09:29:09,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #118#return; {23248#true} is VALID [2022-04-08 09:29:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:29:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:09,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 09:29:09,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 09:29:09,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 09:29:09,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #120#return; {23248#true} is VALID [2022-04-08 09:29:09,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 09:29:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:09,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 09:29:09,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 09:29:09,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 09:29:09,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #130#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:09,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 09:29:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:09,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 09:29:09,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 09:29:09,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 09:29:09,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #132#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:09,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 09:29:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:09,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 09:29:09,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 09:29:09,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 09:29:09,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #118#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:09,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-08 09:29:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:09,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 09:29:09,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 09:29:09,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 09:29:09,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #120#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:09,658 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-08 09:29:09,658 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-08 09:29:09,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 09:29:09,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #138#return; {23248#true} is VALID [2022-04-08 09:29:09,658 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-08 09:29:09,658 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-08 09:29:09,658 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-08 09:29:09,659 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-08 09:29:09,659 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-08 09:29:09,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {23248#true} assume !!(~j~0 <= ~r~0); {23248#true} is VALID [2022-04-08 09:29:09,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {23248#true} assume !(~j~0 < ~r~0); {23248#true} is VALID [2022-04-08 09:29:09,659 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-08 09:29:09,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 09:29:09,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 09:29:09,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 09:29:09,659 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23248#true} {23248#true} #118#return; {23248#true} is VALID [2022-04-08 09:29:09,659 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-08 09:29:09,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 09:29:09,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 09:29:09,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 09:29:09,659 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {23248#true} {23248#true} #120#return; {23248#true} is VALID [2022-04-08 09:29:09,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {23248#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23248#true} is VALID [2022-04-08 09:29:09,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {23248#true} assume 0 != #t~nondet5;havoc #t~nondet5; {23248#true} is VALID [2022-04-08 09:29:09,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {23248#true} assume ~l~0 > 1; {23261#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:09,660 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-08 09:29:09,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 09:29:09,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 09:29:09,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 09:29:09,660 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #130#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:09,660 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-08 09:29:09,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 09:29:09,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 09:29:09,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 09:29:09,661 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #132#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:09,661 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-08 09:29:09,662 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-08 09:29:09,662 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-08 09:29:09,662 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-08 09:29:09,662 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-08 09:29:09,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 09:29:09,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 09:29:09,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 09:29:09,663 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #118#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:09,663 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-08 09:29:09,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-08 09:29:09,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-08 09:29:09,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-08 09:29:09,663 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #120#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:09,664 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-08 09:29:09,664 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-08 09:29:09,664 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-08 09:29:09,664 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-08 09:29:09,665 INFO L290 TraceCheckUtils]: 52: Hoare triple {23281#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23249#false} is VALID [2022-04-08 09:29:09,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {23249#false} assume !false; {23249#false} is VALID [2022-04-08 09:29:09,665 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-08 09:29:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:09,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442825678] [2022-04-08 09:29:09,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442825678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:09,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:09,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:29:09,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:09,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [612714334] [2022-04-08 09:29:09,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [612714334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:09,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:09,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:29:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862083020] [2022-04-08 09:29:09,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:09,666 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-08 09:29:09,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:09,666 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-08 09:29:09,691 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-08 09:29:09,691 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:29:09,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:09,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:29:09,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:29:09,692 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-08 09:29:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:13,039 INFO L93 Difference]: Finished difference Result 501 states and 826 transitions. [2022-04-08 09:29:13,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:29:13,039 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-08 09:29:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:13,039 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-08 09:29:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-08 09:29:13,041 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-08 09:29:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-08 09:29:13,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 107 transitions. [2022-04-08 09:29:13,135 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-08 09:29:13,148 INFO L225 Difference]: With dead ends: 501 [2022-04-08 09:29:13,149 INFO L226 Difference]: Without dead ends: 499 [2022-04-08 09:29:13,149 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-08 09:29:13,149 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-08 09:29:13,150 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-08 09:29:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-08 09:29:15,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 441. [2022-04-08 09:29:15,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:15,410 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-08 09:29:15,411 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-08 09:29:15,411 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-08 09:29:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:15,429 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-08 09:29:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-08 09:29:15,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:15,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:15,431 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-08 09:29:15,432 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-08 09:29:15,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:15,449 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-08 09:29:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-08 09:29:15,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:15,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:15,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:15,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:15,451 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-08 09:29:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 726 transitions. [2022-04-08 09:29:15,468 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 726 transitions. Word has length 54 [2022-04-08 09:29:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:15,468 INFO L478 AbstractCegarLoop]: Abstraction has 441 states and 726 transitions. [2022-04-08 09:29:15,468 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-08 09:29:15,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 441 states and 726 transitions. [2022-04-08 09:29:16,452 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-08 09:29:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 726 transitions. [2022-04-08 09:29:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 09:29:16,454 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:16,454 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-08 09:29:16,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 09:29:16,455 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:16,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:16,455 INFO L85 PathProgramCache]: Analyzing trace with hash -667500302, now seen corresponding path program 1 times [2022-04-08 09:29:16,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:16,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [284725669] [2022-04-08 09:29:16,747 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:16,748 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:16,748 INFO L85 PathProgramCache]: Analyzing trace with hash -667500302, now seen corresponding path program 2 times [2022-04-08 09:29:16,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:16,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719889277] [2022-04-08 09:29:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:16,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,809 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-08 09:29:16,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26184#true} {26184#true} #138#return; {26184#true} is VALID [2022-04-08 09:29:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:29:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #118#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:16,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:29:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #120#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:16,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-08 09:29:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #122#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:16,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-08 09:29:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #124#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:16,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 09:29:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #126#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:16,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 09:29:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #128#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:16,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-08 09:29:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #118#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:16,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-08 09:29:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #120#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:16,843 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-08 09:29:16,843 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-08 09:29:16,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26184#true} #138#return; {26184#true} is VALID [2022-04-08 09:29:16,843 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-08 09:29:16,843 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-08 09:29:16,843 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-08 09:29:16,844 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-08 09:29:16,844 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-08 09:29:16,844 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-08 09:29:16,845 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-08 09:29:16,845 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-08 09:29:16,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,845 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #118#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:16,845 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-08 09:29:16,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,846 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #120#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:16,846 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-08 09:29:16,846 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-08 09:29:16,846 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-08 09:29:16,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,847 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #122#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:16,847 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-08 09:29:16,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,848 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #124#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:16,848 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-08 09:29:16,848 INFO L290 TraceCheckUtils]: 34: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,848 INFO L290 TraceCheckUtils]: 35: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,848 INFO L290 TraceCheckUtils]: 36: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,848 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #126#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:16,848 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-08 09:29:16,848 INFO L290 TraceCheckUtils]: 39: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,848 INFO L290 TraceCheckUtils]: 40: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,848 INFO L290 TraceCheckUtils]: 41: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,849 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #128#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:16,849 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-08 09:29:16,849 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-08 09:29:16,850 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-08 09:29:16,850 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-08 09:29:16,850 INFO L290 TraceCheckUtils]: 47: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,850 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #118#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:16,850 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-08 09:29:16,850 INFO L290 TraceCheckUtils]: 52: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:16,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:16,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:16,851 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #120#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:16,851 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-08 09:29:16,851 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-08 09:29:16,852 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-08 09:29:16,852 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-08 09:29:16,852 INFO L290 TraceCheckUtils]: 60: Hoare triple {26225#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26185#false} is VALID [2022-04-08 09:29:16,853 INFO L290 TraceCheckUtils]: 61: Hoare triple {26185#false} assume !false; {26185#false} is VALID [2022-04-08 09:29:16,853 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-08 09:29:16,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:16,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719889277] [2022-04-08 09:29:16,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719889277] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:16,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923890482] [2022-04-08 09:29:16,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:29:16,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:16,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:16,854 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-08 09:29:16,855 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-08 09:29:16,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:29:16,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:16,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 09:29:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:17,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {26184#true} call ULTIMATE.init(); {26184#true} is VALID [2022-04-08 09:29:17,511 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-08 09:29:17,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:17,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26184#true} #138#return; {26184#true} is VALID [2022-04-08 09:29:17,512 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-08 09:29:17,512 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-08 09:29:17,512 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-08 09:29:17,512 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-08 09:29:17,513 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-08 09:29:17,513 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-08 09:29:17,513 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-08 09:29:17,513 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-08 09:29:17,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:17,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:17,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:17,514 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-08 09:29:17,514 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-08 09:29:17,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:17,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:17,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:17,515 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-08 09:29:17,515 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-08 09:29:17,515 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-08 09:29:17,515 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-08 09:29:17,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:17,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:17,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:17,516 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-08 09:29:17,516 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-08 09:29:17,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:17,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:17,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:17,517 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-08 09:29:17,517 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-08 09:29:17,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:17,517 INFO L290 TraceCheckUtils]: 35: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:17,517 INFO L290 TraceCheckUtils]: 36: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:17,517 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-08 09:29:17,517 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-08 09:29:17,517 INFO L290 TraceCheckUtils]: 39: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-08 09:29:17,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-08 09:29:17,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-08 09:29:17,518 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-08 09:29:17,518 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-08 09:29:17,519 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-08 09:29:17,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {26185#false} assume !(~j~0 < ~r~0); {26185#false} is VALID [2022-04-08 09:29:17,519 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-08 09:29:17,519 INFO L290 TraceCheckUtils]: 47: Hoare triple {26185#false} ~cond := #in~cond; {26185#false} is VALID [2022-04-08 09:29:17,519 INFO L290 TraceCheckUtils]: 48: Hoare triple {26185#false} assume !(0 == ~cond); {26185#false} is VALID [2022-04-08 09:29:17,519 INFO L290 TraceCheckUtils]: 49: Hoare triple {26185#false} assume true; {26185#false} is VALID [2022-04-08 09:29:17,519 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26185#false} {26185#false} #118#return; {26185#false} is VALID [2022-04-08 09:29:17,519 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-08 09:29:17,519 INFO L290 TraceCheckUtils]: 52: Hoare triple {26185#false} ~cond := #in~cond; {26185#false} is VALID [2022-04-08 09:29:17,519 INFO L290 TraceCheckUtils]: 53: Hoare triple {26185#false} assume !(0 == ~cond); {26185#false} is VALID [2022-04-08 09:29:17,519 INFO L290 TraceCheckUtils]: 54: Hoare triple {26185#false} assume true; {26185#false} is VALID [2022-04-08 09:29:17,519 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26185#false} {26185#false} #120#return; {26185#false} is VALID [2022-04-08 09:29:17,519 INFO L290 TraceCheckUtils]: 56: Hoare triple {26185#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {26185#false} is VALID [2022-04-08 09:29:17,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {26185#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {26185#false} is VALID [2022-04-08 09:29:17,520 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-08 09:29:17,520 INFO L290 TraceCheckUtils]: 59: Hoare triple {26185#false} ~cond := #in~cond; {26185#false} is VALID [2022-04-08 09:29:17,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {26185#false} assume 0 == ~cond; {26185#false} is VALID [2022-04-08 09:29:17,520 INFO L290 TraceCheckUtils]: 61: Hoare triple {26185#false} assume !false; {26185#false} is VALID [2022-04-08 09:29:17,520 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-08 09:29:17,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 09:29:17,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923890482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:17,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 09:29:17,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-04-08 09:29:17,521 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:17,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [284725669] [2022-04-08 09:29:17,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [284725669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:17,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:17,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:29:17,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088393409] [2022-04-08 09:29:17,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:17,522 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-08 09:29:17,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:17,522 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-08 09:29:17,558 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-08 09:29:17,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:29:17,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:17,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:29:17,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:29:17,559 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-08 09:29:20,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:20,345 INFO L93 Difference]: Finished difference Result 843 states and 1374 transitions. [2022-04-08 09:29:20,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:29:20,345 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-08 09:29:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:20,346 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-08 09:29:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2022-04-08 09:29:20,347 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-08 09:29:20,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2022-04-08 09:29:20,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 152 transitions. [2022-04-08 09:29:20,461 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-08 09:29:20,471 INFO L225 Difference]: With dead ends: 843 [2022-04-08 09:29:20,471 INFO L226 Difference]: Without dead ends: 437 [2022-04-08 09:29:20,473 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-08 09:29:20,473 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-08 09:29:20,473 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-08 09:29:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-04-08 09:29:22,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 401. [2022-04-08 09:29:22,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:22,690 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-08 09:29:22,691 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-08 09:29:22,691 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-08 09:29:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:22,702 INFO L93 Difference]: Finished difference Result 437 states and 700 transitions. [2022-04-08 09:29:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 700 transitions. [2022-04-08 09:29:22,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:22,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:22,704 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-08 09:29:22,705 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-08 09:29:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:22,718 INFO L93 Difference]: Finished difference Result 437 states and 700 transitions. [2022-04-08 09:29:22,718 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 700 transitions. [2022-04-08 09:29:22,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:22,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:22,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:22,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:22,720 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-08 09:29:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 644 transitions. [2022-04-08 09:29:22,733 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 644 transitions. Word has length 62 [2022-04-08 09:29:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:22,733 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 644 transitions. [2022-04-08 09:29:22,733 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-08 09:29:22,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 644 transitions. [2022-04-08 09:29:23,682 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-08 09:29:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 644 transitions. [2022-04-08 09:29:23,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 09:29:23,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:23,684 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-08 09:29:23,701 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-08 09:29:23,884 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-08 09:29:23,884 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:23,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:23,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1858540084, now seen corresponding path program 1 times [2022-04-08 09:29:23,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:23,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [300944924] [2022-04-08 09:29:24,318 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:24,319 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1858540084, now seen corresponding path program 2 times [2022-04-08 09:29:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:24,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164334292] [2022-04-08 09:29:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:24,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,406 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-08 09:29:24,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29777#true} {29777#true} #138#return; {29777#true} is VALID [2022-04-08 09:29:24,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:29:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #110#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:24,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:29:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #112#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:24,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-08 09:29:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #114#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:24,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 09:29:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #116#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:24,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 09:29:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #118#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:24,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 09:29:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #120#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:24,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-08 09:29:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #122#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:24,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-08 09:29:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #124#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:24,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-08 09:29:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #126#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:24,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 09:29:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #128#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:24,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-08 09:29:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #118#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-08 09:29:24,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-08 09:29:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #120#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-08 09:29:24,452 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-08 09:29:24,452 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-08 09:29:24,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29777#true} #138#return; {29777#true} is VALID [2022-04-08 09:29:24,452 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-08 09:29:24,452 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-08 09:29:24,453 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-08 09:29:24,453 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-08 09:29:24,453 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-08 09:29:24,453 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-08 09:29:24,454 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-08 09:29:24,454 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-08 09:29:24,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,454 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #110#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:24,454 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-08 09:29:24,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,455 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #112#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:24,455 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-08 09:29:24,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,455 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #114#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:24,455 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-08 09:29:24,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,456 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #116#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:24,456 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-08 09:29:24,456 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-08 09:29:24,457 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-08 09:29:24,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,457 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #118#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:24,457 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-08 09:29:24,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,458 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #120#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:24,458 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-08 09:29:24,458 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-08 09:29:24,458 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-08 09:29:24,458 INFO L290 TraceCheckUtils]: 46: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,458 INFO L290 TraceCheckUtils]: 47: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,458 INFO L290 TraceCheckUtils]: 48: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,459 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #122#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:24,459 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-08 09:29:24,459 INFO L290 TraceCheckUtils]: 51: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,459 INFO L290 TraceCheckUtils]: 52: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,459 INFO L290 TraceCheckUtils]: 53: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,459 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #124#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:24,459 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-08 09:29:24,459 INFO L290 TraceCheckUtils]: 56: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,459 INFO L290 TraceCheckUtils]: 57: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,459 INFO L290 TraceCheckUtils]: 58: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,460 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #126#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:24,460 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-08 09:29:24,460 INFO L290 TraceCheckUtils]: 61: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,460 INFO L290 TraceCheckUtils]: 62: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,460 INFO L290 TraceCheckUtils]: 63: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,460 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #128#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:24,461 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-08 09:29:24,461 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-08 09:29:24,461 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-08 09:29:24,461 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-08 09:29:24,461 INFO L290 TraceCheckUtils]: 69: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,461 INFO L290 TraceCheckUtils]: 70: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,461 INFO L290 TraceCheckUtils]: 71: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,462 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #118#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-08 09:29:24,462 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-08 09:29:24,462 INFO L290 TraceCheckUtils]: 74: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:24,462 INFO L290 TraceCheckUtils]: 75: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:24,462 INFO L290 TraceCheckUtils]: 76: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:24,462 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #120#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-08 09:29:24,463 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-08 09:29:24,463 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-08 09:29:24,463 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-08 09:29:24,463 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-08 09:29:24,464 INFO L290 TraceCheckUtils]: 82: Hoare triple {29835#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29778#false} is VALID [2022-04-08 09:29:24,464 INFO L290 TraceCheckUtils]: 83: Hoare triple {29778#false} assume !false; {29778#false} is VALID [2022-04-08 09:29:24,464 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-08 09:29:24,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:24,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164334292] [2022-04-08 09:29:24,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164334292] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:24,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610140494] [2022-04-08 09:29:24,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:29:24,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:24,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:24,465 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-08 09:29:24,466 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-08 09:29:24,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:29:24,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:24,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 09:29:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:27,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {29777#true} call ULTIMATE.init(); {29777#true} is VALID [2022-04-08 09:29:27,801 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-08 09:29:27,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:27,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29777#true} #138#return; {29777#true} is VALID [2022-04-08 09:29:27,801 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-08 09:29:27,802 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-08 09:29:27,802 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-08 09:29:27,803 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-08 09:29:27,803 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-08 09:29:27,805 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-08 09:29:27,805 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-08 09:29:27,805 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-08 09:29:27,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:27,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:27,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:27,806 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-08 09:29:27,806 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-08 09:29:27,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:27,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:27,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:27,806 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-08 09:29:27,806 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-08 09:29:27,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:27,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:27,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:27,807 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-08 09:29:27,807 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-08 09:29:27,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:27,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:27,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:27,807 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-08 09:29:27,808 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-08 09:29:27,808 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-08 09:29:27,808 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-08 09:29:27,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:27,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:27,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:27,809 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-08 09:29:27,809 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-08 09:29:27,809 INFO L290 TraceCheckUtils]: 39: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:27,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:27,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:27,830 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-08 09:29:27,831 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-08 09:29:27,831 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-08 09:29:27,831 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-08 09:29:27,831 INFO L290 TraceCheckUtils]: 46: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:27,831 INFO L290 TraceCheckUtils]: 47: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:27,831 INFO L290 TraceCheckUtils]: 48: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:27,832 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-08 09:29:27,832 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-08 09:29:27,832 INFO L290 TraceCheckUtils]: 51: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:27,832 INFO L290 TraceCheckUtils]: 52: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:27,832 INFO L290 TraceCheckUtils]: 53: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:27,833 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-08 09:29:27,833 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-08 09:29:27,833 INFO L290 TraceCheckUtils]: 56: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:27,833 INFO L290 TraceCheckUtils]: 57: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:27,833 INFO L290 TraceCheckUtils]: 58: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:27,834 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-08 09:29:27,834 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-08 09:29:27,834 INFO L290 TraceCheckUtils]: 61: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-08 09:29:27,834 INFO L290 TraceCheckUtils]: 62: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-08 09:29:27,834 INFO L290 TraceCheckUtils]: 63: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-08 09:29:27,835 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-08 09:29:27,836 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-08 09:29:27,836 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-08 09:29:27,836 INFO L290 TraceCheckUtils]: 67: Hoare triple {29778#false} assume !(~j~0 < ~r~0); {29778#false} is VALID [2022-04-08 09:29:27,836 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-08 09:29:27,837 INFO L290 TraceCheckUtils]: 69: Hoare triple {29778#false} ~cond := #in~cond; {29778#false} is VALID [2022-04-08 09:29:27,837 INFO L290 TraceCheckUtils]: 70: Hoare triple {29778#false} assume !(0 == ~cond); {29778#false} is VALID [2022-04-08 09:29:27,837 INFO L290 TraceCheckUtils]: 71: Hoare triple {29778#false} assume true; {29778#false} is VALID [2022-04-08 09:29:27,837 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29778#false} {29778#false} #118#return; {29778#false} is VALID [2022-04-08 09:29:27,837 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-08 09:29:27,837 INFO L290 TraceCheckUtils]: 74: Hoare triple {29778#false} ~cond := #in~cond; {29778#false} is VALID [2022-04-08 09:29:27,837 INFO L290 TraceCheckUtils]: 75: Hoare triple {29778#false} assume !(0 == ~cond); {29778#false} is VALID [2022-04-08 09:29:27,837 INFO L290 TraceCheckUtils]: 76: Hoare triple {29778#false} assume true; {29778#false} is VALID [2022-04-08 09:29:27,837 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {29778#false} {29778#false} #120#return; {29778#false} is VALID [2022-04-08 09:29:27,837 INFO L290 TraceCheckUtils]: 78: Hoare triple {29778#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {29778#false} is VALID [2022-04-08 09:29:27,837 INFO L290 TraceCheckUtils]: 79: Hoare triple {29778#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {29778#false} is VALID [2022-04-08 09:29:27,837 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-08 09:29:27,837 INFO L290 TraceCheckUtils]: 81: Hoare triple {29778#false} ~cond := #in~cond; {29778#false} is VALID [2022-04-08 09:29:27,837 INFO L290 TraceCheckUtils]: 82: Hoare triple {29778#false} assume 0 == ~cond; {29778#false} is VALID [2022-04-08 09:29:27,837 INFO L290 TraceCheckUtils]: 83: Hoare triple {29778#false} assume !false; {29778#false} is VALID [2022-04-08 09:29:27,838 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-08 09:29:27,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 09:29:27,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610140494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:27,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 09:29:27,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2022-04-08 09:29:27,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:27,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [300944924] [2022-04-08 09:29:27,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [300944924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:27,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:27,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:29:27,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716964532] [2022-04-08 09:29:27,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:27,839 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-08 09:29:27,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:27,839 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-08 09:29:27,882 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-08 09:29:27,882 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:29:27,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:27,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:29:27,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:29:27,883 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-08 09:29:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:30,764 INFO L93 Difference]: Finished difference Result 714 states and 1123 transitions. [2022-04-08 09:29:30,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 09:29:30,764 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-08 09:29:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:30,764 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-08 09:29:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 224 transitions. [2022-04-08 09:29:30,766 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-08 09:29:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 224 transitions. [2022-04-08 09:29:30,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 224 transitions. [2022-04-08 09:29:30,944 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-08 09:29:30,954 INFO L225 Difference]: With dead ends: 714 [2022-04-08 09:29:30,954 INFO L226 Difference]: Without dead ends: 329 [2022-04-08 09:29:30,955 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-08 09:29:30,955 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-08 09:29:30,956 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-08 09:29:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-08 09:29:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 295. [2022-04-08 09:29:32,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:32,526 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-08 09:29:32,526 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-08 09:29:32,527 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-08 09:29:32,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:32,533 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-08 09:29:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-08 09:29:32,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:32,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:32,535 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-08 09:29:32,535 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-08 09:29:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:32,542 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-08 09:29:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-08 09:29:32,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:32,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:32,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:32,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:32,543 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-08 09:29:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 454 transitions. [2022-04-08 09:29:32,550 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 454 transitions. Word has length 84 [2022-04-08 09:29:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:32,551 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 454 transitions. [2022-04-08 09:29:32,551 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-08 09:29:32,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 295 states and 454 transitions. [2022-04-08 09:29:33,244 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-08 09:29:33,244 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 454 transitions. [2022-04-08 09:29:33,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 09:29:33,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:33,245 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-08 09:29:33,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 09:29:33,445 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-08 09:29:33,446 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:33,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:33,446 INFO L85 PathProgramCache]: Analyzing trace with hash -898087182, now seen corresponding path program 1 times [2022-04-08 09:29:33,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:33,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [790526684] [2022-04-08 09:29:33,801 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:33,801 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:33,801 INFO L85 PathProgramCache]: Analyzing trace with hash -898087182, now seen corresponding path program 2 times [2022-04-08 09:29:33,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:33,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613700658] [2022-04-08 09:29:33,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:33,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,872 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-08 09:29:33,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32779#true} {32779#true} #138#return; {32779#true} is VALID [2022-04-08 09:29:33,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:29:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #110#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:29:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #112#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-08 09:29:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #114#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 09:29:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #116#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 09:29:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #118#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 09:29:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #120#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-08 09:29:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #122#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-08 09:29:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #124#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-08 09:29:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #126#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 09:29:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #128#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-08 09:29:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #118#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:33,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-08 09:29:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #120#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:33,915 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-08 09:29:33,915 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-08 09:29:33,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32779#true} #138#return; {32779#true} is VALID [2022-04-08 09:29:33,916 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-08 09:29:33,916 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-08 09:29:33,916 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-08 09:29:33,916 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-08 09:29:33,917 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-08 09:29:33,917 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-08 09:29:33,917 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-08 09:29:33,917 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-08 09:29:33,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,918 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #110#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,918 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-08 09:29:33,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,918 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #112#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,918 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-08 09:29:33,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,919 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #114#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,919 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-08 09:29:33,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,919 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #116#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,920 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-08 09:29:33,920 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-08 09:29:33,920 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-08 09:29:33,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,920 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #118#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,920 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-08 09:29:33,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,921 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #120#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,921 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-08 09:29:33,921 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-08 09:29:33,921 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-08 09:29:33,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,922 INFO L290 TraceCheckUtils]: 48: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,922 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #122#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,922 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-08 09:29:33,922 INFO L290 TraceCheckUtils]: 51: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,922 INFO L290 TraceCheckUtils]: 52: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,922 INFO L290 TraceCheckUtils]: 53: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,922 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #124#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,923 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-08 09:29:33,923 INFO L290 TraceCheckUtils]: 56: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,923 INFO L290 TraceCheckUtils]: 57: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,923 INFO L290 TraceCheckUtils]: 58: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,923 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #126#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,923 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-08 09:29:33,923 INFO L290 TraceCheckUtils]: 61: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,923 INFO L290 TraceCheckUtils]: 62: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,923 INFO L290 TraceCheckUtils]: 63: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,924 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #128#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:33,924 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-08 09:29:33,924 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-08 09:29:33,924 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-08 09:29:33,924 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-08 09:29:33,924 INFO L290 TraceCheckUtils]: 69: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,925 INFO L290 TraceCheckUtils]: 70: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,925 INFO L290 TraceCheckUtils]: 71: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,925 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #118#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:33,925 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-08 09:29:33,925 INFO L290 TraceCheckUtils]: 74: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:33,925 INFO L290 TraceCheckUtils]: 75: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:33,925 INFO L290 TraceCheckUtils]: 76: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:33,925 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #120#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:33,926 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-08 09:29:33,926 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-08 09:29:33,926 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-08 09:29:33,927 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-08 09:29:33,927 INFO L290 TraceCheckUtils]: 82: Hoare triple {32836#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32780#false} is VALID [2022-04-08 09:29:33,927 INFO L290 TraceCheckUtils]: 83: Hoare triple {32780#false} assume !false; {32780#false} is VALID [2022-04-08 09:29:33,927 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-08 09:29:33,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:33,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613700658] [2022-04-08 09:29:33,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613700658] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:33,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481121110] [2022-04-08 09:29:33,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:29:33,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:33,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:33,928 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-08 09:29:33,931 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-08 09:29:33,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:29:33,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:33,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 09:29:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:38,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {32779#true} call ULTIMATE.init(); {32779#true} is VALID [2022-04-08 09:29:38,609 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-08 09:29:38,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:38,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32779#true} #138#return; {32779#true} is VALID [2022-04-08 09:29:38,609 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-08 09:29:38,609 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-08 09:29:38,610 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-08 09:29:38,610 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-08 09:29:38,611 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-08 09:29:38,611 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-08 09:29:38,611 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-08 09:29:38,611 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-08 09:29:38,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:38,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:38,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:38,612 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-08 09:29:38,612 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-08 09:29:38,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:38,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:38,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:38,612 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-08 09:29:38,613 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-08 09:29:38,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:38,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:38,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:38,613 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-08 09:29:38,613 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-08 09:29:38,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:38,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:38,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:38,614 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-08 09:29:38,614 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-08 09:29:38,614 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-08 09:29:38,614 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-08 09:29:38,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:38,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:38,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:38,615 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-08 09:29:38,615 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-08 09:29:38,615 INFO L290 TraceCheckUtils]: 39: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:38,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:38,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:38,616 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-08 09:29:38,616 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-08 09:29:38,616 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-08 09:29:38,616 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-08 09:29:38,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:38,616 INFO L290 TraceCheckUtils]: 47: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:38,616 INFO L290 TraceCheckUtils]: 48: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:38,617 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-08 09:29:38,617 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-08 09:29:38,617 INFO L290 TraceCheckUtils]: 51: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:38,617 INFO L290 TraceCheckUtils]: 52: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:38,617 INFO L290 TraceCheckUtils]: 53: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:38,617 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-08 09:29:38,618 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-08 09:29:38,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:38,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:38,618 INFO L290 TraceCheckUtils]: 58: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:38,618 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-08 09:29:38,618 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-08 09:29:38,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-08 09:29:38,618 INFO L290 TraceCheckUtils]: 62: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-08 09:29:38,618 INFO L290 TraceCheckUtils]: 63: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-08 09:29:38,619 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-08 09:29:38,619 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-08 09:29:38,620 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-08 09:29:38,620 INFO L290 TraceCheckUtils]: 67: Hoare triple {32780#false} assume !(~j~0 < ~r~0); {32780#false} is VALID [2022-04-08 09:29:38,620 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-08 09:29:38,620 INFO L290 TraceCheckUtils]: 69: Hoare triple {32780#false} ~cond := #in~cond; {32780#false} is VALID [2022-04-08 09:29:38,620 INFO L290 TraceCheckUtils]: 70: Hoare triple {32780#false} assume !(0 == ~cond); {32780#false} is VALID [2022-04-08 09:29:38,620 INFO L290 TraceCheckUtils]: 71: Hoare triple {32780#false} assume true; {32780#false} is VALID [2022-04-08 09:29:38,620 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {32780#false} {32780#false} #118#return; {32780#false} is VALID [2022-04-08 09:29:38,620 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-08 09:29:38,620 INFO L290 TraceCheckUtils]: 74: Hoare triple {32780#false} ~cond := #in~cond; {32780#false} is VALID [2022-04-08 09:29:38,620 INFO L290 TraceCheckUtils]: 75: Hoare triple {32780#false} assume !(0 == ~cond); {32780#false} is VALID [2022-04-08 09:29:38,620 INFO L290 TraceCheckUtils]: 76: Hoare triple {32780#false} assume true; {32780#false} is VALID [2022-04-08 09:29:38,620 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {32780#false} {32780#false} #120#return; {32780#false} is VALID [2022-04-08 09:29:38,621 INFO L290 TraceCheckUtils]: 78: Hoare triple {32780#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {32780#false} is VALID [2022-04-08 09:29:38,621 INFO L290 TraceCheckUtils]: 79: Hoare triple {32780#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {32780#false} is VALID [2022-04-08 09:29:38,621 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-08 09:29:38,621 INFO L290 TraceCheckUtils]: 81: Hoare triple {32780#false} ~cond := #in~cond; {32780#false} is VALID [2022-04-08 09:29:38,621 INFO L290 TraceCheckUtils]: 82: Hoare triple {32780#false} assume 0 == ~cond; {32780#false} is VALID [2022-04-08 09:29:38,621 INFO L290 TraceCheckUtils]: 83: Hoare triple {32780#false} assume !false; {32780#false} is VALID [2022-04-08 09:29:38,621 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-08 09:29:38,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 09:29:38,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481121110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:38,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 09:29:38,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-04-08 09:29:38,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:38,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [790526684] [2022-04-08 09:29:38,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [790526684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:38,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:38,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:29:38,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467244354] [2022-04-08 09:29:38,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:38,623 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-08 09:29:38,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:38,623 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-08 09:29:38,658 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-08 09:29:38,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:29:38,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:38,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:29:38,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:29:38,659 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-08 09:29:40,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:40,941 INFO L93 Difference]: Finished difference Result 549 states and 838 transitions. [2022-04-08 09:29:40,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:29:40,941 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-08 09:29:40,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:40,942 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-08 09:29:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-04-08 09:29:40,954 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-08 09:29:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-04-08 09:29:40,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 168 transitions. [2022-04-08 09:29:41,069 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-08 09:29:41,073 INFO L225 Difference]: With dead ends: 549 [2022-04-08 09:29:41,074 INFO L226 Difference]: Without dead ends: 249 [2022-04-08 09:29:41,074 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-08 09:29:41,075 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-08 09:29:41,075 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-08 09:29:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-08 09:29:42,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 238. [2022-04-08 09:29:42,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:42,298 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-08 09:29:42,298 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-08 09:29:42,299 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-08 09:29:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:42,304 INFO L93 Difference]: Finished difference Result 249 states and 369 transitions. [2022-04-08 09:29:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2022-04-08 09:29:42,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:42,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:42,305 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-08 09:29:42,305 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-08 09:29:42,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:42,310 INFO L93 Difference]: Finished difference Result 249 states and 369 transitions. [2022-04-08 09:29:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2022-04-08 09:29:42,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:42,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:42,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:42,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:42,311 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-08 09:29:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 354 transitions. [2022-04-08 09:29:42,316 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 354 transitions. Word has length 84 [2022-04-08 09:29:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:42,316 INFO L478 AbstractCegarLoop]: Abstraction has 238 states and 354 transitions. [2022-04-08 09:29:42,316 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-08 09:29:42,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 354 transitions. [2022-04-08 09:29:42,800 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-08 09:29:42,800 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 354 transitions. [2022-04-08 09:29:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 09:29:42,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:42,801 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-08 09:29:42,820 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-08 09:29:43,002 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-08 09:29:43,002 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:43,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:43,002 INFO L85 PathProgramCache]: Analyzing trace with hash -560912485, now seen corresponding path program 1 times [2022-04-08 09:29:43,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:43,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1006522037] [2022-04-08 09:29:43,003 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:43,003 INFO L85 PathProgramCache]: Analyzing trace with hash -560912485, now seen corresponding path program 2 times [2022-04-08 09:29:43,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:43,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898040982] [2022-04-08 09:29:43,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:43,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,072 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-08 09:29:43,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,072 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-08 09:29:43,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:29:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #118#return; {35169#true} is VALID [2022-04-08 09:29:43,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:29:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #120#return; {35169#true} is VALID [2022-04-08 09:29:43,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 09:29:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #130#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:43,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 09:29:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #132#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:43,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 09:29:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #110#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:43,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-08 09:29:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #112#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:43,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 09:29:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #114#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:43,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-08 09:29:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #116#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:43,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 09:29:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #118#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:43,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 09:29:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #120#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:43,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 09:29:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #122#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:43,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-08 09:29:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #124#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:43,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 09:29:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #126#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:43,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-08 09:29:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #128#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:43,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-08 09:29:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #118#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-08 09:29:43,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-08 09:29:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #120#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-08 09:29:43,137 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-08 09:29:43,137 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-08 09:29:43,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-08 09:29:43,137 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-08 09:29:43,137 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-08 09:29:43,137 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-08 09:29:43,137 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-08 09:29:43,137 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-08 09:29:43,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {35169#true} assume !!(~j~0 <= ~r~0); {35169#true} is VALID [2022-04-08 09:29:43,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {35169#true} assume !(~j~0 < ~r~0); {35169#true} is VALID [2022-04-08 09:29:43,137 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-08 09:29:43,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,137 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35169#true} {35169#true} #118#return; {35169#true} is VALID [2022-04-08 09:29:43,138 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-08 09:29:43,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,138 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {35169#true} {35169#true} #120#return; {35169#true} is VALID [2022-04-08 09:29:43,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {35169#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35169#true} is VALID [2022-04-08 09:29:43,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {35169#true} assume 0 != #t~nondet5;havoc #t~nondet5; {35169#true} is VALID [2022-04-08 09:29:43,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {35169#true} assume ~l~0 > 1; {35182#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:43,138 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-08 09:29:43,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,139 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #130#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:43,139 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-08 09:29:43,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,139 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #132#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:43,140 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-08 09:29:43,140 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-08 09:29:43,140 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-08 09:29:43,141 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-08 09:29:43,141 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-08 09:29:43,141 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,141 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,141 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #110#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:43,141 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-08 09:29:43,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,141 INFO L290 TraceCheckUtils]: 46: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,142 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #112#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:43,142 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-08 09:29:43,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,142 INFO L290 TraceCheckUtils]: 51: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,142 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #114#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:43,142 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-08 09:29:43,142 INFO L290 TraceCheckUtils]: 54: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,142 INFO L290 TraceCheckUtils]: 55: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,142 INFO L290 TraceCheckUtils]: 56: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,143 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #116#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:43,143 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-08 09:29:43,143 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-08 09:29:43,143 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-08 09:29:43,143 INFO L290 TraceCheckUtils]: 61: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,144 INFO L290 TraceCheckUtils]: 62: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,144 INFO L290 TraceCheckUtils]: 63: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,144 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #118#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:43,144 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-08 09:29:43,144 INFO L290 TraceCheckUtils]: 66: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,144 INFO L290 TraceCheckUtils]: 67: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,144 INFO L290 TraceCheckUtils]: 68: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,144 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #120#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:43,145 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-08 09:29:43,145 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-08 09:29:43,145 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-08 09:29:43,145 INFO L290 TraceCheckUtils]: 73: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,145 INFO L290 TraceCheckUtils]: 74: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,145 INFO L290 TraceCheckUtils]: 75: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,145 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #122#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:43,146 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-08 09:29:43,146 INFO L290 TraceCheckUtils]: 78: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,146 INFO L290 TraceCheckUtils]: 79: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,146 INFO L290 TraceCheckUtils]: 80: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,146 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #124#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:43,146 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-08 09:29:43,146 INFO L290 TraceCheckUtils]: 83: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,146 INFO L290 TraceCheckUtils]: 84: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,146 INFO L290 TraceCheckUtils]: 85: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,147 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #126#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:43,147 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-08 09:29:43,147 INFO L290 TraceCheckUtils]: 88: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,147 INFO L290 TraceCheckUtils]: 89: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,147 INFO L290 TraceCheckUtils]: 90: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,147 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #128#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-08 09:29:43,147 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-08 09:29:43,148 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-08 09:29:43,148 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-08 09:29:43,148 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-08 09:29:43,148 INFO L290 TraceCheckUtils]: 96: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,148 INFO L290 TraceCheckUtils]: 97: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,148 INFO L290 TraceCheckUtils]: 98: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,149 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #118#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-08 09:29:43,149 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-08 09:29:43,149 INFO L290 TraceCheckUtils]: 101: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:43,149 INFO L290 TraceCheckUtils]: 102: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:43,149 INFO L290 TraceCheckUtils]: 103: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:43,149 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #120#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-08 09:29:43,149 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-08 09:29:43,150 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-08 09:29:43,150 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-08 09:29:43,150 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-08 09:29:43,151 INFO L290 TraceCheckUtils]: 109: Hoare triple {35244#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {35170#false} is VALID [2022-04-08 09:29:43,151 INFO L290 TraceCheckUtils]: 110: Hoare triple {35170#false} assume !false; {35170#false} is VALID [2022-04-08 09:29:43,151 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-08 09:29:43,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:43,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898040982] [2022-04-08 09:29:43,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898040982] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:43,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230600664] [2022-04-08 09:29:43,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:29:43,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:43,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:43,168 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-08 09:29:43,187 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-08 09:29:43,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:29:43,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:43,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 09:29:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:43,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:48,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {35169#true} call ULTIMATE.init(); {35169#true} is VALID [2022-04-08 09:29:48,062 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-08 09:29:48,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-08 09:29:48,062 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-08 09:29:48,062 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-08 09:29:48,062 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-08 09:29:48,062 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-08 09:29:48,063 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-08 09:29:48,083 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-08 09:29:48,085 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-08 09:29:48,085 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-08 09:29:48,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,085 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-08 09:29:48,085 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-08 09:29:48,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,086 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-08 09:29:48,086 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-08 09:29:48,087 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-08 09:29:48,087 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-08 09:29:48,087 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-08 09:29:48,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,088 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-08 09:29:48,088 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-08 09:29:48,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,088 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-08 09:29:48,089 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-08 09:29:48,089 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-08 09:29:48,090 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-08 09:29:48,090 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-08 09:29:48,090 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-08 09:29:48,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,091 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-08 09:29:48,091 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-08 09:29:48,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,091 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-08 09:29:48,091 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-08 09:29:48,091 INFO L290 TraceCheckUtils]: 49: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,092 INFO L290 TraceCheckUtils]: 51: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,092 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-08 09:29:48,092 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-08 09:29:48,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,092 INFO L290 TraceCheckUtils]: 55: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,092 INFO L290 TraceCheckUtils]: 56: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,093 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-08 09:29:48,093 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-08 09:29:48,094 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-08 09:29:48,094 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-08 09:29:48,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,094 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-08 09:29:48,094 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-08 09:29:48,094 INFO L290 TraceCheckUtils]: 66: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,094 INFO L290 TraceCheckUtils]: 67: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,094 INFO L290 TraceCheckUtils]: 68: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,095 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-08 09:29:48,095 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-08 09:29:48,096 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-08 09:29:48,096 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-08 09:29:48,096 INFO L290 TraceCheckUtils]: 73: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,096 INFO L290 TraceCheckUtils]: 74: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,096 INFO L290 TraceCheckUtils]: 75: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,096 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-08 09:29:48,096 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-08 09:29:48,096 INFO L290 TraceCheckUtils]: 78: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,096 INFO L290 TraceCheckUtils]: 79: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,096 INFO L290 TraceCheckUtils]: 80: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,097 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-08 09:29:48,097 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-08 09:29:48,097 INFO L290 TraceCheckUtils]: 83: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,097 INFO L290 TraceCheckUtils]: 84: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,097 INFO L290 TraceCheckUtils]: 85: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,097 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-08 09:29:48,098 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-08 09:29:48,098 INFO L290 TraceCheckUtils]: 88: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,098 INFO L290 TraceCheckUtils]: 89: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,098 INFO L290 TraceCheckUtils]: 90: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,098 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-08 09:29:48,099 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-08 09:29:48,099 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-08 09:29:48,100 INFO L290 TraceCheckUtils]: 94: Hoare triple {35170#false} assume !(~j~0 < ~r~0); {35170#false} is VALID [2022-04-08 09:29:48,100 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-08 09:29:48,100 INFO L290 TraceCheckUtils]: 96: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-08 09:29:48,100 INFO L290 TraceCheckUtils]: 97: Hoare triple {35170#false} assume !(0 == ~cond); {35170#false} is VALID [2022-04-08 09:29:48,100 INFO L290 TraceCheckUtils]: 98: Hoare triple {35170#false} assume true; {35170#false} is VALID [2022-04-08 09:29:48,100 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35170#false} {35170#false} #118#return; {35170#false} is VALID [2022-04-08 09:29:48,100 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-08 09:29:48,100 INFO L290 TraceCheckUtils]: 101: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-08 09:29:48,100 INFO L290 TraceCheckUtils]: 102: Hoare triple {35170#false} assume !(0 == ~cond); {35170#false} is VALID [2022-04-08 09:29:48,100 INFO L290 TraceCheckUtils]: 103: Hoare triple {35170#false} assume true; {35170#false} is VALID [2022-04-08 09:29:48,100 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35170#false} {35170#false} #120#return; {35170#false} is VALID [2022-04-08 09:29:48,100 INFO L290 TraceCheckUtils]: 105: Hoare triple {35170#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35170#false} is VALID [2022-04-08 09:29:48,100 INFO L290 TraceCheckUtils]: 106: Hoare triple {35170#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {35170#false} is VALID [2022-04-08 09:29:48,100 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-08 09:29:48,100 INFO L290 TraceCheckUtils]: 108: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-08 09:29:48,100 INFO L290 TraceCheckUtils]: 109: Hoare triple {35170#false} assume 0 == ~cond; {35170#false} is VALID [2022-04-08 09:29:48,100 INFO L290 TraceCheckUtils]: 110: Hoare triple {35170#false} assume !false; {35170#false} is VALID [2022-04-08 09:29:48,101 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-08 09:29:48,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:29:48,842 INFO L290 TraceCheckUtils]: 110: Hoare triple {35170#false} assume !false; {35170#false} is VALID [2022-04-08 09:29:48,842 INFO L290 TraceCheckUtils]: 109: Hoare triple {35170#false} assume 0 == ~cond; {35170#false} is VALID [2022-04-08 09:29:48,842 INFO L290 TraceCheckUtils]: 108: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-08 09:29:48,842 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-08 09:29:48,842 INFO L290 TraceCheckUtils]: 106: Hoare triple {35170#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {35170#false} is VALID [2022-04-08 09:29:48,842 INFO L290 TraceCheckUtils]: 105: Hoare triple {35170#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35170#false} is VALID [2022-04-08 09:29:48,842 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35169#true} {35170#false} #120#return; {35170#false} is VALID [2022-04-08 09:29:48,842 INFO L290 TraceCheckUtils]: 103: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,842 INFO L290 TraceCheckUtils]: 102: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,842 INFO L290 TraceCheckUtils]: 101: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,843 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-08 09:29:48,843 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35169#true} {35170#false} #118#return; {35170#false} is VALID [2022-04-08 09:29:48,843 INFO L290 TraceCheckUtils]: 98: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,843 INFO L290 TraceCheckUtils]: 97: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,843 INFO L290 TraceCheckUtils]: 96: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,843 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-08 09:29:48,843 INFO L290 TraceCheckUtils]: 94: Hoare triple {35170#false} assume !(~j~0 < ~r~0); {35170#false} is VALID [2022-04-08 09:29:48,843 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-08 09:29:48,844 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-08 09:29:48,844 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-08 09:29:48,844 INFO L290 TraceCheckUtils]: 90: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,844 INFO L290 TraceCheckUtils]: 89: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,844 INFO L290 TraceCheckUtils]: 88: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,844 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-08 09:29:48,845 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-08 09:29:48,845 INFO L290 TraceCheckUtils]: 85: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,845 INFO L290 TraceCheckUtils]: 84: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,845 INFO L290 TraceCheckUtils]: 83: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,845 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-08 09:29:48,846 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-08 09:29:48,846 INFO L290 TraceCheckUtils]: 80: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,846 INFO L290 TraceCheckUtils]: 79: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,846 INFO L290 TraceCheckUtils]: 78: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,846 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-08 09:29:48,856 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-08 09:29:48,856 INFO L290 TraceCheckUtils]: 75: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,856 INFO L290 TraceCheckUtils]: 74: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,857 INFO L290 TraceCheckUtils]: 73: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,857 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-08 09:29:48,857 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-08 09:29:48,857 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-08 09:29:48,858 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-08 09:29:48,858 INFO L290 TraceCheckUtils]: 68: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,858 INFO L290 TraceCheckUtils]: 67: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,858 INFO L290 TraceCheckUtils]: 66: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,858 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-08 09:29:48,862 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-08 09:29:48,862 INFO L290 TraceCheckUtils]: 63: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,862 INFO L290 TraceCheckUtils]: 62: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,862 INFO L290 TraceCheckUtils]: 61: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,862 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-08 09:29:48,863 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-08 09:29:48,863 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-08 09:29:48,863 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-08 09:29:48,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,863 INFO L290 TraceCheckUtils]: 55: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,863 INFO L290 TraceCheckUtils]: 54: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,864 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-08 09:29:48,864 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-08 09:29:48,864 INFO L290 TraceCheckUtils]: 51: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,864 INFO L290 TraceCheckUtils]: 50: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,864 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-08 09:29:48,864 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-08 09:29:48,865 INFO L290 TraceCheckUtils]: 46: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,865 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-08 09:29:48,865 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-08 09:29:48,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,865 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,865 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,865 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-08 09:29:48,866 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-08 09:29:48,866 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-08 09:29:48,866 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-08 09:29:48,867 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-08 09:29:48,867 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-08 09:29:48,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,868 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-08 09:29:48,871 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-08 09:29:48,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,872 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-08 09:29:48,872 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-08 09:29:48,872 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-08 09:29:48,873 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-08 09:29:48,873 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-08 09:29:48,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,873 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-08 09:29:48,874 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-08 09:29:48,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-08 09:29:48,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-08 09:29:48,874 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-08 09:29:48,875 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-08 09:29:48,875 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-08 09:29:48,875 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-08 09:29:48,876 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-08 09:29:48,876 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-08 09:29:48,876 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-08 09:29:48,876 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-08 09:29:48,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-08 09:29:48,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-08 09:29:48,876 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-08 09:29:48,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {35169#true} call ULTIMATE.init(); {35169#true} is VALID [2022-04-08 09:29:48,876 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-08 09:29:48,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230600664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:29:48,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:29:48,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2022-04-08 09:29:48,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:48,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1006522037] [2022-04-08 09:29:48,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1006522037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:48,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:48,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:29:48,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499433033] [2022-04-08 09:29:48,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:48,877 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-08 09:29:48,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:48,878 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-08 09:29:48,919 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-08 09:29:48,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:29:48,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:48,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:29:48,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-04-08 09:29:48,920 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-08 09:29:52,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:52,487 INFO L93 Difference]: Finished difference Result 350 states and 539 transitions. [2022-04-08 09:29:52,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 09:29:52,487 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-08 09:29:52,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:52,487 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-08 09:29:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-04-08 09:29:52,489 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-08 09:29:52,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-04-08 09:29:52,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 151 transitions. [2022-04-08 09:29:52,614 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-08 09:29:52,631 INFO L225 Difference]: With dead ends: 350 [2022-04-08 09:29:52,631 INFO L226 Difference]: Without dead ends: 348 [2022-04-08 09:29:52,631 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-08 09:29:52,632 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 69 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:52,632 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.7s Time] [2022-04-08 09:29:52,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-08 09:29:54,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 294. [2022-04-08 09:29:54,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:54,208 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-08 09:29:54,209 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-08 09:29:54,209 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-08 09:29:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:54,216 INFO L93 Difference]: Finished difference Result 348 states and 537 transitions. [2022-04-08 09:29:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 537 transitions. [2022-04-08 09:29:54,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:54,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:54,217 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-08 09:29:54,218 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-08 09:29:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:54,225 INFO L93 Difference]: Finished difference Result 348 states and 537 transitions. [2022-04-08 09:29:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 537 transitions. [2022-04-08 09:29:54,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:54,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:54,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:54,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:54,226 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-08 09:29:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 451 transitions. [2022-04-08 09:29:54,233 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 451 transitions. Word has length 111 [2022-04-08 09:29:54,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:54,233 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 451 transitions. [2022-04-08 09:29:54,233 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-08 09:29:54,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 294 states and 451 transitions. [2022-04-08 09:29:54,860 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-08 09:29:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 451 transitions. [2022-04-08 09:29:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 09:29:54,861 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:54,861 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-08 09:29:54,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 09:29:55,077 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-08 09:29:55,078 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:55,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:55,078 INFO L85 PathProgramCache]: Analyzing trace with hash 977427545, now seen corresponding path program 1 times [2022-04-08 09:29:55,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:55,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [922484891] [2022-04-08 09:29:55,078 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:55,078 INFO L85 PathProgramCache]: Analyzing trace with hash 977427545, now seen corresponding path program 2 times [2022-04-08 09:29:55,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:55,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457494525] [2022-04-08 09:29:55,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:55,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,146 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-08 09:29:55,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-08 09:29:55,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:29:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #118#return; {37933#true} is VALID [2022-04-08 09:29:55,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:29:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #120#return; {37933#true} is VALID [2022-04-08 09:29:55,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 09:29:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #130#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:55,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 09:29:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #132#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:55,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 09:29:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #110#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-08 09:29:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #112#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 09:29:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #114#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-08 09:29:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #116#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 09:29:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #118#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 09:29:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #120#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 09:29:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #122#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-08 09:29:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #124#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 09:29:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #126#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-08 09:29:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #128#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-08 09:29:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #118#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:55,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-08 09:29:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #120#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:55,199 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-08 09:29:55,199 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-08 09:29:55,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-08 09:29:55,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-08 09:29:55,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-08 09:29:55,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-08 09:29:55,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-08 09:29:55,200 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-08 09:29:55,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {37933#true} assume !!(~j~0 <= ~r~0); {37933#true} is VALID [2022-04-08 09:29:55,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {37933#true} assume !(~j~0 < ~r~0); {37933#true} is VALID [2022-04-08 09:29:55,200 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-08 09:29:55,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,200 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37933#true} {37933#true} #118#return; {37933#true} is VALID [2022-04-08 09:29:55,200 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-08 09:29:55,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,200 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37933#true} {37933#true} #120#return; {37933#true} is VALID [2022-04-08 09:29:55,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {37933#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {37933#true} is VALID [2022-04-08 09:29:55,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {37933#true} assume 0 != #t~nondet5;havoc #t~nondet5; {37933#true} is VALID [2022-04-08 09:29:55,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {37933#true} assume ~l~0 > 1; {37946#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:55,201 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-08 09:29:55,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,201 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #130#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:55,201 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-08 09:29:55,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,202 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #132#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-08 09:29:55,202 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-08 09:29:55,202 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-08 09:29:55,203 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-08 09:29:55,203 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-08 09:29:55,203 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-08 09:29:55,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,204 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #110#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,204 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-08 09:29:55,204 INFO L290 TraceCheckUtils]: 44: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,204 INFO L290 TraceCheckUtils]: 46: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,204 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #112#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,204 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-08 09:29:55,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,204 INFO L290 TraceCheckUtils]: 51: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,205 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #114#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,205 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-08 09:29:55,205 INFO L290 TraceCheckUtils]: 54: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,205 INFO L290 TraceCheckUtils]: 55: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,205 INFO L290 TraceCheckUtils]: 56: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,205 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #116#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,205 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-08 09:29:55,206 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-08 09:29:55,206 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-08 09:29:55,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,206 INFO L290 TraceCheckUtils]: 62: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,206 INFO L290 TraceCheckUtils]: 63: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,206 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #118#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,206 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-08 09:29:55,206 INFO L290 TraceCheckUtils]: 66: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,206 INFO L290 TraceCheckUtils]: 67: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,206 INFO L290 TraceCheckUtils]: 68: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,207 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #120#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,207 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-08 09:29:55,207 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-08 09:29:55,207 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-08 09:29:55,207 INFO L290 TraceCheckUtils]: 73: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,207 INFO L290 TraceCheckUtils]: 74: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,207 INFO L290 TraceCheckUtils]: 75: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,208 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #122#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,208 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-08 09:29:55,208 INFO L290 TraceCheckUtils]: 78: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,208 INFO L290 TraceCheckUtils]: 79: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,208 INFO L290 TraceCheckUtils]: 80: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,208 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #124#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,208 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-08 09:29:55,208 INFO L290 TraceCheckUtils]: 83: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,208 INFO L290 TraceCheckUtils]: 84: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,208 INFO L290 TraceCheckUtils]: 85: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,209 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #126#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,209 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-08 09:29:55,209 INFO L290 TraceCheckUtils]: 88: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,209 INFO L290 TraceCheckUtils]: 89: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,209 INFO L290 TraceCheckUtils]: 90: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,209 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #128#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-08 09:29:55,210 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-08 09:29:55,210 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-08 09:29:55,210 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-08 09:29:55,210 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-08 09:29:55,210 INFO L290 TraceCheckUtils]: 96: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,210 INFO L290 TraceCheckUtils]: 97: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,210 INFO L290 TraceCheckUtils]: 98: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,210 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #118#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:55,211 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-08 09:29:55,211 INFO L290 TraceCheckUtils]: 101: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:55,211 INFO L290 TraceCheckUtils]: 102: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:55,211 INFO L290 TraceCheckUtils]: 103: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:55,211 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #120#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:55,211 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-08 09:29:55,211 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-08 09:29:55,212 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-08 09:29:55,212 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-08 09:29:55,212 INFO L290 TraceCheckUtils]: 109: Hoare triple {38007#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {37934#false} is VALID [2022-04-08 09:29:55,212 INFO L290 TraceCheckUtils]: 110: Hoare triple {37934#false} assume !false; {37934#false} is VALID [2022-04-08 09:29:55,213 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-08 09:29:55,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:55,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457494525] [2022-04-08 09:29:55,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457494525] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:55,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546686908] [2022-04-08 09:29:55,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:29:55,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:55,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:55,214 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-08 09:29:55,216 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-08 09:29:55,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:29:55,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:55,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 09:29:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:55,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:57,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {37933#true} call ULTIMATE.init(); {37933#true} is VALID [2022-04-08 09:29:57,778 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-08 09:29:57,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-08 09:29:57,778 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-08 09:29:57,778 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-08 09:29:57,778 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-08 09:29:57,778 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-08 09:29:57,779 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-08 09:29:57,779 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-08 09:29:57,779 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-08 09:29:57,780 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-08 09:29:57,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,780 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-08 09:29:57,780 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-08 09:29:57,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,781 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-08 09:29:57,781 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-08 09:29:57,781 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-08 09:29:57,782 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-08 09:29:57,782 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-08 09:29:57,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,782 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-08 09:29:57,782 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-08 09:29:57,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,783 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-08 09:29:57,783 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-08 09:29:57,784 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-08 09:29:57,784 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-08 09:29:57,784 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-08 09:29:57,785 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-08 09:29:57,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,785 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-08 09:29:57,785 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-08 09:29:57,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,786 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-08 09:29:57,786 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-08 09:29:57,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,786 INFO L290 TraceCheckUtils]: 51: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,786 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-08 09:29:57,786 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-08 09:29:57,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,786 INFO L290 TraceCheckUtils]: 55: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,787 INFO L290 TraceCheckUtils]: 56: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,787 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-08 09:29:57,787 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-08 09:29:57,788 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-08 09:29:57,788 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-08 09:29:57,788 INFO L290 TraceCheckUtils]: 61: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,788 INFO L290 TraceCheckUtils]: 62: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,788 INFO L290 TraceCheckUtils]: 63: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,788 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-08 09:29:57,788 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-08 09:29:57,788 INFO L290 TraceCheckUtils]: 66: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,788 INFO L290 TraceCheckUtils]: 67: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,788 INFO L290 TraceCheckUtils]: 68: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,789 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-08 09:29:57,789 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-08 09:29:57,789 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-08 09:29:57,790 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-08 09:29:57,790 INFO L290 TraceCheckUtils]: 73: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,790 INFO L290 TraceCheckUtils]: 74: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,790 INFO L290 TraceCheckUtils]: 75: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,790 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-08 09:29:57,790 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-08 09:29:57,790 INFO L290 TraceCheckUtils]: 78: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,790 INFO L290 TraceCheckUtils]: 79: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,790 INFO L290 TraceCheckUtils]: 80: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,791 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-08 09:29:57,791 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-08 09:29:57,791 INFO L290 TraceCheckUtils]: 83: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,791 INFO L290 TraceCheckUtils]: 84: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,791 INFO L290 TraceCheckUtils]: 85: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,791 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-08 09:29:57,791 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-08 09:29:57,791 INFO L290 TraceCheckUtils]: 88: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,792 INFO L290 TraceCheckUtils]: 89: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,792 INFO L290 TraceCheckUtils]: 90: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,792 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-08 09:29:57,793 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-08 09:29:57,793 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-08 09:29:57,794 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-08 09:29:57,794 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-08 09:29:57,794 INFO L290 TraceCheckUtils]: 96: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,794 INFO L290 TraceCheckUtils]: 97: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,794 INFO L290 TraceCheckUtils]: 98: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,794 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #118#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:57,794 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-08 09:29:57,794 INFO L290 TraceCheckUtils]: 101: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:57,794 INFO L290 TraceCheckUtils]: 102: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:57,794 INFO L290 TraceCheckUtils]: 103: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:57,809 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #120#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:57,809 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-08 09:29:57,810 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-08 09:29:57,810 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-08 09:29:57,810 INFO L290 TraceCheckUtils]: 108: Hoare triple {38338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:29:57,811 INFO L290 TraceCheckUtils]: 109: Hoare triple {38342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37934#false} is VALID [2022-04-08 09:29:57,811 INFO L290 TraceCheckUtils]: 110: Hoare triple {37934#false} assume !false; {37934#false} is VALID [2022-04-08 09:29:57,811 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-08 09:29:57,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:29:59,003 INFO L290 TraceCheckUtils]: 110: Hoare triple {37934#false} assume !false; {37934#false} is VALID [2022-04-08 09:29:59,004 INFO L290 TraceCheckUtils]: 109: Hoare triple {38342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37934#false} is VALID [2022-04-08 09:29:59,004 INFO L290 TraceCheckUtils]: 108: Hoare triple {38338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:29:59,004 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-08 09:29:59,004 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-08 09:29:59,005 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-08 09:29:59,005 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {37933#true} {38358#(<= 1 main_~i~0)} #120#return; {38358#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:59,005 INFO L290 TraceCheckUtils]: 103: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,005 INFO L290 TraceCheckUtils]: 102: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,005 INFO L290 TraceCheckUtils]: 101: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,005 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-08 09:29:59,006 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {37933#true} {38358#(<= 1 main_~i~0)} #118#return; {38358#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:59,006 INFO L290 TraceCheckUtils]: 98: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,006 INFO L290 TraceCheckUtils]: 97: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,006 INFO L290 TraceCheckUtils]: 96: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,006 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-08 09:29:59,006 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-08 09:29:59,007 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-08 09:29:59,007 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-08 09:29:59,007 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-08 09:29:59,008 INFO L290 TraceCheckUtils]: 90: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,008 INFO L290 TraceCheckUtils]: 89: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,008 INFO L290 TraceCheckUtils]: 88: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,008 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-08 09:29:59,008 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-08 09:29:59,008 INFO L290 TraceCheckUtils]: 85: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,008 INFO L290 TraceCheckUtils]: 84: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,008 INFO L290 TraceCheckUtils]: 83: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,008 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-08 09:29:59,009 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-08 09:29:59,009 INFO L290 TraceCheckUtils]: 80: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,009 INFO L290 TraceCheckUtils]: 79: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,009 INFO L290 TraceCheckUtils]: 78: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,009 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-08 09:29:59,009 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-08 09:29:59,009 INFO L290 TraceCheckUtils]: 75: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,009 INFO L290 TraceCheckUtils]: 74: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,010 INFO L290 TraceCheckUtils]: 73: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,010 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-08 09:29:59,010 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-08 09:29:59,010 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-08 09:29:59,011 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-08 09:29:59,011 INFO L290 TraceCheckUtils]: 68: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,011 INFO L290 TraceCheckUtils]: 67: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,011 INFO L290 TraceCheckUtils]: 66: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,011 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-08 09:29:59,011 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-08 09:29:59,011 INFO L290 TraceCheckUtils]: 63: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,011 INFO L290 TraceCheckUtils]: 62: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,011 INFO L290 TraceCheckUtils]: 61: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,011 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-08 09:29:59,012 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-08 09:29:59,012 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-08 09:29:59,012 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-08 09:29:59,013 INFO L290 TraceCheckUtils]: 56: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,013 INFO L290 TraceCheckUtils]: 55: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,013 INFO L290 TraceCheckUtils]: 54: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,013 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-08 09:29:59,028 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-08 09:29:59,028 INFO L290 TraceCheckUtils]: 51: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,028 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-08 09:29:59,029 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-08 09:29:59,029 INFO L290 TraceCheckUtils]: 46: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,029 INFO L290 TraceCheckUtils]: 45: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,029 INFO L290 TraceCheckUtils]: 44: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,029 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-08 09:29:59,029 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-08 09:29:59,029 INFO L290 TraceCheckUtils]: 41: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,030 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-08 09:29:59,030 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-08 09:29:59,030 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-08 09:29:59,031 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-08 09:29:59,031 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-08 09:29:59,032 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-08 09:29:59,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,032 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-08 09:29:59,032 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-08 09:29:59,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,033 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-08 09:29:59,033 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-08 09:29:59,033 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-08 09:29:59,033 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-08 09:29:59,034 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-08 09:29:59,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,034 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-08 09:29:59,034 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-08 09:29:59,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-08 09:29:59,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-08 09:29:59,035 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-08 09:29:59,035 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-08 09:29:59,035 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-08 09:29:59,036 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-08 09:29:59,036 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-08 09:29:59,036 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-08 09:29:59,036 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-08 09:29:59,036 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-08 09:29:59,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-08 09:29:59,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-08 09:29:59,036 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-08 09:29:59,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {37933#true} call ULTIMATE.init(); {37933#true} is VALID [2022-04-08 09:29:59,037 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-08 09:29:59,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546686908] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:29:59,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:29:59,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 22 [2022-04-08 09:29:59,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:59,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [922484891] [2022-04-08 09:29:59,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [922484891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:59,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:59,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:29:59,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837278685] [2022-04-08 09:29:59,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:59,038 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-08 09:29:59,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:59,038 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-08 09:29:59,080 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-08 09:29:59,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:29:59,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:59,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:29:59,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:29:59,081 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-08 09:30:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:30:01,798 INFO L93 Difference]: Finished difference Result 323 states and 492 transitions. [2022-04-08 09:30:01,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:30:01,798 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-08 09:30:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:30:01,798 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-08 09:30:01,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2022-04-08 09:30:01,799 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-08 09:30:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2022-04-08 09:30:01,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 107 transitions. [2022-04-08 09:30:01,891 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-08 09:30:01,897 INFO L225 Difference]: With dead ends: 323 [2022-04-08 09:30:01,897 INFO L226 Difference]: Without dead ends: 321 [2022-04-08 09:30:01,898 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2022-04-08 09:30:01,898 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-08 09:30:01,898 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-08 09:30:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-08 09:30:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 242. [2022-04-08 09:30:03,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:30:03,174 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-08 09:30:03,175 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-08 09:30:03,175 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-08 09:30:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:30:03,181 INFO L93 Difference]: Finished difference Result 321 states and 490 transitions. [2022-04-08 09:30:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 490 transitions. [2022-04-08 09:30:03,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:30:03,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:30:03,182 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-08 09:30:03,182 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-08 09:30:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:30:03,189 INFO L93 Difference]: Finished difference Result 321 states and 490 transitions. [2022-04-08 09:30:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 490 transitions. [2022-04-08 09:30:03,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:30:03,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:30:03,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:30:03,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:30:03,190 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-08 09:30:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 357 transitions. [2022-04-08 09:30:03,194 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 357 transitions. Word has length 111 [2022-04-08 09:30:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:30:03,195 INFO L478 AbstractCegarLoop]: Abstraction has 242 states and 357 transitions. [2022-04-08 09:30:03,195 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-08 09:30:03,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 357 transitions. [2022-04-08 09:30:03,699 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-08 09:30:03,699 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 357 transitions. [2022-04-08 09:30:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-08 09:30:03,700 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:30:03,700 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-08 09:30:03,716 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-08 09:30:03,900 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-08 09:30:03,901 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:30:03,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:30:03,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1099325000, now seen corresponding path program 3 times [2022-04-08 09:30:03,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:30:03,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [731096831] [2022-04-08 09:30:03,902 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:30:03,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1099325000, now seen corresponding path program 4 times [2022-04-08 09:30:03,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:30:03,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090837901] [2022-04-08 09:30:03,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:30:03,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:30:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:30:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,043 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-08 09:30:04,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-08 09:30:04,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:30:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,046 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-08 09:30:04,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:30:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,049 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-08 09:30:04,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 09:30:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,052 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-08 09:30:04,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 09:30:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,054 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-08 09:30:04,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 09:30:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,071 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-08 09:30:04,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-08 09:30:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,081 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-08 09:30:04,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 09:30:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,087 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-08 09:30:04,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-08 09:30:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,090 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-08 09:30:04,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 09:30:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,098 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-08 09:30:04,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 09:30:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,101 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-08 09:30:04,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 09:30:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,106 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-08 09:30:04,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-08 09:30:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,109 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-08 09:30:04,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 09:30:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,112 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-08 09:30:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-08 09:30:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,115 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-08 09:30:04,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-08 09:30:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40478#false} #118#return; {40478#false} is VALID [2022-04-08 09:30:04,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-08 09:30:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40478#false} #120#return; {40478#false} is VALID [2022-04-08 09:30:04,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-04-08 09:30:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40478#false} #122#return; {40478#false} is VALID [2022-04-08 09:30:04,121 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-08 09:30:04,121 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-08 09:30:04,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-08 09:30:04,121 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-08 09:30:04,121 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-08 09:30:04,121 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-08 09:30:04,121 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-08 09:30:04,122 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-08 09:30:04,122 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-08 09:30:04,122 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-08 09:30:04,122 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-08 09:30:04,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,123 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-08 09:30:04,123 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-08 09:30:04,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,124 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-08 09:30:04,124 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-08 09:30:04,124 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-08 09:30:04,125 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-08 09:30:04,125 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-08 09:30:04,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,125 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-08 09:30:04,125 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-08 09:30:04,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,126 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-08 09:30:04,126 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-08 09:30:04,126 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-08 09:30:04,127 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-08 09:30:04,127 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-08 09:30:04,127 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-08 09:30:04,127 INFO L290 TraceCheckUtils]: 39: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,127 INFO L290 TraceCheckUtils]: 41: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,128 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-08 09:30:04,128 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-08 09:30:04,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,128 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-08 09:30:04,128 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-08 09:30:04,128 INFO L290 TraceCheckUtils]: 49: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,128 INFO L290 TraceCheckUtils]: 50: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,128 INFO L290 TraceCheckUtils]: 51: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,129 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-08 09:30:04,129 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-08 09:30:04,129 INFO L290 TraceCheckUtils]: 54: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,129 INFO L290 TraceCheckUtils]: 55: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,129 INFO L290 TraceCheckUtils]: 56: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,129 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-08 09:30:04,130 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-08 09:30:04,130 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-08 09:30:04,130 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-08 09:30:04,130 INFO L290 TraceCheckUtils]: 61: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,130 INFO L290 TraceCheckUtils]: 62: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,130 INFO L290 TraceCheckUtils]: 63: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,130 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-08 09:30:04,131 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-08 09:30:04,131 INFO L290 TraceCheckUtils]: 66: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,131 INFO L290 TraceCheckUtils]: 67: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,131 INFO L290 TraceCheckUtils]: 68: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,131 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-08 09:30:04,131 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-08 09:30:04,132 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-08 09:30:04,132 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-08 09:30:04,132 INFO L290 TraceCheckUtils]: 73: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,132 INFO L290 TraceCheckUtils]: 74: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,132 INFO L290 TraceCheckUtils]: 75: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,132 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-08 09:30:04,132 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-08 09:30:04,132 INFO L290 TraceCheckUtils]: 78: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,132 INFO L290 TraceCheckUtils]: 79: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,132 INFO L290 TraceCheckUtils]: 80: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,133 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-08 09:30:04,133 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-08 09:30:04,133 INFO L290 TraceCheckUtils]: 83: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,133 INFO L290 TraceCheckUtils]: 84: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,133 INFO L290 TraceCheckUtils]: 85: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,133 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-08 09:30:04,133 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-08 09:30:04,133 INFO L290 TraceCheckUtils]: 88: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,134 INFO L290 TraceCheckUtils]: 89: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,134 INFO L290 TraceCheckUtils]: 90: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,134 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-08 09:30:04,135 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-08 09:30:04,135 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-08 09:30:04,135 INFO L290 TraceCheckUtils]: 94: Hoare triple {40478#false} assume !(~j~0 < ~r~0); {40478#false} is VALID [2022-04-08 09:30:04,136 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-08 09:30:04,136 INFO L290 TraceCheckUtils]: 96: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,136 INFO L290 TraceCheckUtils]: 97: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,136 INFO L290 TraceCheckUtils]: 98: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,136 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {40477#true} {40478#false} #118#return; {40478#false} is VALID [2022-04-08 09:30:04,136 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-08 09:30:04,136 INFO L290 TraceCheckUtils]: 101: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,136 INFO L290 TraceCheckUtils]: 102: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,136 INFO L290 TraceCheckUtils]: 103: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,136 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {40477#true} {40478#false} #120#return; {40478#false} is VALID [2022-04-08 09:30:04,136 INFO L290 TraceCheckUtils]: 105: Hoare triple {40478#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40478#false} is VALID [2022-04-08 09:30:04,136 INFO L290 TraceCheckUtils]: 106: Hoare triple {40478#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {40478#false} is VALID [2022-04-08 09:30:04,136 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-08 09:30:04,136 INFO L290 TraceCheckUtils]: 108: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:04,136 INFO L290 TraceCheckUtils]: 109: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:04,136 INFO L290 TraceCheckUtils]: 110: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:04,136 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {40477#true} {40478#false} #122#return; {40478#false} is VALID [2022-04-08 09:30:04,136 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-08 09:30:04,137 INFO L290 TraceCheckUtils]: 113: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-08 09:30:04,137 INFO L290 TraceCheckUtils]: 114: Hoare triple {40478#false} assume 0 == ~cond; {40478#false} is VALID [2022-04-08 09:30:04,137 INFO L290 TraceCheckUtils]: 115: Hoare triple {40478#false} assume !false; {40478#false} is VALID [2022-04-08 09:30:04,137 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-08 09:30:04,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:30:04,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090837901] [2022-04-08 09:30:04,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090837901] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:30:04,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481251937] [2022-04-08 09:30:04,137 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:30:04,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:30:04,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:30:04,138 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-08 09:30:04,139 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-08 09:30:04,192 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:30:04,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:30:04,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 09:30:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:04,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:30:10,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {40477#true} call ULTIMATE.init(); {40477#true} is VALID [2022-04-08 09:30:10,931 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-08 09:30:10,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:10,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-08 09:30:10,931 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-08 09:30:10,931 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-08 09:30:10,931 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-08 09:30:10,932 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-08 09:30:10,932 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-08 09:30:10,932 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-08 09:30:10,933 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-08 09:30:10,933 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-08 09:30:10,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:10,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:10,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:10,933 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-08 09:30:10,933 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-08 09:30:10,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:10,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:10,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:10,934 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-08 09:30:10,934 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-08 09:30:10,935 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-08 09:30:10,935 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-08 09:30:10,935 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-08 09:30:10,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:10,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:10,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:10,936 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-08 09:30:10,936 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-08 09:30:10,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:10,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:10,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:10,936 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-08 09:30:10,937 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-08 09:30:10,937 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-08 09:30:10,938 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-08 09:30:10,938 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-08 09:30:10,938 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-08 09:30:10,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:10,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:10,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:10,939 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-08 09:30:10,939 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-08 09:30:10,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:10,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:10,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:10,939 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-08 09:30:10,939 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-08 09:30:10,940 INFO L290 TraceCheckUtils]: 49: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:10,940 INFO L290 TraceCheckUtils]: 50: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:10,940 INFO L290 TraceCheckUtils]: 51: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:10,940 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-08 09:30:10,940 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-08 09:30:10,940 INFO L290 TraceCheckUtils]: 54: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:10,940 INFO L290 TraceCheckUtils]: 55: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:10,940 INFO L290 TraceCheckUtils]: 56: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:10,941 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-08 09:30:10,941 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-08 09:30:10,942 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-08 09:30:10,942 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-08 09:30:10,942 INFO L290 TraceCheckUtils]: 61: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:10,942 INFO L290 TraceCheckUtils]: 62: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:10,942 INFO L290 TraceCheckUtils]: 63: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:10,942 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-08 09:30:10,942 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-08 09:30:10,942 INFO L290 TraceCheckUtils]: 66: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:10,943 INFO L290 TraceCheckUtils]: 67: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:10,943 INFO L290 TraceCheckUtils]: 68: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:10,943 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-08 09:30:10,943 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-08 09:30:10,944 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-08 09:30:10,944 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-08 09:30:10,944 INFO L290 TraceCheckUtils]: 73: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:10,944 INFO L290 TraceCheckUtils]: 74: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:10,944 INFO L290 TraceCheckUtils]: 75: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:10,949 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-08 09:30:10,949 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-08 09:30:10,949 INFO L290 TraceCheckUtils]: 78: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:10,949 INFO L290 TraceCheckUtils]: 79: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:10,949 INFO L290 TraceCheckUtils]: 80: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:10,951 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-08 09:30:10,951 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-08 09:30:10,951 INFO L290 TraceCheckUtils]: 83: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:10,951 INFO L290 TraceCheckUtils]: 84: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:10,951 INFO L290 TraceCheckUtils]: 85: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:10,951 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-08 09:30:10,951 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-08 09:30:10,951 INFO L290 TraceCheckUtils]: 88: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:10,952 INFO L290 TraceCheckUtils]: 89: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:10,952 INFO L290 TraceCheckUtils]: 90: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:10,952 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-08 09:30:10,953 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-08 09:30:10,953 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-08 09:30:10,954 INFO L290 TraceCheckUtils]: 94: Hoare triple {40478#false} assume !(~j~0 < ~r~0); {40478#false} is VALID [2022-04-08 09:30:10,954 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-08 09:30:10,954 INFO L290 TraceCheckUtils]: 96: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-08 09:30:10,954 INFO L290 TraceCheckUtils]: 97: Hoare triple {40478#false} assume !(0 == ~cond); {40478#false} is VALID [2022-04-08 09:30:10,954 INFO L290 TraceCheckUtils]: 98: Hoare triple {40478#false} assume true; {40478#false} is VALID [2022-04-08 09:30:10,954 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {40478#false} {40478#false} #118#return; {40478#false} is VALID [2022-04-08 09:30:10,954 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-08 09:30:10,954 INFO L290 TraceCheckUtils]: 101: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-08 09:30:10,954 INFO L290 TraceCheckUtils]: 102: Hoare triple {40478#false} assume !(0 == ~cond); {40478#false} is VALID [2022-04-08 09:30:10,954 INFO L290 TraceCheckUtils]: 103: Hoare triple {40478#false} assume true; {40478#false} is VALID [2022-04-08 09:30:10,954 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {40478#false} {40478#false} #120#return; {40478#false} is VALID [2022-04-08 09:30:10,954 INFO L290 TraceCheckUtils]: 105: Hoare triple {40478#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40478#false} is VALID [2022-04-08 09:30:10,954 INFO L290 TraceCheckUtils]: 106: Hoare triple {40478#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {40478#false} is VALID [2022-04-08 09:30:10,954 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-08 09:30:10,954 INFO L290 TraceCheckUtils]: 108: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-08 09:30:10,954 INFO L290 TraceCheckUtils]: 109: Hoare triple {40478#false} assume !(0 == ~cond); {40478#false} is VALID [2022-04-08 09:30:10,954 INFO L290 TraceCheckUtils]: 110: Hoare triple {40478#false} assume true; {40478#false} is VALID [2022-04-08 09:30:10,955 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {40478#false} {40478#false} #122#return; {40478#false} is VALID [2022-04-08 09:30:10,955 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-08 09:30:10,955 INFO L290 TraceCheckUtils]: 113: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-08 09:30:10,955 INFO L290 TraceCheckUtils]: 114: Hoare triple {40478#false} assume 0 == ~cond; {40478#false} is VALID [2022-04-08 09:30:10,955 INFO L290 TraceCheckUtils]: 115: Hoare triple {40478#false} assume !false; {40478#false} is VALID [2022-04-08 09:30:10,955 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-08 09:30:10,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:30:11,732 INFO L290 TraceCheckUtils]: 115: Hoare triple {40478#false} assume !false; {40478#false} is VALID [2022-04-08 09:30:11,732 INFO L290 TraceCheckUtils]: 114: Hoare triple {40478#false} assume 0 == ~cond; {40478#false} is VALID [2022-04-08 09:30:11,732 INFO L290 TraceCheckUtils]: 113: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-08 09:30:11,732 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-08 09:30:11,732 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {40477#true} {40478#false} #122#return; {40478#false} is VALID [2022-04-08 09:30:11,733 INFO L290 TraceCheckUtils]: 110: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,733 INFO L290 TraceCheckUtils]: 109: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,733 INFO L290 TraceCheckUtils]: 108: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,733 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-08 09:30:11,733 INFO L290 TraceCheckUtils]: 106: Hoare triple {40478#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {40478#false} is VALID [2022-04-08 09:30:11,733 INFO L290 TraceCheckUtils]: 105: Hoare triple {40478#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40478#false} is VALID [2022-04-08 09:30:11,733 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {40477#true} {40478#false} #120#return; {40478#false} is VALID [2022-04-08 09:30:11,733 INFO L290 TraceCheckUtils]: 103: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,733 INFO L290 TraceCheckUtils]: 102: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,733 INFO L290 TraceCheckUtils]: 101: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,733 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-08 09:30:11,733 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {40477#true} {40478#false} #118#return; {40478#false} is VALID [2022-04-08 09:30:11,733 INFO L290 TraceCheckUtils]: 98: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,733 INFO L290 TraceCheckUtils]: 97: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,733 INFO L290 TraceCheckUtils]: 96: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,733 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-08 09:30:11,733 INFO L290 TraceCheckUtils]: 94: Hoare triple {40478#false} assume !(~j~0 < ~r~0); {40478#false} is VALID [2022-04-08 09:30:11,734 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-08 09:30:11,734 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-08 09:30:11,735 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-08 09:30:11,735 INFO L290 TraceCheckUtils]: 90: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,735 INFO L290 TraceCheckUtils]: 89: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,735 INFO L290 TraceCheckUtils]: 88: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,735 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-08 09:30:11,735 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-08 09:30:11,735 INFO L290 TraceCheckUtils]: 85: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,735 INFO L290 TraceCheckUtils]: 84: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,735 INFO L290 TraceCheckUtils]: 83: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,735 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-08 09:30:11,736 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-08 09:30:11,736 INFO L290 TraceCheckUtils]: 80: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,736 INFO L290 TraceCheckUtils]: 79: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,736 INFO L290 TraceCheckUtils]: 78: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,736 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-08 09:30:11,736 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-08 09:30:11,737 INFO L290 TraceCheckUtils]: 75: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,737 INFO L290 TraceCheckUtils]: 74: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,737 INFO L290 TraceCheckUtils]: 73: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,737 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-08 09:30:11,737 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-08 09:30:11,737 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-08 09:30:11,738 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-08 09:30:11,738 INFO L290 TraceCheckUtils]: 68: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,738 INFO L290 TraceCheckUtils]: 67: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,738 INFO L290 TraceCheckUtils]: 66: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,738 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-08 09:30:11,738 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-08 09:30:11,738 INFO L290 TraceCheckUtils]: 63: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,738 INFO L290 TraceCheckUtils]: 62: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,738 INFO L290 TraceCheckUtils]: 61: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,739 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-08 09:30:11,739 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-08 09:30:11,739 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-08 09:30:11,740 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-08 09:30:11,740 INFO L290 TraceCheckUtils]: 56: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,740 INFO L290 TraceCheckUtils]: 55: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,740 INFO L290 TraceCheckUtils]: 54: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,740 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-08 09:30:11,740 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-08 09:30:11,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,741 INFO L290 TraceCheckUtils]: 50: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,741 INFO L290 TraceCheckUtils]: 49: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,741 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-08 09:30:11,741 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-08 09:30:11,741 INFO L290 TraceCheckUtils]: 46: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,741 INFO L290 TraceCheckUtils]: 45: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,741 INFO L290 TraceCheckUtils]: 44: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,741 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-08 09:30:11,742 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-08 09:30:11,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,742 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-08 09:30:11,742 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-08 09:30:11,742 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-08 09:30:11,743 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-08 09:30:11,743 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-08 09:30:11,744 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-08 09:30:11,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,744 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-08 09:30:11,744 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-08 09:30:11,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,745 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-08 09:30:11,745 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-08 09:30:11,745 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-08 09:30:11,746 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-08 09:30:11,746 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-08 09:30:11,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,746 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-08 09:30:11,747 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-08 09:30:11,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-08 09:30:11,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-08 09:30:11,747 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-08 09:30:11,748 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-08 09:30:11,748 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-08 09:30:11,749 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-08 09:30:11,749 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-08 09:30:11,749 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-08 09:30:11,749 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-08 09:30:11,749 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-08 09:30:11,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-08 09:30:11,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-08 09:30:11,749 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-08 09:30:11,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {40477#true} call ULTIMATE.init(); {40477#true} is VALID [2022-04-08 09:30:11,749 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-08 09:30:11,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481251937] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:30:11,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:30:11,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-04-08 09:30:11,750 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:30:11,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [731096831] [2022-04-08 09:30:11,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [731096831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:30:11,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:30:11,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:30:11,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296946440] [2022-04-08 09:30:11,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:30:11,751 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-08 09:30:11,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:30:11,751 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-08 09:30:11,799 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-08 09:30:11,799 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:30:11,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:30:11,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:30:11,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:30:11,800 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-08 09:30:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:30:19,838 INFO L93 Difference]: Finished difference Result 756 states and 1173 transitions. [2022-04-08 09:30:19,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 09:30:19,838 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-08 09:30:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:30:19,839 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-08 09:30:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 472 transitions. [2022-04-08 09:30:19,849 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-08 09:30:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 472 transitions. [2022-04-08 09:30:19,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 472 transitions. [2022-04-08 09:30:20,254 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-08 09:30:20,265 INFO L225 Difference]: With dead ends: 756 [2022-04-08 09:30:20,266 INFO L226 Difference]: Without dead ends: 452 [2022-04-08 09:30:20,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=357, Invalid=1449, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 09:30:20,267 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 206 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-08 09:30:20,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 116 Invalid, 1877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-08 09:30:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-04-08 09:30:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 364. [2022-04-08 09:30:22,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:30:22,615 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-08 09:30:22,615 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-08 09:30:22,615 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-08 09:30:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:30:22,627 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2022-04-08 09:30:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 699 transitions. [2022-04-08 09:30:22,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:30:22,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:30:22,629 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-08 09:30:22,629 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-08 09:30:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:30:22,642 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2022-04-08 09:30:22,642 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 699 transitions. [2022-04-08 09:30:22,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:30:22,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:30:22,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:30:22,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:30:22,644 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-08 09:30:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 569 transitions. [2022-04-08 09:30:22,654 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 569 transitions. Word has length 116 [2022-04-08 09:30:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:30:22,654 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 569 transitions. [2022-04-08 09:30:22,655 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-08 09:30:22,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 569 transitions. [2022-04-08 09:30:23,594 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-08 09:30:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 569 transitions. [2022-04-08 09:30:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-08 09:30:23,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:30:23,596 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-08 09:30:23,612 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-08 09:30:23,796 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-08 09:30:23,796 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:30:23,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:30:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1934725046, now seen corresponding path program 3 times [2022-04-08 09:30:23,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:30:23,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [864212741] [2022-04-08 09:30:23,797 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:30:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1934725046, now seen corresponding path program 4 times [2022-04-08 09:30:23,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:30:23,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269026227] [2022-04-08 09:30:23,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:30:23,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:30:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:30:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,895 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-08 09:30:23,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-08 09:30:23,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:30:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,899 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-08 09:30:23,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:30:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,902 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-08 09:30:23,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 09:30:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,905 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-08 09:30:23,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 09:30:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,907 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-08 09:30:23,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 09:30:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,911 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-08 09:30:23,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-08 09:30:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,914 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-08 09:30:23,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 09:30:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,917 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-08 09:30:23,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-08 09:30:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,921 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-08 09:30:23,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 09:30:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,924 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-08 09:30:23,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 09:30:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,926 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-08 09:30:23,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 09:30:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,928 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-08 09:30:23,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-08 09:30:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,931 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-08 09:30:23,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 09:30:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,933 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-08 09:30:23,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-08 09:30:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,935 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-08 09:30:23,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-08 09:30:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,938 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-08 09:30:23,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-08 09:30:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,940 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-08 09:30:23,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-04-08 09:30:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:23,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,942 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-08 09:30:23,943 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-08 09:30:23,943 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-08 09:30:23,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-08 09:30:23,943 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-08 09:30:23,943 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-08 09:30:23,943 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-08 09:30:23,944 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-08 09:30:23,944 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-08 09:30:23,944 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-08 09:30:23,945 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-08 09:30:23,945 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-08 09:30:23,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,945 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-08 09:30:23,945 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-08 09:30:23,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,946 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-08 09:30:23,946 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-08 09:30:23,946 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-08 09:30:23,947 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-08 09:30:23,947 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-08 09:30:23,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,947 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-08 09:30:23,947 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-08 09:30:23,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,948 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-08 09:30:23,948 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-08 09:30:23,948 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-08 09:30:23,949 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-08 09:30:23,949 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-08 09:30:23,949 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-08 09:30:23,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,949 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-08 09:30:23,950 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-08 09:30:23,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,950 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-08 09:30:23,950 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-08 09:30:23,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,951 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-08 09:30:23,951 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-08 09:30:23,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,951 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-08 09:30:23,951 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-08 09:30:23,952 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-08 09:30:23,952 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-08 09:30:23,952 INFO L290 TraceCheckUtils]: 61: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,952 INFO L290 TraceCheckUtils]: 62: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,952 INFO L290 TraceCheckUtils]: 63: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,952 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-08 09:30:23,952 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-08 09:30:23,952 INFO L290 TraceCheckUtils]: 66: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,952 INFO L290 TraceCheckUtils]: 67: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,952 INFO L290 TraceCheckUtils]: 68: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,953 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-08 09:30:23,953 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-08 09:30:23,953 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-08 09:30:23,953 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-08 09:30:23,953 INFO L290 TraceCheckUtils]: 73: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,953 INFO L290 TraceCheckUtils]: 74: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,953 INFO L290 TraceCheckUtils]: 75: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,954 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-08 09:30:23,954 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-08 09:30:23,954 INFO L290 TraceCheckUtils]: 78: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,954 INFO L290 TraceCheckUtils]: 79: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,954 INFO L290 TraceCheckUtils]: 80: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,954 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-08 09:30:23,954 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-08 09:30:23,954 INFO L290 TraceCheckUtils]: 83: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,954 INFO L290 TraceCheckUtils]: 84: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,955 INFO L290 TraceCheckUtils]: 85: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,955 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-08 09:30:23,955 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-08 09:30:23,955 INFO L290 TraceCheckUtils]: 88: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,955 INFO L290 TraceCheckUtils]: 89: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,955 INFO L290 TraceCheckUtils]: 90: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,955 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-08 09:30:23,956 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-08 09:30:23,956 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-08 09:30:23,956 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-08 09:30:23,956 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-08 09:30:23,956 INFO L290 TraceCheckUtils]: 96: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,956 INFO L290 TraceCheckUtils]: 97: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,956 INFO L290 TraceCheckUtils]: 98: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,957 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-08 09:30:23,957 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-08 09:30:23,957 INFO L290 TraceCheckUtils]: 101: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,957 INFO L290 TraceCheckUtils]: 102: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,957 INFO L290 TraceCheckUtils]: 103: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,957 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-08 09:30:23,958 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-08 09:30:23,958 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-08 09:30:23,958 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-08 09:30:23,958 INFO L290 TraceCheckUtils]: 108: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:23,958 INFO L290 TraceCheckUtils]: 109: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:23,958 INFO L290 TraceCheckUtils]: 110: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:23,958 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-08 09:30:23,959 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-08 09:30:23,959 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-08 09:30:23,959 INFO L290 TraceCheckUtils]: 114: Hoare triple {44533#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {44454#false} is VALID [2022-04-08 09:30:23,959 INFO L290 TraceCheckUtils]: 115: Hoare triple {44454#false} assume !false; {44454#false} is VALID [2022-04-08 09:30:23,960 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-08 09:30:23,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:30:23,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269026227] [2022-04-08 09:30:23,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269026227] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:30:23,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569232290] [2022-04-08 09:30:23,960 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:30:23,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:30:23,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:30:23,961 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-08 09:30:23,962 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-08 09:30:24,012 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:30:24,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:30:24,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 09:30:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:24,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:30:26,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {44453#true} call ULTIMATE.init(); {44453#true} is VALID [2022-04-08 09:30:26,844 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-08 09:30:26,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-08 09:30:26,845 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-08 09:30:26,845 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-08 09:30:26,845 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-08 09:30:26,845 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-08 09:30:26,845 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-08 09:30:26,845 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-08 09:30:26,846 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-08 09:30:26,846 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-08 09:30:26,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,846 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-08 09:30:26,846 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-08 09:30:26,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {44453#true} ~cond := #in~cond; {44590#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:30:26,847 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-08 09:30:26,847 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-08 09:30:26,848 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-08 09:30:26,848 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-08 09:30:26,849 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-08 09:30:26,849 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-08 09:30:26,849 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-08 09:30:26,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,850 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-08 09:30:26,850 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-08 09:30:26,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,851 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-08 09:30:26,851 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-08 09:30:26,852 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-08 09:30:26,852 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-08 09:30:26,853 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-08 09:30:26,853 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-08 09:30:26,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,853 INFO L290 TraceCheckUtils]: 40: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,853 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-08 09:30:26,853 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-08 09:30:26,854 INFO L290 TraceCheckUtils]: 44: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,854 INFO L290 TraceCheckUtils]: 45: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,854 INFO L290 TraceCheckUtils]: 46: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,854 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-08 09:30:26,854 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-08 09:30:26,854 INFO L290 TraceCheckUtils]: 49: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,854 INFO L290 TraceCheckUtils]: 50: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,854 INFO L290 TraceCheckUtils]: 51: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,855 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-08 09:30:26,855 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-08 09:30:26,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,855 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-08 09:30:26,856 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-08 09:30:26,856 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-08 09:30:26,856 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-08 09:30:26,856 INFO L290 TraceCheckUtils]: 61: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,856 INFO L290 TraceCheckUtils]: 62: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,857 INFO L290 TraceCheckUtils]: 63: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,857 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-08 09:30:26,857 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-08 09:30:26,857 INFO L290 TraceCheckUtils]: 66: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,857 INFO L290 TraceCheckUtils]: 67: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,857 INFO L290 TraceCheckUtils]: 68: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,858 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-08 09:30:26,858 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-08 09:30:26,858 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-08 09:30:26,859 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-08 09:30:26,859 INFO L290 TraceCheckUtils]: 73: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,859 INFO L290 TraceCheckUtils]: 74: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,859 INFO L290 TraceCheckUtils]: 75: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,859 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-08 09:30:26,859 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-08 09:30:26,859 INFO L290 TraceCheckUtils]: 78: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,859 INFO L290 TraceCheckUtils]: 79: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,859 INFO L290 TraceCheckUtils]: 80: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,860 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-08 09:30:26,860 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-08 09:30:26,860 INFO L290 TraceCheckUtils]: 83: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,860 INFO L290 TraceCheckUtils]: 84: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,860 INFO L290 TraceCheckUtils]: 85: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,861 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-08 09:30:26,861 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-08 09:30:26,861 INFO L290 TraceCheckUtils]: 88: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,861 INFO L290 TraceCheckUtils]: 89: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,861 INFO L290 TraceCheckUtils]: 90: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,861 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-08 09:30:26,862 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-08 09:30:26,862 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-08 09:30:26,862 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-08 09:30:26,863 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-08 09:30:26,863 INFO L290 TraceCheckUtils]: 96: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,863 INFO L290 TraceCheckUtils]: 97: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,863 INFO L290 TraceCheckUtils]: 98: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,863 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-08 09:30:26,863 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-08 09:30:26,863 INFO L290 TraceCheckUtils]: 101: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,863 INFO L290 TraceCheckUtils]: 102: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,863 INFO L290 TraceCheckUtils]: 103: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,864 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-08 09:30:26,864 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-08 09:30:26,865 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-08 09:30:26,865 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-08 09:30:26,865 INFO L290 TraceCheckUtils]: 108: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:26,865 INFO L290 TraceCheckUtils]: 109: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:26,865 INFO L290 TraceCheckUtils]: 110: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:26,865 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-08 09:30:26,866 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-08 09:30:26,866 INFO L290 TraceCheckUtils]: 113: Hoare triple {44878#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {44882#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:30:26,867 INFO L290 TraceCheckUtils]: 114: Hoare triple {44882#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44454#false} is VALID [2022-04-08 09:30:26,867 INFO L290 TraceCheckUtils]: 115: Hoare triple {44454#false} assume !false; {44454#false} is VALID [2022-04-08 09:30:26,867 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-08 09:30:26,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:30:27,892 INFO L290 TraceCheckUtils]: 115: Hoare triple {44454#false} assume !false; {44454#false} is VALID [2022-04-08 09:30:27,893 INFO L290 TraceCheckUtils]: 114: Hoare triple {44882#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44454#false} is VALID [2022-04-08 09:30:27,893 INFO L290 TraceCheckUtils]: 113: Hoare triple {44878#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {44882#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:30:27,893 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-08 09:30:27,894 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-08 09:30:27,894 INFO L290 TraceCheckUtils]: 110: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,894 INFO L290 TraceCheckUtils]: 109: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,894 INFO L290 TraceCheckUtils]: 108: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,894 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-08 09:30:27,894 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-08 09:30:27,895 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-08 09:30:27,895 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-08 09:30:27,895 INFO L290 TraceCheckUtils]: 103: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,895 INFO L290 TraceCheckUtils]: 102: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,895 INFO L290 TraceCheckUtils]: 101: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,895 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-08 09:30:27,896 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-08 09:30:27,896 INFO L290 TraceCheckUtils]: 98: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,896 INFO L290 TraceCheckUtils]: 97: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,896 INFO L290 TraceCheckUtils]: 96: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,896 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-08 09:30:27,900 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-08 09:30:27,900 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-08 09:30:27,901 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-08 09:30:27,901 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-08 09:30:27,901 INFO L290 TraceCheckUtils]: 90: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,901 INFO L290 TraceCheckUtils]: 89: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,901 INFO L290 TraceCheckUtils]: 88: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,901 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-08 09:30:27,902 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-08 09:30:27,902 INFO L290 TraceCheckUtils]: 85: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,902 INFO L290 TraceCheckUtils]: 84: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,902 INFO L290 TraceCheckUtils]: 83: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,902 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-08 09:30:27,902 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-08 09:30:27,902 INFO L290 TraceCheckUtils]: 80: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,902 INFO L290 TraceCheckUtils]: 79: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,902 INFO L290 TraceCheckUtils]: 78: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,902 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-08 09:30:27,904 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-08 09:30:27,904 INFO L290 TraceCheckUtils]: 75: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,904 INFO L290 TraceCheckUtils]: 74: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,904 INFO L290 TraceCheckUtils]: 73: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,904 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-08 09:30:27,904 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-08 09:30:27,904 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-08 09:30:27,905 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-08 09:30:27,905 INFO L290 TraceCheckUtils]: 68: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,905 INFO L290 TraceCheckUtils]: 67: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,905 INFO L290 TraceCheckUtils]: 66: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,905 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-08 09:30:27,905 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-08 09:30:27,905 INFO L290 TraceCheckUtils]: 63: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,905 INFO L290 TraceCheckUtils]: 62: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,905 INFO L290 TraceCheckUtils]: 61: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,906 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-08 09:30:27,906 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-08 09:30:27,913 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-08 09:30:27,913 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-08 09:30:27,913 INFO L290 TraceCheckUtils]: 56: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,913 INFO L290 TraceCheckUtils]: 55: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,913 INFO L290 TraceCheckUtils]: 54: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,913 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-08 09:30:27,914 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-08 09:30:27,914 INFO L290 TraceCheckUtils]: 51: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,914 INFO L290 TraceCheckUtils]: 49: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,914 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-08 09:30:27,914 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-08 09:30:27,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,914 INFO L290 TraceCheckUtils]: 45: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,914 INFO L290 TraceCheckUtils]: 44: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,914 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-08 09:30:27,915 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-08 09:30:27,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,926 INFO L290 TraceCheckUtils]: 40: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,926 INFO L290 TraceCheckUtils]: 39: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,926 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-08 09:30:27,928 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-08 09:30:27,928 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-08 09:30:27,929 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-08 09:30:27,929 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-08 09:30:27,930 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-08 09:30:27,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,930 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-08 09:30:27,931 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-08 09:30:27,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,931 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-08 09:30:27,932 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-08 09:30:27,932 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-08 09:30:27,932 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-08 09:30:27,933 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-08 09:30:27,933 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-08 09:30:27,933 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-08 09:30:27,934 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-08 09:30:27,934 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-08 09:30:27,934 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-08 09:30:27,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-08 09:30:27,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-08 09:30:27,934 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-08 09:30:27,935 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-08 09:30:27,935 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-08 09:30:27,935 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-08 09:30:27,935 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-08 09:30:27,936 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-08 09:30:27,936 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-08 09:30:27,936 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-08 09:30:27,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-08 09:30:27,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-08 09:30:27,936 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-08 09:30:27,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {44453#true} call ULTIMATE.init(); {44453#true} is VALID [2022-04-08 09:30:27,936 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-08 09:30:27,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569232290] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:30:27,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:30:27,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-04-08 09:30:27,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:30:27,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [864212741] [2022-04-08 09:30:27,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [864212741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:30:27,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:30:27,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:30:27,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891482238] [2022-04-08 09:30:27,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:30:27,937 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-08 09:30:27,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:30:27,938 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-08 09:30:27,984 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-08 09:30:27,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:30:27,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:30:27,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:30:27,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:30:27,985 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-08 09:30:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:30:35,570 INFO L93 Difference]: Finished difference Result 620 states and 983 transitions. [2022-04-08 09:30:35,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 09:30:35,570 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-08 09:30:35,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:30:35,574 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-08 09:30:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 245 transitions. [2022-04-08 09:30:35,577 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-08 09:30:35,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 245 transitions. [2022-04-08 09:30:35,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 245 transitions. [2022-04-08 09:30:35,811 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-08 09:30:35,828 INFO L225 Difference]: With dead ends: 620 [2022-04-08 09:30:35,829 INFO L226 Difference]: Without dead ends: 618 [2022-04-08 09:30:35,829 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=951, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 09:30:35,830 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 187 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:30:35,830 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.3s Time] [2022-04-08 09:30:35,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-04-08 09:30:39,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 501. [2022-04-08 09:30:39,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:30:39,359 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-08 09:30:39,360 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-08 09:30:39,360 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-08 09:30:39,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:30:39,379 INFO L93 Difference]: Finished difference Result 618 states and 981 transitions. [2022-04-08 09:30:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2022-04-08 09:30:39,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:30:39,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:30:39,381 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-08 09:30:39,381 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-08 09:30:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:30:39,403 INFO L93 Difference]: Finished difference Result 618 states and 981 transitions. [2022-04-08 09:30:39,403 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2022-04-08 09:30:39,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:30:39,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:30:39,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:30:39,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:30:39,406 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-08 09:30:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 798 transitions. [2022-04-08 09:30:39,423 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 798 transitions. Word has length 116 [2022-04-08 09:30:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:30:39,423 INFO L478 AbstractCegarLoop]: Abstraction has 501 states and 798 transitions. [2022-04-08 09:30:39,423 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-08 09:30:39,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 501 states and 798 transitions. [2022-04-08 09:30:40,788 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-08 09:30:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 798 transitions. [2022-04-08 09:30:40,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-08 09:30:40,789 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:30:40,789 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-08 09:30:40,805 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-08 09:30:40,989 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-08 09:30:40,990 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:30:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:30:40,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1563563510, now seen corresponding path program 5 times [2022-04-08 09:30:40,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:30:40,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [85986862] [2022-04-08 09:30:40,991 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:30:40,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1563563510, now seen corresponding path program 6 times [2022-04-08 09:30:40,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:30:40,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967829731] [2022-04-08 09:30:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:30:40,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:30:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:30:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,090 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-08 09:30:41,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-08 09:30:41,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:30:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,094 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-08 09:30:41,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:30:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,097 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-08 09:30:41,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-08 09:30:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,100 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-08 09:30:41,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 09:30:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,103 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-08 09:30:41,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 09:30:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,105 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-08 09:30:41,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 09:30:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,108 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-08 09:30:41,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-08 09:30:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,110 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-08 09:30:41,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-08 09:30:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,114 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-08 09:30:41,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 09:30:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,116 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-08 09:30:41,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 09:30:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,119 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-08 09:30:41,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-08 09:30:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,123 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-08 09:30:41,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-04-08 09:30:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,126 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-08 09:30:41,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 09:30:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,129 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-08 09:30:41,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-08 09:30:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,131 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-08 09:30:41,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-08 09:30:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,134 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-08 09:30:41,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-04-08 09:30:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,137 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-08 09:30:41,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-08 09:30:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,140 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-08 09:30:41,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-04-08 09:30:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,143 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-08 09:30:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-08 09:30:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,146 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-08 09:30:41,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-08 09:30:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,149 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-08 09:30:41,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-08 09:30:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,153 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-08 09:30:41,153 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-08 09:30:41,153 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-08 09:30:41,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-08 09:30:41,154 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-08 09:30:41,154 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-08 09:30:41,154 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-08 09:30:41,154 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-08 09:30:41,155 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-08 09:30:41,155 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-08 09:30:41,155 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-08 09:30:41,156 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-08 09:30:41,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,156 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-08 09:30:41,156 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-08 09:30:41,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,157 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-08 09:30:41,157 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-08 09:30:41,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,157 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-08 09:30:41,157 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-08 09:30:41,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,158 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-08 09:30:41,158 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-08 09:30:41,159 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-08 09:30:41,159 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-08 09:30:41,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,159 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-08 09:30:41,159 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-08 09:30:41,159 INFO L290 TraceCheckUtils]: 39: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,160 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-08 09:30:41,160 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-08 09:30:41,161 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-08 09:30:41,161 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-08 09:30:41,161 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-08 09:30:41,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,161 INFO L290 TraceCheckUtils]: 48: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,162 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-08 09:30:41,162 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-08 09:30:41,162 INFO L290 TraceCheckUtils]: 52: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,162 INFO L290 TraceCheckUtils]: 53: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,162 INFO L290 TraceCheckUtils]: 54: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,162 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-08 09:30:41,162 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-08 09:30:41,163 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-08 09:30:41,163 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-08 09:30:41,163 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-08 09:30:41,163 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-08 09:30:41,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,164 INFO L290 TraceCheckUtils]: 62: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,164 INFO L290 TraceCheckUtils]: 63: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,164 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-08 09:30:41,164 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-08 09:30:41,164 INFO L290 TraceCheckUtils]: 66: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,164 INFO L290 TraceCheckUtils]: 67: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,164 INFO L290 TraceCheckUtils]: 68: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,165 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-08 09:30:41,165 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-08 09:30:41,165 INFO L290 TraceCheckUtils]: 71: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,165 INFO L290 TraceCheckUtils]: 72: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,165 INFO L290 TraceCheckUtils]: 73: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,165 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-08 09:30:41,165 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-08 09:30:41,165 INFO L290 TraceCheckUtils]: 76: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,165 INFO L290 TraceCheckUtils]: 77: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,165 INFO L290 TraceCheckUtils]: 78: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,166 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-08 09:30:41,166 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-08 09:30:41,166 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-08 09:30:41,166 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-08 09:30:41,167 INFO L290 TraceCheckUtils]: 83: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,167 INFO L290 TraceCheckUtils]: 84: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,167 INFO L290 TraceCheckUtils]: 85: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,167 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-08 09:30:41,167 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-08 09:30:41,167 INFO L290 TraceCheckUtils]: 88: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,167 INFO L290 TraceCheckUtils]: 89: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,167 INFO L290 TraceCheckUtils]: 90: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,168 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-08 09:30:41,168 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-08 09:30:41,168 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-08 09:30:41,168 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-08 09:30:41,168 INFO L290 TraceCheckUtils]: 95: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,169 INFO L290 TraceCheckUtils]: 96: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,169 INFO L290 TraceCheckUtils]: 97: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,169 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-08 09:30:41,169 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-08 09:30:41,169 INFO L290 TraceCheckUtils]: 100: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,169 INFO L290 TraceCheckUtils]: 101: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,169 INFO L290 TraceCheckUtils]: 102: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,170 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-08 09:30:41,170 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-08 09:30:41,170 INFO L290 TraceCheckUtils]: 105: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,170 INFO L290 TraceCheckUtils]: 106: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,170 INFO L290 TraceCheckUtils]: 107: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,170 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-08 09:30:41,170 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-08 09:30:41,170 INFO L290 TraceCheckUtils]: 110: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,170 INFO L290 TraceCheckUtils]: 111: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,170 INFO L290 TraceCheckUtils]: 112: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,171 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-08 09:30:41,171 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-08 09:30:41,172 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-08 09:30:41,172 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-08 09:30:41,172 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-08 09:30:41,172 INFO L290 TraceCheckUtils]: 118: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,172 INFO L290 TraceCheckUtils]: 119: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,172 INFO L290 TraceCheckUtils]: 120: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,172 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-08 09:30:41,173 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-08 09:30:41,173 INFO L290 TraceCheckUtils]: 123: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,173 INFO L290 TraceCheckUtils]: 124: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,173 INFO L290 TraceCheckUtils]: 125: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,173 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-08 09:30:41,173 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-08 09:30:41,174 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-08 09:30:41,174 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-08 09:30:41,174 INFO L290 TraceCheckUtils]: 130: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:41,174 INFO L290 TraceCheckUtils]: 131: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:41,174 INFO L290 TraceCheckUtils]: 132: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:41,174 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-08 09:30:41,175 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-08 09:30:41,175 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-08 09:30:41,175 INFO L290 TraceCheckUtils]: 136: Hoare triple {48840#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {48745#false} is VALID [2022-04-08 09:30:41,175 INFO L290 TraceCheckUtils]: 137: Hoare triple {48745#false} assume !false; {48745#false} is VALID [2022-04-08 09:30:41,176 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-08 09:30:41,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:30:41,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967829731] [2022-04-08 09:30:41,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967829731] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:30:41,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841098950] [2022-04-08 09:30:41,176 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:30:41,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:30:41,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:30:41,177 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-08 09:30:41,178 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-08 09:30:41,229 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 09:30:41,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:30:41,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 09:30:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:41,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:30:42,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {48744#true} call ULTIMATE.init(); {48744#true} is VALID [2022-04-08 09:30:42,279 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-08 09:30:42,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-08 09:30:42,279 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-08 09:30:42,279 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-08 09:30:42,279 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-08 09:30:42,280 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-08 09:30:42,280 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-08 09:30:42,280 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-08 09:30:42,280 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-08 09:30:42,280 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-08 09:30:42,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,281 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-08 09:30:42,281 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-08 09:30:42,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,282 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-08 09:30:42,282 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-08 09:30:42,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,282 INFO L290 TraceCheckUtils]: 24: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,282 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-08 09:30:42,282 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-08 09:30:42,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,283 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-08 09:30:42,283 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-08 09:30:42,283 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-08 09:30:42,283 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-08 09:30:42,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,284 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-08 09:30:42,284 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-08 09:30:42,284 INFO L290 TraceCheckUtils]: 39: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,284 INFO L290 TraceCheckUtils]: 40: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,285 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-08 09:30:42,285 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-08 09:30:42,285 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-08 09:30:42,285 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-08 09:30:42,285 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-08 09:30:42,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,286 INFO L290 TraceCheckUtils]: 49: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,286 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-08 09:30:42,286 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-08 09:30:42,286 INFO L290 TraceCheckUtils]: 52: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,286 INFO L290 TraceCheckUtils]: 53: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,286 INFO L290 TraceCheckUtils]: 54: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,287 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-08 09:30:42,287 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-08 09:30:42,287 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-08 09:30:42,288 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-08 09:30:42,288 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-08 09:30:42,288 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-08 09:30:42,288 INFO L290 TraceCheckUtils]: 61: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,288 INFO L290 TraceCheckUtils]: 62: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,288 INFO L290 TraceCheckUtils]: 63: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,288 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-08 09:30:42,289 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-08 09:30:42,289 INFO L290 TraceCheckUtils]: 66: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,289 INFO L290 TraceCheckUtils]: 67: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,289 INFO L290 TraceCheckUtils]: 68: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,289 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-08 09:30:42,289 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-08 09:30:42,289 INFO L290 TraceCheckUtils]: 71: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,289 INFO L290 TraceCheckUtils]: 72: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,289 INFO L290 TraceCheckUtils]: 73: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,290 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-08 09:30:42,290 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-08 09:30:42,290 INFO L290 TraceCheckUtils]: 76: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,290 INFO L290 TraceCheckUtils]: 77: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,290 INFO L290 TraceCheckUtils]: 78: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,290 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-08 09:30:42,291 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-08 09:30:42,291 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-08 09:30:42,291 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-08 09:30:42,291 INFO L290 TraceCheckUtils]: 83: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,291 INFO L290 TraceCheckUtils]: 84: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,291 INFO L290 TraceCheckUtils]: 85: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,292 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-08 09:30:42,292 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-08 09:30:42,292 INFO L290 TraceCheckUtils]: 88: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,292 INFO L290 TraceCheckUtils]: 89: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,292 INFO L290 TraceCheckUtils]: 90: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,292 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-08 09:30:42,293 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-08 09:30:42,293 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-08 09:30:42,293 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-08 09:30:42,293 INFO L290 TraceCheckUtils]: 95: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,293 INFO L290 TraceCheckUtils]: 96: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,293 INFO L290 TraceCheckUtils]: 97: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,293 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-08 09:30:42,294 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-08 09:30:42,294 INFO L290 TraceCheckUtils]: 100: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,294 INFO L290 TraceCheckUtils]: 101: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,294 INFO L290 TraceCheckUtils]: 102: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,294 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-08 09:30:42,294 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-08 09:30:42,294 INFO L290 TraceCheckUtils]: 105: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,294 INFO L290 TraceCheckUtils]: 106: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,294 INFO L290 TraceCheckUtils]: 107: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,295 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-08 09:30:42,295 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-08 09:30:42,295 INFO L290 TraceCheckUtils]: 110: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,295 INFO L290 TraceCheckUtils]: 111: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,295 INFO L290 TraceCheckUtils]: 112: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,295 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-08 09:30:42,296 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-08 09:30:42,296 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-08 09:30:42,297 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-08 09:30:42,297 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-08 09:30:42,297 INFO L290 TraceCheckUtils]: 118: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,297 INFO L290 TraceCheckUtils]: 119: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,297 INFO L290 TraceCheckUtils]: 120: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,297 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-08 09:30:42,297 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-08 09:30:42,297 INFO L290 TraceCheckUtils]: 123: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,298 INFO L290 TraceCheckUtils]: 124: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,298 INFO L290 TraceCheckUtils]: 125: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,298 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-08 09:30:42,298 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-08 09:30:42,299 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-08 09:30:42,299 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-08 09:30:42,299 INFO L290 TraceCheckUtils]: 130: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,299 INFO L290 TraceCheckUtils]: 131: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,299 INFO L290 TraceCheckUtils]: 132: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,299 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-08 09:30:42,301 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-08 09:30:42,301 INFO L290 TraceCheckUtils]: 135: Hoare triple {49250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:30:42,301 INFO L290 TraceCheckUtils]: 136: Hoare triple {49254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48745#false} is VALID [2022-04-08 09:30:42,301 INFO L290 TraceCheckUtils]: 137: Hoare triple {48745#false} assume !false; {48745#false} is VALID [2022-04-08 09:30:42,302 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-08 09:30:42,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:30:42,932 INFO L290 TraceCheckUtils]: 137: Hoare triple {48745#false} assume !false; {48745#false} is VALID [2022-04-08 09:30:42,933 INFO L290 TraceCheckUtils]: 136: Hoare triple {49254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48745#false} is VALID [2022-04-08 09:30:42,933 INFO L290 TraceCheckUtils]: 135: Hoare triple {49250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:30:42,934 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-08 09:30:42,934 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-08 09:30:42,934 INFO L290 TraceCheckUtils]: 132: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,934 INFO L290 TraceCheckUtils]: 131: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,934 INFO L290 TraceCheckUtils]: 130: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,934 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-08 09:30:42,934 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-08 09:30:42,935 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-08 09:30:42,935 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-08 09:30:42,935 INFO L290 TraceCheckUtils]: 125: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,935 INFO L290 TraceCheckUtils]: 124: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,935 INFO L290 TraceCheckUtils]: 123: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,935 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-08 09:30:42,936 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-08 09:30:42,936 INFO L290 TraceCheckUtils]: 120: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,936 INFO L290 TraceCheckUtils]: 119: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,936 INFO L290 TraceCheckUtils]: 118: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,936 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-08 09:30:42,936 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-08 09:30:42,936 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-08 09:30:42,937 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-08 09:30:42,937 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-08 09:30:42,937 INFO L290 TraceCheckUtils]: 112: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,937 INFO L290 TraceCheckUtils]: 111: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,938 INFO L290 TraceCheckUtils]: 110: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,938 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-08 09:30:42,938 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-08 09:30:42,938 INFO L290 TraceCheckUtils]: 107: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,938 INFO L290 TraceCheckUtils]: 106: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,938 INFO L290 TraceCheckUtils]: 105: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,938 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-08 09:30:42,939 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-08 09:30:42,939 INFO L290 TraceCheckUtils]: 102: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,939 INFO L290 TraceCheckUtils]: 101: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,939 INFO L290 TraceCheckUtils]: 100: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,939 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-08 09:30:42,939 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-08 09:30:42,939 INFO L290 TraceCheckUtils]: 97: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,939 INFO L290 TraceCheckUtils]: 96: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,939 INFO L290 TraceCheckUtils]: 95: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,939 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-08 09:30:42,940 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-08 09:30:42,940 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-08 09:30:42,940 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-08 09:30:42,940 INFO L290 TraceCheckUtils]: 90: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,940 INFO L290 TraceCheckUtils]: 89: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,941 INFO L290 TraceCheckUtils]: 88: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,941 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-08 09:30:42,942 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-08 09:30:42,942 INFO L290 TraceCheckUtils]: 85: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,942 INFO L290 TraceCheckUtils]: 84: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,942 INFO L290 TraceCheckUtils]: 83: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,943 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-08 09:30:42,943 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-08 09:30:42,943 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-08 09:30:42,943 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-08 09:30:42,943 INFO L290 TraceCheckUtils]: 78: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,944 INFO L290 TraceCheckUtils]: 77: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,944 INFO L290 TraceCheckUtils]: 76: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,944 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-08 09:30:42,944 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-08 09:30:42,944 INFO L290 TraceCheckUtils]: 73: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,944 INFO L290 TraceCheckUtils]: 72: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,944 INFO L290 TraceCheckUtils]: 71: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,944 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-08 09:30:42,945 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-08 09:30:42,945 INFO L290 TraceCheckUtils]: 68: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,945 INFO L290 TraceCheckUtils]: 67: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,945 INFO L290 TraceCheckUtils]: 66: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,945 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-08 09:30:42,945 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-08 09:30:42,945 INFO L290 TraceCheckUtils]: 63: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,945 INFO L290 TraceCheckUtils]: 62: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,945 INFO L290 TraceCheckUtils]: 61: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,945 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-08 09:30:42,946 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-08 09:30:42,946 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-08 09:30:42,946 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-08 09:30:42,947 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-08 09:30:42,947 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-08 09:30:42,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,947 INFO L290 TraceCheckUtils]: 53: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,947 INFO L290 TraceCheckUtils]: 52: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,947 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-08 09:30:42,948 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-08 09:30:42,948 INFO L290 TraceCheckUtils]: 49: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,948 INFO L290 TraceCheckUtils]: 47: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,948 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-08 09:30:42,948 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-08 09:30:42,948 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-08 09:30:42,949 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-08 09:30:42,949 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-08 09:30:42,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,949 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-08 09:30:42,950 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-08 09:30:42,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,950 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-08 09:30:42,950 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-08 09:30:42,950 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-08 09:30:42,951 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-08 09:30:42,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,952 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-08 09:30:42,952 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-08 09:30:42,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,952 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-08 09:30:42,953 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-08 09:30:42,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,953 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-08 09:30:42,953 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-08 09:30:42,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-08 09:30:42,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-08 09:30:42,953 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-08 09:30:42,954 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-08 09:30:42,954 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-08 09:30:42,954 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-08 09:30:42,954 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-08 09:30:42,955 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-08 09:30:42,955 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-08 09:30:42,955 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-08 09:30:42,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-08 09:30:42,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-08 09:30:42,955 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-08 09:30:42,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {48744#true} call ULTIMATE.init(); {48744#true} is VALID [2022-04-08 09:30:42,956 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-08 09:30:42,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841098950] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:30:42,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:30:42,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2022-04-08 09:30:42,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:30:42,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [85986862] [2022-04-08 09:30:42,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [85986862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:30:42,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:30:42,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:30:42,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260964943] [2022-04-08 09:30:42,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:30:42,957 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-08 09:30:42,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:30:42,957 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-08 09:30:43,011 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-08 09:30:43,011 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:30:43,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:30:43,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:30:43,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-04-08 09:30:43,012 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-08 09:30:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:30:52,780 INFO L93 Difference]: Finished difference Result 770 states and 1246 transitions. [2022-04-08 09:30:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 09:30:52,780 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-08 09:30:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:30:52,781 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-08 09:30:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 240 transitions. [2022-04-08 09:30:52,783 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-08 09:30:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 240 transitions. [2022-04-08 09:30:52,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 240 transitions. [2022-04-08 09:30:53,021 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-08 09:30:53,028 INFO L225 Difference]: With dead ends: 770 [2022-04-08 09:30:53,028 INFO L226 Difference]: Without dead ends: 309 [2022-04-08 09:30:53,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 09:30:53,030 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 132 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:30:53,031 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.3s Time] [2022-04-08 09:30:53,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-08 09:30:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 213. [2022-04-08 09:30:54,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:30:54,253 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-08 09:30:54,253 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-08 09:30:54,253 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-08 09:30:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:30:54,259 INFO L93 Difference]: Finished difference Result 309 states and 449 transitions. [2022-04-08 09:30:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 449 transitions. [2022-04-08 09:30:54,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:30:54,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:30:54,260 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-08 09:30:54,260 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-08 09:30:54,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:30:54,266 INFO L93 Difference]: Finished difference Result 309 states and 449 transitions. [2022-04-08 09:30:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 449 transitions. [2022-04-08 09:30:54,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:30:54,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:30:54,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:30:54,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:30:54,267 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-08 09:30:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 280 transitions. [2022-04-08 09:30:54,271 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 280 transitions. Word has length 138 [2022-04-08 09:30:54,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:30:54,271 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 280 transitions. [2022-04-08 09:30:54,271 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-08 09:30:54,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 280 transitions. [2022-04-08 09:30:54,792 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-08 09:30:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 280 transitions. [2022-04-08 09:30:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-08 09:30:54,794 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:30:54,794 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-08 09:30:54,809 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-08 09:30:54,994 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-08 09:30:54,994 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:30:54,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:30:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash -915763573, now seen corresponding path program 1 times [2022-04-08 09:30:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:30:54,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1492894211] [2022-04-08 09:30:54,995 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:30:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash -915763573, now seen corresponding path program 2 times [2022-04-08 09:30:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:30:54,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656480680] [2022-04-08 09:30:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:30:54,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:30:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:30:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,112 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-08 09:30:55,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,112 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-08 09:30:55,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:30:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,119 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-08 09:30:55,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:30:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,122 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-08 09:30:55,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 09:30:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,124 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-08 09:30:55,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 09:30:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,127 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-08 09:30:55,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 09:30:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,130 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-08 09:30:55,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-08 09:30:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,132 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-08 09:30:55,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 09:30:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,168 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-08 09:30:55,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-08 09:30:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,171 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-08 09:30:55,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 09:30:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,174 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-08 09:30:55,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 09:30:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,180 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-08 09:30:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 09:30:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,184 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-08 09:30:55,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-08 09:30:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,187 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-08 09:30:55,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 09:30:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,190 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-08 09:30:55,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-08 09:30:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,194 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-08 09:30:55,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-08 09:30:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,197 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-08 09:30:55,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-08 09:30:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,200 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-08 09:30:55,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-04-08 09:30:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,204 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-08 09:30:55,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-08 09:30:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,207 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-08 09:30:55,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-08 09:30:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,210 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-08 09:30:55,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-08 09:30:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,213 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-08 09:30:55,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-08 09:30:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,216 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-08 09:30:55,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-08 09:30:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,219 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-08 09:30:55,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-04-08 09:30:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,222 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-08 09:30:55,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-08 09:30:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,224 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-08 09:30:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-04-08 09:30:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-08 09:30:55,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-04-08 09:30:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-08 09:30:55,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-04-08 09:30:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-08 09:30:55,232 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-08 09:30:55,232 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-08 09:30:55,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-08 09:30:55,232 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-08 09:30:55,232 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-08 09:30:55,232 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-08 09:30:55,232 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-08 09:30:55,232 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-08 09:30:55,233 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-08 09:30:55,233 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-08 09:30:55,233 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-08 09:30:55,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,234 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-08 09:30:55,234 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-08 09:30:55,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,234 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-08 09:30:55,235 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-08 09:30:55,235 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-08 09:30:55,235 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-08 09:30:55,235 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-08 09:30:55,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,236 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-08 09:30:55,236 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-08 09:30:55,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,236 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-08 09:30:55,237 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-08 09:30:55,237 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-08 09:30:55,237 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-08 09:30:55,238 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-08 09:30:55,238 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-08 09:30:55,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,238 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-08 09:30:55,238 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-08 09:30:55,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,239 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-08 09:30:55,239 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-08 09:30:55,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,239 INFO L290 TraceCheckUtils]: 50: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,239 INFO L290 TraceCheckUtils]: 51: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,239 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-08 09:30:55,239 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-08 09:30:55,240 INFO L290 TraceCheckUtils]: 54: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,240 INFO L290 TraceCheckUtils]: 55: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,240 INFO L290 TraceCheckUtils]: 56: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,240 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-08 09:30:55,240 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-08 09:30:55,240 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-08 09:30:55,241 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-08 09:30:55,241 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,241 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,241 INFO L290 TraceCheckUtils]: 63: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,241 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-08 09:30:55,241 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-08 09:30:55,241 INFO L290 TraceCheckUtils]: 66: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,241 INFO L290 TraceCheckUtils]: 67: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,241 INFO L290 TraceCheckUtils]: 68: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,242 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-08 09:30:55,242 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-08 09:30:55,242 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-08 09:30:55,242 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-08 09:30:55,242 INFO L290 TraceCheckUtils]: 73: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,242 INFO L290 TraceCheckUtils]: 74: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,242 INFO L290 TraceCheckUtils]: 75: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,243 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-08 09:30:55,243 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-08 09:30:55,243 INFO L290 TraceCheckUtils]: 78: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,243 INFO L290 TraceCheckUtils]: 79: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,243 INFO L290 TraceCheckUtils]: 80: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,243 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-08 09:30:55,243 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-08 09:30:55,244 INFO L290 TraceCheckUtils]: 83: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,244 INFO L290 TraceCheckUtils]: 84: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,244 INFO L290 TraceCheckUtils]: 85: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,244 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-08 09:30:55,244 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-08 09:30:55,244 INFO L290 TraceCheckUtils]: 88: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,244 INFO L290 TraceCheckUtils]: 89: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,244 INFO L290 TraceCheckUtils]: 90: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,245 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-08 09:30:55,245 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-08 09:30:55,245 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-08 09:30:55,246 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-08 09:30:55,246 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-08 09:30:55,246 INFO L290 TraceCheckUtils]: 96: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,246 INFO L290 TraceCheckUtils]: 97: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,246 INFO L290 TraceCheckUtils]: 98: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,246 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-08 09:30:55,246 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-08 09:30:55,246 INFO L290 TraceCheckUtils]: 101: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,246 INFO L290 TraceCheckUtils]: 102: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,246 INFO L290 TraceCheckUtils]: 103: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,247 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-08 09:30:55,247 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-08 09:30:55,247 INFO L290 TraceCheckUtils]: 106: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,247 INFO L290 TraceCheckUtils]: 107: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,247 INFO L290 TraceCheckUtils]: 108: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,247 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-08 09:30:55,247 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-08 09:30:55,247 INFO L290 TraceCheckUtils]: 111: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,248 INFO L290 TraceCheckUtils]: 112: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,248 INFO L290 TraceCheckUtils]: 113: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,248 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-08 09:30:55,248 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-08 09:30:55,249 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-08 09:30:55,249 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-08 09:30:55,249 INFO L290 TraceCheckUtils]: 118: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,249 INFO L290 TraceCheckUtils]: 119: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,249 INFO L290 TraceCheckUtils]: 120: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,249 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-08 09:30:55,249 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-08 09:30:55,249 INFO L290 TraceCheckUtils]: 123: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,249 INFO L290 TraceCheckUtils]: 124: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,249 INFO L290 TraceCheckUtils]: 125: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,250 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-08 09:30:55,250 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-08 09:30:55,250 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-08 09:30:55,250 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-08 09:30:55,251 INFO L290 TraceCheckUtils]: 130: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,251 INFO L290 TraceCheckUtils]: 131: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,251 INFO L290 TraceCheckUtils]: 132: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,251 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-08 09:30:55,251 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-08 09:30:55,251 INFO L290 TraceCheckUtils]: 135: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,251 INFO L290 TraceCheckUtils]: 136: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,251 INFO L290 TraceCheckUtils]: 137: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,252 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-08 09:30:55,252 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-08 09:30:55,252 INFO L290 TraceCheckUtils]: 140: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,252 INFO L290 TraceCheckUtils]: 141: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,252 INFO L290 TraceCheckUtils]: 142: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,252 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-08 09:30:55,252 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-08 09:30:55,252 INFO L290 TraceCheckUtils]: 145: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,252 INFO L290 TraceCheckUtils]: 146: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,252 INFO L290 TraceCheckUtils]: 147: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,253 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-08 09:30:55,253 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-08 09:30:55,254 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-08 09:30:55,254 INFO L290 TraceCheckUtils]: 151: Hoare triple {52290#false} assume !(~j~0 < ~r~0); {52290#false} is VALID [2022-04-08 09:30:55,254 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-08 09:30:55,254 INFO L290 TraceCheckUtils]: 153: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,254 INFO L290 TraceCheckUtils]: 154: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,254 INFO L290 TraceCheckUtils]: 155: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,254 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-08 09:30:55,254 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-08 09:30:55,254 INFO L290 TraceCheckUtils]: 158: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,254 INFO L290 TraceCheckUtils]: 159: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,254 INFO L290 TraceCheckUtils]: 160: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,254 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-08 09:30:55,254 INFO L290 TraceCheckUtils]: 162: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-08 09:30:55,254 INFO L290 TraceCheckUtils]: 163: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-08 09:30:55,254 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-08 09:30:55,254 INFO L290 TraceCheckUtils]: 165: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:30:55,255 INFO L290 TraceCheckUtils]: 166: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:30:55,255 INFO L290 TraceCheckUtils]: 167: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:30:55,255 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-08 09:30:55,255 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-08 09:30:55,255 INFO L290 TraceCheckUtils]: 170: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:30:55,255 INFO L290 TraceCheckUtils]: 171: Hoare triple {52290#false} assume 0 == ~cond; {52290#false} is VALID [2022-04-08 09:30:55,255 INFO L290 TraceCheckUtils]: 172: Hoare triple {52290#false} assume !false; {52290#false} is VALID [2022-04-08 09:30:55,255 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-08 09:30:55,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:30:55,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656480680] [2022-04-08 09:30:55,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656480680] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:30:55,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681810080] [2022-04-08 09:30:55,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:30:55,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:30:55,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:30:55,268 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-08 09:30:55,269 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-08 09:30:55,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:30:55,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:30:55,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 09:30:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:30:55,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:31:00,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {52289#true} call ULTIMATE.init(); {52289#true} is VALID [2022-04-08 09:31:00,044 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-08 09:31:00,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-08 09:31:00,044 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-08 09:31:00,044 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-08 09:31:00,045 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-08 09:31:00,045 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-08 09:31:00,045 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-08 09:31:00,046 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-08 09:31:00,046 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-08 09:31:00,046 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-08 09:31:00,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,047 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-08 09:31:00,047 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-08 09:31:00,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,048 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-08 09:31:00,048 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-08 09:31:00,049 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-08 09:31:00,049 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-08 09:31:00,049 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-08 09:31:00,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,050 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-08 09:31:00,050 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-08 09:31:00,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,051 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-08 09:31:00,052 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-08 09:31:00,053 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-08 09:31:00,053 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-08 09:31:00,053 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-08 09:31:00,053 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-08 09:31:00,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,054 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-08 09:31:00,054 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-08 09:31:00,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,055 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-08 09:31:00,055 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-08 09:31:00,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,055 INFO L290 TraceCheckUtils]: 51: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,055 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-08 09:31:00,055 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-08 09:31:00,055 INFO L290 TraceCheckUtils]: 54: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,055 INFO L290 TraceCheckUtils]: 55: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,056 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-08 09:31:00,056 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-08 09:31:00,057 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-08 09:31:00,057 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-08 09:31:00,057 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,057 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,057 INFO L290 TraceCheckUtils]: 63: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,057 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-08 09:31:00,057 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-08 09:31:00,058 INFO L290 TraceCheckUtils]: 66: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,058 INFO L290 TraceCheckUtils]: 67: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,058 INFO L290 TraceCheckUtils]: 68: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,058 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-08 09:31:00,058 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-08 09:31:00,059 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-08 09:31:00,059 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-08 09:31:00,059 INFO L290 TraceCheckUtils]: 73: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,059 INFO L290 TraceCheckUtils]: 74: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,059 INFO L290 TraceCheckUtils]: 75: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,060 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-08 09:31:00,060 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-08 09:31:00,060 INFO L290 TraceCheckUtils]: 78: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,060 INFO L290 TraceCheckUtils]: 79: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,060 INFO L290 TraceCheckUtils]: 80: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,060 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-08 09:31:00,060 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-08 09:31:00,060 INFO L290 TraceCheckUtils]: 83: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,060 INFO L290 TraceCheckUtils]: 84: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,060 INFO L290 TraceCheckUtils]: 85: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,061 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-08 09:31:00,061 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-08 09:31:00,061 INFO L290 TraceCheckUtils]: 88: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,061 INFO L290 TraceCheckUtils]: 89: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,061 INFO L290 TraceCheckUtils]: 90: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,061 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-08 09:31:00,062 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-08 09:31:00,063 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-08 09:31:00,063 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-08 09:31:00,063 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-08 09:31:00,063 INFO L290 TraceCheckUtils]: 96: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:31:00,063 INFO L290 TraceCheckUtils]: 97: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 09:31:00,063 INFO L290 TraceCheckUtils]: 98: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 09:31:00,063 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52290#false} {52290#false} #110#return; {52290#false} is VALID [2022-04-08 09:31:00,063 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-08 09:31:00,063 INFO L290 TraceCheckUtils]: 101: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:31:00,064 INFO L290 TraceCheckUtils]: 102: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 09:31:00,064 INFO L290 TraceCheckUtils]: 103: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 09:31:00,064 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {52290#false} {52290#false} #112#return; {52290#false} is VALID [2022-04-08 09:31:00,064 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-08 09:31:00,064 INFO L290 TraceCheckUtils]: 106: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:31:00,064 INFO L290 TraceCheckUtils]: 107: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 09:31:00,064 INFO L290 TraceCheckUtils]: 108: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 09:31:00,064 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {52290#false} {52290#false} #114#return; {52290#false} is VALID [2022-04-08 09:31:00,064 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-08 09:31:00,064 INFO L290 TraceCheckUtils]: 111: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:31:00,064 INFO L290 TraceCheckUtils]: 112: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 09:31:00,064 INFO L290 TraceCheckUtils]: 113: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 09:31:00,064 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {52290#false} {52290#false} #116#return; {52290#false} is VALID [2022-04-08 09:31:00,064 INFO L290 TraceCheckUtils]: 115: Hoare triple {52290#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52290#false} is VALID [2022-04-08 09:31:00,064 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-08 09:31:00,064 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-08 09:31:00,064 INFO L290 TraceCheckUtils]: 118: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:31:00,064 INFO L290 TraceCheckUtils]: 119: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 09:31:00,065 INFO L290 TraceCheckUtils]: 120: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 09:31:00,065 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {52290#false} {52290#false} #118#return; {52290#false} is VALID [2022-04-08 09:31:00,065 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-08 09:31:00,065 INFO L290 TraceCheckUtils]: 123: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:31:00,065 INFO L290 TraceCheckUtils]: 124: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 09:31:00,065 INFO L290 TraceCheckUtils]: 125: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 09:31:00,065 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {52290#false} {52290#false} #120#return; {52290#false} is VALID [2022-04-08 09:31:00,065 INFO L290 TraceCheckUtils]: 127: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-08 09:31:00,065 INFO L290 TraceCheckUtils]: 128: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-08 09:31:00,065 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-08 09:31:00,065 INFO L290 TraceCheckUtils]: 130: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:31:00,065 INFO L290 TraceCheckUtils]: 131: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 09:31:00,065 INFO L290 TraceCheckUtils]: 132: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 09:31:00,065 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {52290#false} {52290#false} #122#return; {52290#false} is VALID [2022-04-08 09:31:00,065 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-08 09:31:00,065 INFO L290 TraceCheckUtils]: 135: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:31:00,065 INFO L290 TraceCheckUtils]: 136: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 09:31:00,065 INFO L290 TraceCheckUtils]: 137: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 09:31:00,065 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {52290#false} {52290#false} #124#return; {52290#false} is VALID [2022-04-08 09:31:00,066 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-08 09:31:00,066 INFO L290 TraceCheckUtils]: 140: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:31:00,066 INFO L290 TraceCheckUtils]: 141: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 09:31:00,066 INFO L290 TraceCheckUtils]: 142: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 09:31:00,066 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {52290#false} {52290#false} #126#return; {52290#false} is VALID [2022-04-08 09:31:00,066 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-08 09:31:00,066 INFO L290 TraceCheckUtils]: 145: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:31:00,066 INFO L290 TraceCheckUtils]: 146: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 09:31:00,066 INFO L290 TraceCheckUtils]: 147: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 09:31:00,066 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {52290#false} {52290#false} #128#return; {52290#false} is VALID [2022-04-08 09:31:00,066 INFO L290 TraceCheckUtils]: 149: Hoare triple {52290#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52290#false} is VALID [2022-04-08 09:31:00,066 INFO L290 TraceCheckUtils]: 150: Hoare triple {52290#false} assume !!(~j~0 <= ~r~0); {52290#false} is VALID [2022-04-08 09:31:00,066 INFO L290 TraceCheckUtils]: 151: Hoare triple {52290#false} assume !(~j~0 < ~r~0); {52290#false} is VALID [2022-04-08 09:31:00,066 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-08 09:31:00,066 INFO L290 TraceCheckUtils]: 153: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:31:00,066 INFO L290 TraceCheckUtils]: 154: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 09:31:00,066 INFO L290 TraceCheckUtils]: 155: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 09:31:00,066 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {52290#false} {52290#false} #118#return; {52290#false} is VALID [2022-04-08 09:31:00,066 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-08 09:31:00,067 INFO L290 TraceCheckUtils]: 158: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:31:00,067 INFO L290 TraceCheckUtils]: 159: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 09:31:00,067 INFO L290 TraceCheckUtils]: 160: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 09:31:00,067 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {52290#false} {52290#false} #120#return; {52290#false} is VALID [2022-04-08 09:31:00,067 INFO L290 TraceCheckUtils]: 162: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-08 09:31:00,067 INFO L290 TraceCheckUtils]: 163: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-08 09:31:00,067 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-08 09:31:00,067 INFO L290 TraceCheckUtils]: 165: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:31:00,067 INFO L290 TraceCheckUtils]: 166: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-08 09:31:00,067 INFO L290 TraceCheckUtils]: 167: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-08 09:31:00,067 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {52290#false} {52290#false} #122#return; {52290#false} is VALID [2022-04-08 09:31:00,067 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-08 09:31:00,067 INFO L290 TraceCheckUtils]: 170: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:31:00,067 INFO L290 TraceCheckUtils]: 171: Hoare triple {52290#false} assume 0 == ~cond; {52290#false} is VALID [2022-04-08 09:31:00,067 INFO L290 TraceCheckUtils]: 172: Hoare triple {52290#false} assume !false; {52290#false} is VALID [2022-04-08 09:31:00,068 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-08 09:31:00,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:31:00,945 INFO L290 TraceCheckUtils]: 172: Hoare triple {52290#false} assume !false; {52290#false} is VALID [2022-04-08 09:31:00,945 INFO L290 TraceCheckUtils]: 171: Hoare triple {52290#false} assume 0 == ~cond; {52290#false} is VALID [2022-04-08 09:31:00,945 INFO L290 TraceCheckUtils]: 170: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-08 09:31:00,945 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-08 09:31:00,945 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-08 09:31:00,945 INFO L290 TraceCheckUtils]: 167: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,945 INFO L290 TraceCheckUtils]: 166: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,946 INFO L290 TraceCheckUtils]: 165: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,946 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-08 09:31:00,946 INFO L290 TraceCheckUtils]: 163: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-08 09:31:00,946 INFO L290 TraceCheckUtils]: 162: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-08 09:31:00,946 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-08 09:31:00,946 INFO L290 TraceCheckUtils]: 160: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,946 INFO L290 TraceCheckUtils]: 159: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,946 INFO L290 TraceCheckUtils]: 158: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,946 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-08 09:31:00,946 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-08 09:31:00,946 INFO L290 TraceCheckUtils]: 155: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,946 INFO L290 TraceCheckUtils]: 154: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,946 INFO L290 TraceCheckUtils]: 153: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,946 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-08 09:31:00,946 INFO L290 TraceCheckUtils]: 151: Hoare triple {52290#false} assume !(~j~0 < ~r~0); {52290#false} is VALID [2022-04-08 09:31:00,946 INFO L290 TraceCheckUtils]: 150: Hoare triple {52290#false} assume !!(~j~0 <= ~r~0); {52290#false} is VALID [2022-04-08 09:31:00,946 INFO L290 TraceCheckUtils]: 149: Hoare triple {52290#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52290#false} is VALID [2022-04-08 09:31:00,946 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {52289#true} {52290#false} #128#return; {52290#false} is VALID [2022-04-08 09:31:00,947 INFO L290 TraceCheckUtils]: 147: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,947 INFO L290 TraceCheckUtils]: 146: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,947 INFO L290 TraceCheckUtils]: 145: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,947 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-08 09:31:00,947 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {52289#true} {52290#false} #126#return; {52290#false} is VALID [2022-04-08 09:31:00,947 INFO L290 TraceCheckUtils]: 142: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,947 INFO L290 TraceCheckUtils]: 141: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,947 INFO L290 TraceCheckUtils]: 140: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,947 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-08 09:31:00,947 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {52289#true} {52290#false} #124#return; {52290#false} is VALID [2022-04-08 09:31:00,947 INFO L290 TraceCheckUtils]: 137: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,947 INFO L290 TraceCheckUtils]: 136: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,947 INFO L290 TraceCheckUtils]: 135: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,947 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-08 09:31:00,947 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-08 09:31:00,947 INFO L290 TraceCheckUtils]: 132: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,947 INFO L290 TraceCheckUtils]: 131: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,947 INFO L290 TraceCheckUtils]: 130: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,948 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-08 09:31:00,948 INFO L290 TraceCheckUtils]: 128: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-08 09:31:00,948 INFO L290 TraceCheckUtils]: 127: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-08 09:31:00,948 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-08 09:31:00,948 INFO L290 TraceCheckUtils]: 125: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,948 INFO L290 TraceCheckUtils]: 124: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,948 INFO L290 TraceCheckUtils]: 123: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,948 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-08 09:31:00,948 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-08 09:31:00,948 INFO L290 TraceCheckUtils]: 120: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,948 INFO L290 TraceCheckUtils]: 119: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,948 INFO L290 TraceCheckUtils]: 118: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,948 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-08 09:31:00,948 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-08 09:31:00,948 INFO L290 TraceCheckUtils]: 115: Hoare triple {52290#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52290#false} is VALID [2022-04-08 09:31:00,948 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {52289#true} {52290#false} #116#return; {52290#false} is VALID [2022-04-08 09:31:00,948 INFO L290 TraceCheckUtils]: 113: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,948 INFO L290 TraceCheckUtils]: 112: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,949 INFO L290 TraceCheckUtils]: 111: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,949 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-08 09:31:00,949 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {52289#true} {52290#false} #114#return; {52290#false} is VALID [2022-04-08 09:31:00,949 INFO L290 TraceCheckUtils]: 108: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,949 INFO L290 TraceCheckUtils]: 107: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,949 INFO L290 TraceCheckUtils]: 106: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,949 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-08 09:31:00,949 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {52289#true} {52290#false} #112#return; {52290#false} is VALID [2022-04-08 09:31:00,949 INFO L290 TraceCheckUtils]: 103: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,949 INFO L290 TraceCheckUtils]: 102: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,949 INFO L290 TraceCheckUtils]: 101: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,949 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-08 09:31:00,949 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52289#true} {52290#false} #110#return; {52290#false} is VALID [2022-04-08 09:31:00,949 INFO L290 TraceCheckUtils]: 98: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,949 INFO L290 TraceCheckUtils]: 97: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,949 INFO L290 TraceCheckUtils]: 96: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,949 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-08 09:31:00,950 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-08 09:31:00,950 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-08 09:31:00,950 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-08 09:31:00,951 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-08 09:31:00,951 INFO L290 TraceCheckUtils]: 90: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,951 INFO L290 TraceCheckUtils]: 89: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,951 INFO L290 TraceCheckUtils]: 88: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,951 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-08 09:31:00,951 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-08 09:31:00,951 INFO L290 TraceCheckUtils]: 85: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,952 INFO L290 TraceCheckUtils]: 84: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,952 INFO L290 TraceCheckUtils]: 83: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,952 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-08 09:31:00,952 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-08 09:31:00,952 INFO L290 TraceCheckUtils]: 80: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,952 INFO L290 TraceCheckUtils]: 79: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,952 INFO L290 TraceCheckUtils]: 78: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,952 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-08 09:31:00,953 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-08 09:31:00,953 INFO L290 TraceCheckUtils]: 75: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,953 INFO L290 TraceCheckUtils]: 74: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,953 INFO L290 TraceCheckUtils]: 73: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,953 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-08 09:31:00,953 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-08 09:31:00,953 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-08 09:31:00,954 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-08 09:31:00,954 INFO L290 TraceCheckUtils]: 68: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,954 INFO L290 TraceCheckUtils]: 67: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,954 INFO L290 TraceCheckUtils]: 66: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,954 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-08 09:31:00,954 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-08 09:31:00,955 INFO L290 TraceCheckUtils]: 63: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,955 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,955 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,955 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-08 09:31:00,955 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-08 09:31:00,955 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-08 09:31:00,956 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-08 09:31:00,956 INFO L290 TraceCheckUtils]: 56: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,956 INFO L290 TraceCheckUtils]: 55: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,956 INFO L290 TraceCheckUtils]: 54: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,956 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-08 09:31:00,956 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-08 09:31:00,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,956 INFO L290 TraceCheckUtils]: 49: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,957 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-08 09:31:00,957 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-08 09:31:00,957 INFO L290 TraceCheckUtils]: 46: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,957 INFO L290 TraceCheckUtils]: 45: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,957 INFO L290 TraceCheckUtils]: 44: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,957 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-08 09:31:00,957 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-08 09:31:00,958 INFO L290 TraceCheckUtils]: 41: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,958 INFO L290 TraceCheckUtils]: 40: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,958 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-08 09:31:00,958 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-08 09:31:00,958 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-08 09:31:00,959 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-08 09:31:00,959 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-08 09:31:00,960 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-08 09:31:00,960 INFO L290 TraceCheckUtils]: 32: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,960 INFO L290 TraceCheckUtils]: 31: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,960 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-08 09:31:00,960 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-08 09:31:00,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,961 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-08 09:31:00,961 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-08 09:31:00,961 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-08 09:31:00,962 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-08 09:31:00,962 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-08 09:31:00,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,962 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-08 09:31:00,963 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-08 09:31:00,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-08 09:31:00,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-08 09:31:00,963 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-08 09:31:00,964 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-08 09:31:00,964 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-08 09:31:00,964 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-08 09:31:00,964 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-08 09:31:00,964 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-08 09:31:00,965 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-08 09:31:00,965 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-08 09:31:00,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-08 09:31:00,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-08 09:31:00,965 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-08 09:31:00,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {52289#true} call ULTIMATE.init(); {52289#true} is VALID [2022-04-08 09:31:00,965 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-08 09:31:00,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681810080] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:31:00,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:31:00,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2022-04-08 09:31:00,966 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:31:00,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1492894211] [2022-04-08 09:31:00,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1492894211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:31:00,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:31:00,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:31:00,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894693840] [2022-04-08 09:31:00,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:31:00,966 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-08 09:31:00,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:31:00,967 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-08 09:31:01,033 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-08 09:31:01,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:31:01,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:31:01,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:31:01,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-04-08 09:31:01,034 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-08 09:31:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:31:05,132 INFO L93 Difference]: Finished difference Result 399 states and 535 transitions. [2022-04-08 09:31:05,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 09:31:05,132 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-08 09:31:05,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:31:05,133 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-08 09:31:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 223 transitions. [2022-04-08 09:31:05,135 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-08 09:31:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 223 transitions. [2022-04-08 09:31:05,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 223 transitions. [2022-04-08 09:31:05,329 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-08 09:31:05,333 INFO L225 Difference]: With dead ends: 399 [2022-04-08 09:31:05,333 INFO L226 Difference]: Without dead ends: 246 [2022-04-08 09:31:05,334 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=868, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 09:31:05,334 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 88 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:31:05,334 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.1s Time] [2022-04-08 09:31:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-04-08 09:31:06,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 211. [2022-04-08 09:31:06,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:31:06,678 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-08 09:31:06,683 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-08 09:31:06,683 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-08 09:31:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:31:06,687 INFO L93 Difference]: Finished difference Result 246 states and 325 transitions. [2022-04-08 09:31:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 325 transitions. [2022-04-08 09:31:06,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:31:06,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:31:06,688 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-08 09:31:06,688 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-08 09:31:06,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:31:06,692 INFO L93 Difference]: Finished difference Result 246 states and 325 transitions. [2022-04-08 09:31:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 325 transitions. [2022-04-08 09:31:06,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:31:06,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:31:06,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:31:06,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:31:06,692 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-08 09:31:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2022-04-08 09:31:06,696 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 173 [2022-04-08 09:31:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:31:06,696 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2022-04-08 09:31:06,696 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-08 09:31:06,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 276 transitions. [2022-04-08 09:31:07,246 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-08 09:31:07,246 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2022-04-08 09:31:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-08 09:31:07,247 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:31:07,247 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-08 09:31:07,265 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-08 09:31:07,448 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-08 09:31:07,448 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:31:07,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:31:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash 345153677, now seen corresponding path program 5 times [2022-04-08 09:31:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:31:07,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [682790917] [2022-04-08 09:31:07,449 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:31:07,449 INFO L85 PathProgramCache]: Analyzing trace with hash 345153677, now seen corresponding path program 6 times [2022-04-08 09:31:07,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:31:07,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645355117] [2022-04-08 09:31:07,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:31:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:31:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:31:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,537 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-08 09:31:07,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-08 09:31:07,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:31:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,540 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-08 09:31:07,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:31:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,542 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-08 09:31:07,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 09:31:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,545 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-08 09:31:07,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 09:31:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,548 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-08 09:31:07,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 09:31:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,550 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-08 09:31:07,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-08 09:31:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,552 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-08 09:31:07,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 09:31:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,554 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-08 09:31:07,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-08 09:31:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,563 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-08 09:31:07,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 09:31:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,566 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-08 09:31:07,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 09:31:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,568 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-08 09:31:07,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 09:31:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,572 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-08 09:31:07,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-08 09:31:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,574 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-08 09:31:07,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 09:31:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,576 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-08 09:31:07,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-08 09:31:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,579 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-08 09:31:07,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-08 09:31:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #110#return; {55195#false} is VALID [2022-04-08 09:31:07,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-08 09:31:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #112#return; {55195#false} is VALID [2022-04-08 09:31:07,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-04-08 09:31:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #114#return; {55195#false} is VALID [2022-04-08 09:31:07,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-08 09:31:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #116#return; {55195#false} is VALID [2022-04-08 09:31:07,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-08 09:31:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-08 09:31:07,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-08 09:31:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-08 09:31:07,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-08 09:31:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-08 09:31:07,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-08 09:31:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #124#return; {55195#false} is VALID [2022-04-08 09:31:07,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-04-08 09:31:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #126#return; {55195#false} is VALID [2022-04-08 09:31:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-08 09:31:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #128#return; {55195#false} is VALID [2022-04-08 09:31:07,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-04-08 09:31:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-08 09:31:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-04-08 09:31:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-08 09:31:07,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-04-08 09:31:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-08 09:31:07,613 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-08 09:31:07,613 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-08 09:31:07,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-08 09:31:07,613 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-08 09:31:07,613 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-08 09:31:07,613 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-08 09:31:07,613 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-08 09:31:07,614 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-08 09:31:07,614 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-08 09:31:07,614 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-08 09:31:07,614 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-08 09:31:07,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,615 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-08 09:31:07,615 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-08 09:31:07,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,616 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-08 09:31:07,616 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-08 09:31:07,616 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-08 09:31:07,617 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-08 09:31:07,617 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-08 09:31:07,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,617 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-08 09:31:07,617 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-08 09:31:07,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,618 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-08 09:31:07,618 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-08 09:31:07,619 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-08 09:31:07,619 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-08 09:31:07,619 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-08 09:31:07,619 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-08 09:31:07,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,620 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-08 09:31:07,620 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-08 09:31:07,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,620 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-08 09:31:07,620 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-08 09:31:07,621 INFO L290 TraceCheckUtils]: 49: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,621 INFO L290 TraceCheckUtils]: 50: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,621 INFO L290 TraceCheckUtils]: 51: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,621 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-08 09:31:07,621 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-08 09:31:07,621 INFO L290 TraceCheckUtils]: 54: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,621 INFO L290 TraceCheckUtils]: 55: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,621 INFO L290 TraceCheckUtils]: 56: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,622 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-08 09:31:07,622 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-08 09:31:07,622 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-08 09:31:07,622 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-08 09:31:07,622 INFO L290 TraceCheckUtils]: 61: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,622 INFO L290 TraceCheckUtils]: 62: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,622 INFO L290 TraceCheckUtils]: 63: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,623 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-08 09:31:07,623 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-08 09:31:07,623 INFO L290 TraceCheckUtils]: 66: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,623 INFO L290 TraceCheckUtils]: 67: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,623 INFO L290 TraceCheckUtils]: 68: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,623 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-08 09:31:07,624 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-08 09:31:07,624 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-08 09:31:07,624 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-08 09:31:07,624 INFO L290 TraceCheckUtils]: 73: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,624 INFO L290 TraceCheckUtils]: 74: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,624 INFO L290 TraceCheckUtils]: 75: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,625 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-08 09:31:07,625 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-08 09:31:07,625 INFO L290 TraceCheckUtils]: 78: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,625 INFO L290 TraceCheckUtils]: 79: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,625 INFO L290 TraceCheckUtils]: 80: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,625 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-08 09:31:07,625 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-08 09:31:07,625 INFO L290 TraceCheckUtils]: 83: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,625 INFO L290 TraceCheckUtils]: 84: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,625 INFO L290 TraceCheckUtils]: 85: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,626 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-08 09:31:07,626 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-08 09:31:07,626 INFO L290 TraceCheckUtils]: 88: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,626 INFO L290 TraceCheckUtils]: 89: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,626 INFO L290 TraceCheckUtils]: 90: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,626 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-08 09:31:07,627 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-08 09:31:07,627 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-08 09:31:07,627 INFO L290 TraceCheckUtils]: 94: Hoare triple {55260#(<= main_~r~0 main_~j~0)} assume ~j~0 < ~r~0; {55195#false} is VALID [2022-04-08 09:31:07,627 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-08 09:31:07,627 INFO L290 TraceCheckUtils]: 96: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,628 INFO L290 TraceCheckUtils]: 97: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,628 INFO L290 TraceCheckUtils]: 98: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,628 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {55194#true} {55195#false} #110#return; {55195#false} is VALID [2022-04-08 09:31:07,628 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-08 09:31:07,628 INFO L290 TraceCheckUtils]: 101: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,628 INFO L290 TraceCheckUtils]: 102: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,628 INFO L290 TraceCheckUtils]: 103: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,628 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {55194#true} {55195#false} #112#return; {55195#false} is VALID [2022-04-08 09:31:07,628 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-08 09:31:07,628 INFO L290 TraceCheckUtils]: 106: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,628 INFO L290 TraceCheckUtils]: 107: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,628 INFO L290 TraceCheckUtils]: 108: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,628 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {55194#true} {55195#false} #114#return; {55195#false} is VALID [2022-04-08 09:31:07,628 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-08 09:31:07,628 INFO L290 TraceCheckUtils]: 111: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,628 INFO L290 TraceCheckUtils]: 112: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,628 INFO L290 TraceCheckUtils]: 113: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,628 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {55194#true} {55195#false} #116#return; {55195#false} is VALID [2022-04-08 09:31:07,629 INFO L290 TraceCheckUtils]: 115: Hoare triple {55195#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {55195#false} is VALID [2022-04-08 09:31:07,629 INFO L290 TraceCheckUtils]: 116: Hoare triple {55195#false} assume !(0 != #t~nondet4);havoc #t~nondet4; {55195#false} is VALID [2022-04-08 09:31:07,629 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-08 09:31:07,629 INFO L290 TraceCheckUtils]: 118: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,629 INFO L290 TraceCheckUtils]: 119: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,629 INFO L290 TraceCheckUtils]: 120: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,629 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-08 09:31:07,629 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-08 09:31:07,629 INFO L290 TraceCheckUtils]: 123: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,629 INFO L290 TraceCheckUtils]: 124: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,629 INFO L290 TraceCheckUtils]: 125: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,629 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-08 09:31:07,629 INFO L290 TraceCheckUtils]: 127: Hoare triple {55195#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55195#false} is VALID [2022-04-08 09:31:07,629 INFO L290 TraceCheckUtils]: 128: Hoare triple {55195#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {55195#false} is VALID [2022-04-08 09:31:07,629 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-08 09:31:07,629 INFO L290 TraceCheckUtils]: 130: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,629 INFO L290 TraceCheckUtils]: 131: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,629 INFO L290 TraceCheckUtils]: 132: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,629 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-08 09:31:07,630 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-08 09:31:07,630 INFO L290 TraceCheckUtils]: 135: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,630 INFO L290 TraceCheckUtils]: 136: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,630 INFO L290 TraceCheckUtils]: 137: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,630 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {55194#true} {55195#false} #124#return; {55195#false} is VALID [2022-04-08 09:31:07,630 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-08 09:31:07,630 INFO L290 TraceCheckUtils]: 140: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,630 INFO L290 TraceCheckUtils]: 141: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,630 INFO L290 TraceCheckUtils]: 142: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,630 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {55194#true} {55195#false} #126#return; {55195#false} is VALID [2022-04-08 09:31:07,630 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-08 09:31:07,630 INFO L290 TraceCheckUtils]: 145: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,630 INFO L290 TraceCheckUtils]: 146: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,630 INFO L290 TraceCheckUtils]: 147: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,630 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {55194#true} {55195#false} #128#return; {55195#false} is VALID [2022-04-08 09:31:07,630 INFO L290 TraceCheckUtils]: 149: Hoare triple {55195#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {55195#false} is VALID [2022-04-08 09:31:07,630 INFO L290 TraceCheckUtils]: 150: Hoare triple {55195#false} assume !!(~j~0 <= ~r~0); {55195#false} is VALID [2022-04-08 09:31:07,630 INFO L290 TraceCheckUtils]: 151: Hoare triple {55195#false} assume !(~j~0 < ~r~0); {55195#false} is VALID [2022-04-08 09:31:07,630 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-08 09:31:07,631 INFO L290 TraceCheckUtils]: 153: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,631 INFO L290 TraceCheckUtils]: 154: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,631 INFO L290 TraceCheckUtils]: 155: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,631 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-08 09:31:07,631 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-08 09:31:07,631 INFO L290 TraceCheckUtils]: 158: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,631 INFO L290 TraceCheckUtils]: 159: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,631 INFO L290 TraceCheckUtils]: 160: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,631 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-08 09:31:07,631 INFO L290 TraceCheckUtils]: 162: Hoare triple {55195#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55195#false} is VALID [2022-04-08 09:31:07,631 INFO L290 TraceCheckUtils]: 163: Hoare triple {55195#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {55195#false} is VALID [2022-04-08 09:31:07,631 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-08 09:31:07,631 INFO L290 TraceCheckUtils]: 165: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:07,631 INFO L290 TraceCheckUtils]: 166: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:07,631 INFO L290 TraceCheckUtils]: 167: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:07,631 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-08 09:31:07,631 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-08 09:31:07,631 INFO L290 TraceCheckUtils]: 170: Hoare triple {55195#false} ~cond := #in~cond; {55195#false} is VALID [2022-04-08 09:31:07,632 INFO L290 TraceCheckUtils]: 171: Hoare triple {55195#false} assume 0 == ~cond; {55195#false} is VALID [2022-04-08 09:31:07,632 INFO L290 TraceCheckUtils]: 172: Hoare triple {55195#false} assume !false; {55195#false} is VALID [2022-04-08 09:31:07,632 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-08 09:31:07,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:31:07,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645355117] [2022-04-08 09:31:07,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645355117] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:31:07,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448641907] [2022-04-08 09:31:07,632 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:31:07,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:31:07,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:31:07,633 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-08 09:31:07,634 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-08 09:31:07,682 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 09:31:07,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:31:07,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 09:31:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:31:07,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:31:08,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {55194#true} call ULTIMATE.init(); {55194#true} is VALID [2022-04-08 09:31:08,786 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-08 09:31:08,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-08 09:31:08,786 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-08 09:31:08,786 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-08 09:31:08,786 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-08 09:31:08,787 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-08 09:31:08,787 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-08 09:31:08,787 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-08 09:31:08,787 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-08 09:31:08,788 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-08 09:31:08,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,788 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-08 09:31:08,788 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-08 09:31:08,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,789 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-08 09:31:08,789 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-08 09:31:08,789 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-08 09:31:08,789 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-08 09:31:08,790 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-08 09:31:08,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,790 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-08 09:31:08,790 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-08 09:31:08,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,791 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-08 09:31:08,791 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-08 09:31:08,791 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-08 09:31:08,792 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-08 09:31:08,792 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-08 09:31:08,792 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-08 09:31:08,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,792 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-08 09:31:08,793 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-08 09:31:08,793 INFO L290 TraceCheckUtils]: 44: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,802 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-08 09:31:08,802 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-08 09:31:08,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,802 INFO L290 TraceCheckUtils]: 50: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,803 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-08 09:31:08,803 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-08 09:31:08,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,803 INFO L290 TraceCheckUtils]: 55: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,804 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-08 09:31:08,804 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-08 09:31:08,804 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-08 09:31:08,804 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-08 09:31:08,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,805 INFO L290 TraceCheckUtils]: 62: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,805 INFO L290 TraceCheckUtils]: 63: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,805 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-08 09:31:08,805 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-08 09:31:08,805 INFO L290 TraceCheckUtils]: 66: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,805 INFO L290 TraceCheckUtils]: 67: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,805 INFO L290 TraceCheckUtils]: 68: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,806 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-08 09:31:08,806 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-08 09:31:08,806 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-08 09:31:08,806 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-08 09:31:08,806 INFO L290 TraceCheckUtils]: 73: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,806 INFO L290 TraceCheckUtils]: 74: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,807 INFO L290 TraceCheckUtils]: 75: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,807 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-08 09:31:08,807 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-08 09:31:08,807 INFO L290 TraceCheckUtils]: 78: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,807 INFO L290 TraceCheckUtils]: 79: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,807 INFO L290 TraceCheckUtils]: 80: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,808 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-08 09:31:08,808 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-08 09:31:08,808 INFO L290 TraceCheckUtils]: 83: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,808 INFO L290 TraceCheckUtils]: 84: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,808 INFO L290 TraceCheckUtils]: 85: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,808 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-08 09:31:08,809 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-08 09:31:08,809 INFO L290 TraceCheckUtils]: 88: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,809 INFO L290 TraceCheckUtils]: 89: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,809 INFO L290 TraceCheckUtils]: 90: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,809 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-08 09:31:08,810 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-08 09:31:08,810 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-08 09:31:08,810 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-08 09:31:08,810 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-08 09:31:08,810 INFO L290 TraceCheckUtils]: 96: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,810 INFO L290 TraceCheckUtils]: 97: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,811 INFO L290 TraceCheckUtils]: 98: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,811 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-08 09:31:08,811 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-08 09:31:08,811 INFO L290 TraceCheckUtils]: 101: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,811 INFO L290 TraceCheckUtils]: 102: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,811 INFO L290 TraceCheckUtils]: 103: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,812 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-08 09:31:08,812 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-08 09:31:08,812 INFO L290 TraceCheckUtils]: 106: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,812 INFO L290 TraceCheckUtils]: 107: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,812 INFO L290 TraceCheckUtils]: 108: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,812 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-08 09:31:08,812 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-08 09:31:08,813 INFO L290 TraceCheckUtils]: 111: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,813 INFO L290 TraceCheckUtils]: 112: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,813 INFO L290 TraceCheckUtils]: 113: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,813 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-08 09:31:08,814 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-08 09:31:08,814 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-08 09:31:08,814 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-08 09:31:08,814 INFO L290 TraceCheckUtils]: 118: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,814 INFO L290 TraceCheckUtils]: 119: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,814 INFO L290 TraceCheckUtils]: 120: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,815 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-08 09:31:08,815 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-08 09:31:08,815 INFO L290 TraceCheckUtils]: 123: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,815 INFO L290 TraceCheckUtils]: 124: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,815 INFO L290 TraceCheckUtils]: 125: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,815 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-08 09:31:08,816 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-08 09:31:08,816 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-08 09:31:08,816 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-08 09:31:08,816 INFO L290 TraceCheckUtils]: 130: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,816 INFO L290 TraceCheckUtils]: 131: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,816 INFO L290 TraceCheckUtils]: 132: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,817 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-08 09:31:08,817 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-08 09:31:08,817 INFO L290 TraceCheckUtils]: 135: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,817 INFO L290 TraceCheckUtils]: 136: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,817 INFO L290 TraceCheckUtils]: 137: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,817 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-08 09:31:08,818 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-08 09:31:08,818 INFO L290 TraceCheckUtils]: 140: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,818 INFO L290 TraceCheckUtils]: 141: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,818 INFO L290 TraceCheckUtils]: 142: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,818 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-08 09:31:08,818 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-08 09:31:08,818 INFO L290 TraceCheckUtils]: 145: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,818 INFO L290 TraceCheckUtils]: 146: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,818 INFO L290 TraceCheckUtils]: 147: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,819 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-08 09:31:08,819 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-08 09:31:08,820 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-08 09:31:08,820 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-08 09:31:08,820 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-08 09:31:08,820 INFO L290 TraceCheckUtils]: 153: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,820 INFO L290 TraceCheckUtils]: 154: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,820 INFO L290 TraceCheckUtils]: 155: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,821 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-08 09:31:08,821 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-08 09:31:08,821 INFO L290 TraceCheckUtils]: 158: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,821 INFO L290 TraceCheckUtils]: 159: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,821 INFO L290 TraceCheckUtils]: 160: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,822 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-08 09:31:08,822 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-08 09:31:08,822 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-08 09:31:08,822 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-08 09:31:08,822 INFO L290 TraceCheckUtils]: 165: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:08,822 INFO L290 TraceCheckUtils]: 166: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:08,822 INFO L290 TraceCheckUtils]: 167: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:08,823 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-08 09:31:08,823 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-08 09:31:08,824 INFO L290 TraceCheckUtils]: 170: Hoare triple {55828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {55832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:31:08,824 INFO L290 TraceCheckUtils]: 171: Hoare triple {55832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {55195#false} is VALID [2022-04-08 09:31:08,824 INFO L290 TraceCheckUtils]: 172: Hoare triple {55195#false} assume !false; {55195#false} is VALID [2022-04-08 09:31:08,825 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-08 09:31:08,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:31:09,563 INFO L290 TraceCheckUtils]: 172: Hoare triple {55195#false} assume !false; {55195#false} is VALID [2022-04-08 09:31:09,564 INFO L290 TraceCheckUtils]: 171: Hoare triple {55832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {55195#false} is VALID [2022-04-08 09:31:09,564 INFO L290 TraceCheckUtils]: 170: Hoare triple {55828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {55832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:31:09,565 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-08 09:31:09,565 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-08 09:31:09,565 INFO L290 TraceCheckUtils]: 167: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,565 INFO L290 TraceCheckUtils]: 166: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,565 INFO L290 TraceCheckUtils]: 165: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,565 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-08 09:31:09,566 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-08 09:31:09,566 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-08 09:31:09,566 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-08 09:31:09,566 INFO L290 TraceCheckUtils]: 160: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,566 INFO L290 TraceCheckUtils]: 159: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,567 INFO L290 TraceCheckUtils]: 158: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,567 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-08 09:31:09,567 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-08 09:31:09,567 INFO L290 TraceCheckUtils]: 155: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,567 INFO L290 TraceCheckUtils]: 154: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,567 INFO L290 TraceCheckUtils]: 153: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,567 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-08 09:31:09,567 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-08 09:31:09,568 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-08 09:31:09,568 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-08 09:31:09,569 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-08 09:31:09,569 INFO L290 TraceCheckUtils]: 147: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,569 INFO L290 TraceCheckUtils]: 146: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,569 INFO L290 TraceCheckUtils]: 145: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,569 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-08 09:31:09,569 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-08 09:31:09,570 INFO L290 TraceCheckUtils]: 142: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,570 INFO L290 TraceCheckUtils]: 141: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,570 INFO L290 TraceCheckUtils]: 140: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,570 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-08 09:31:09,570 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-08 09:31:09,570 INFO L290 TraceCheckUtils]: 137: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,570 INFO L290 TraceCheckUtils]: 136: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,570 INFO L290 TraceCheckUtils]: 135: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,570 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-08 09:31:09,571 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-08 09:31:09,571 INFO L290 TraceCheckUtils]: 132: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,571 INFO L290 TraceCheckUtils]: 131: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,571 INFO L290 TraceCheckUtils]: 130: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,571 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-08 09:31:09,571 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-08 09:31:09,572 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-08 09:31:09,572 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-08 09:31:09,572 INFO L290 TraceCheckUtils]: 125: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,572 INFO L290 TraceCheckUtils]: 124: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,572 INFO L290 TraceCheckUtils]: 123: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,572 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-08 09:31:09,573 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-08 09:31:09,573 INFO L290 TraceCheckUtils]: 120: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,573 INFO L290 TraceCheckUtils]: 119: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,573 INFO L290 TraceCheckUtils]: 118: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,573 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-08 09:31:09,573 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-08 09:31:09,573 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-08 09:31:09,574 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-08 09:31:09,574 INFO L290 TraceCheckUtils]: 113: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,574 INFO L290 TraceCheckUtils]: 112: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,574 INFO L290 TraceCheckUtils]: 111: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,574 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-08 09:31:09,574 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-08 09:31:09,574 INFO L290 TraceCheckUtils]: 108: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,575 INFO L290 TraceCheckUtils]: 107: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,575 INFO L290 TraceCheckUtils]: 106: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,575 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-08 09:31:09,575 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-08 09:31:09,575 INFO L290 TraceCheckUtils]: 103: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,575 INFO L290 TraceCheckUtils]: 102: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,575 INFO L290 TraceCheckUtils]: 101: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,575 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-08 09:31:09,576 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-08 09:31:09,576 INFO L290 TraceCheckUtils]: 98: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,576 INFO L290 TraceCheckUtils]: 97: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,576 INFO L290 TraceCheckUtils]: 96: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,576 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-08 09:31:09,576 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-08 09:31:09,576 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-08 09:31:09,577 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-08 09:31:09,577 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-08 09:31:09,577 INFO L290 TraceCheckUtils]: 90: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,577 INFO L290 TraceCheckUtils]: 89: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,577 INFO L290 TraceCheckUtils]: 88: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,577 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-08 09:31:09,578 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-08 09:31:09,578 INFO L290 TraceCheckUtils]: 85: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,578 INFO L290 TraceCheckUtils]: 84: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,578 INFO L290 TraceCheckUtils]: 83: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,578 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-08 09:31:09,578 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-08 09:31:09,578 INFO L290 TraceCheckUtils]: 80: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,579 INFO L290 TraceCheckUtils]: 79: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,579 INFO L290 TraceCheckUtils]: 78: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,579 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-08 09:31:09,579 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-08 09:31:09,579 INFO L290 TraceCheckUtils]: 75: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,579 INFO L290 TraceCheckUtils]: 74: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,579 INFO L290 TraceCheckUtils]: 73: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,579 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-08 09:31:09,580 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-08 09:31:09,580 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-08 09:31:09,580 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-08 09:31:09,580 INFO L290 TraceCheckUtils]: 68: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,580 INFO L290 TraceCheckUtils]: 67: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,580 INFO L290 TraceCheckUtils]: 66: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,580 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-08 09:31:09,581 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-08 09:31:09,581 INFO L290 TraceCheckUtils]: 63: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,581 INFO L290 TraceCheckUtils]: 62: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,581 INFO L290 TraceCheckUtils]: 61: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,581 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-08 09:31:09,581 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-08 09:31:09,582 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-08 09:31:09,582 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-08 09:31:09,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,582 INFO L290 TraceCheckUtils]: 55: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,582 INFO L290 TraceCheckUtils]: 54: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,582 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-08 09:31:09,583 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-08 09:31:09,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,583 INFO L290 TraceCheckUtils]: 50: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,583 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-08 09:31:09,583 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-08 09:31:09,584 INFO L290 TraceCheckUtils]: 46: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,584 INFO L290 TraceCheckUtils]: 45: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,584 INFO L290 TraceCheckUtils]: 44: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,584 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-08 09:31:09,584 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-08 09:31:09,584 INFO L290 TraceCheckUtils]: 41: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,584 INFO L290 TraceCheckUtils]: 40: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,584 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-08 09:31:09,585 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-08 09:31:09,585 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-08 09:31:09,585 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-08 09:31:09,586 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-08 09:31:09,586 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-08 09:31:09,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,587 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-08 09:31:09,587 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-08 09:31:09,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,587 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-08 09:31:09,588 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-08 09:31:09,588 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-08 09:31:09,588 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-08 09:31:09,589 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-08 09:31:09,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,589 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-08 09:31:09,589 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-08 09:31:09,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-08 09:31:09,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-08 09:31:09,590 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-08 09:31:09,590 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-08 09:31:09,590 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-08 09:31:09,591 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-08 09:31:09,591 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-08 09:31:09,592 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-08 09:31:09,592 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-08 09:31:09,592 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-08 09:31:09,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-08 09:31:09,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-08 09:31:09,592 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-08 09:31:09,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {55194#true} call ULTIMATE.init(); {55194#true} is VALID [2022-04-08 09:31:09,592 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-08 09:31:09,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448641907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:31:09,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:31:09,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-04-08 09:31:09,593 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:31:09,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [682790917] [2022-04-08 09:31:09,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [682790917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:31:09,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:31:09,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:31:09,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829354074] [2022-04-08 09:31:09,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:31:09,594 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-08 09:31:09,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:31:09,594 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-08 09:31:09,663 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-08 09:31:09,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:31:09,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:31:09,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:31:09,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-08 09:31:09,664 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-08 09:31:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:31:11,945 INFO L93 Difference]: Finished difference Result 318 states and 407 transitions. [2022-04-08 09:31:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 09:31:11,945 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-08 09:31:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:31:11,946 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-08 09:31:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2022-04-08 09:31:11,947 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-08 09:31:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2022-04-08 09:31:11,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 173 transitions. [2022-04-08 09:31:12,087 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-08 09:31:12,087 INFO L225 Difference]: With dead ends: 318 [2022-04-08 09:31:12,087 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:31:12,088 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-08 09:31:12,089 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 86 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-08 09:31:12,089 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.5s Time] [2022-04-08 09:31:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:31:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:31:12,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:31:12,089 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-08 09:31:12,089 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-08 09:31:12,089 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-08 09:31:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:31:12,089 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:31:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:31:12,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:31:12,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:31:12,090 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-08 09:31:12,090 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-08 09:31:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:31:12,090 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:31:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:31:12,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:31:12,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:31:12,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:31:12,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:31:12,090 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-08 09:31:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:31:12,090 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2022-04-08 09:31:12,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:31:12,090 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:31:12,091 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-08 09:31:12,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:31:12,091 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-08 09:31:12,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:31:12,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:31:12,093 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:31:12,123 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-08 09:31:12,306 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-08 09:31:12,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:32:41,696 WARN L232 SmtUtils]: Spent 1.49m 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)