/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:46:56,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:46:56,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:46:56,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:46:56,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:46:56,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:46:56,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:46:56,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:46:56,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:46:56,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:46:56,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:46:56,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:46:56,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:46:56,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:46:56,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:46:56,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:46:56,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:46:56,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:46:56,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:46:56,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:46:56,404 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:46:56,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:46:56,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:46:56,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:46:56,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:46:56,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:46:56,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:46:56,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:46:56,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:46:56,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:46:56,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:46:56,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:46:56,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:46:56,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:46:56,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:46:56,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:46:56,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:46:56,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:46:56,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:46:56,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:46:56,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:46:56,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:46:56,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:46:56,444 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:46:56,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:46:56,445 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:46:56,445 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:46:56,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:46:56,445 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:46:56,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:46:56,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:46:56,446 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:46:56,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:46:56,446 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:46:56,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:46:56,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:46:56,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:46:56,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:46:56,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:46:56,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:46:56,446 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:46:56,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:46:56,447 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:46:56,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:46:56,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:46:56,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:46:56,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:46:56,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:46:56,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:46:56,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:46:56,447 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:46:56,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:46:56,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:46:56,448 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:46:56,448 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:46:56,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:46:56,448 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:46:56,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:46:56,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:46:56,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:46:56,641 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:46:56,642 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:46:56,643 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-27 10:46:56,682 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ced63858/578ee9895d544c0e90ef8a72310152fc/FLAGc1625be7c [2022-04-27 10:46:57,046 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:46:57,047 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2022-04-27 10:46:57,053 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ced63858/578ee9895d544c0e90ef8a72310152fc/FLAGc1625be7c [2022-04-27 10:46:57,061 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ced63858/578ee9895d544c0e90ef8a72310152fc [2022-04-27 10:46:57,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:46:57,064 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:46:57,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:46:57,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:46:57,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:46:57,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:46:57" (1/1) ... [2022-04-27 10:46:57,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32dd9ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:57, skipping insertion in model container [2022-04-27 10:46:57,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:46:57" (1/1) ... [2022-04-27 10:46:57,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:46:57,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:46:57,196 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-27 10:46:57,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:46:57,247 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:46:57,255 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-27 10:46:57,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:46:57,288 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:46:57,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:57 WrapperNode [2022-04-27 10:46:57,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:46:57,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:46:57,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:46:57,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:46:57,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:57" (1/1) ... [2022-04-27 10:46:57,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:57" (1/1) ... [2022-04-27 10:46:57,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:57" (1/1) ... [2022-04-27 10:46:57,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:57" (1/1) ... [2022-04-27 10:46:57,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:57" (1/1) ... [2022-04-27 10:46:57,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:57" (1/1) ... [2022-04-27 10:46:57,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:57" (1/1) ... [2022-04-27 10:46:57,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:46:57,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:46:57,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:46:57,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:46:57,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:57" (1/1) ... [2022-04-27 10:46:57,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:46:57,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:46:57,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:46:57,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:46:57,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:46:57,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:46:57,377 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:46:57,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:46:57,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:46:57,379 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:46:57,379 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:46:57,379 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:46:57,379 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:46:57,379 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:46:57,379 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:46:57,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:46:57,379 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:46:57,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:46:57,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:46:57,379 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:46:57,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:46:57,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:46:57,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:46:57,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:46:57,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:46:57,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:46:57,424 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:46:57,425 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:46:57,593 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:46:57,598 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:46:57,598 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 10:46:57,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:46:57 BoogieIcfgContainer [2022-04-27 10:46:57,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:46:57,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:46:57,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:46:57,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:46:57,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:46:57" (1/3) ... [2022-04-27 10:46:57,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414ea9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:46:57, skipping insertion in model container [2022-04-27 10:46:57,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:57" (2/3) ... [2022-04-27 10:46:57,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414ea9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:46:57, skipping insertion in model container [2022-04-27 10:46:57,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:46:57" (3/3) ... [2022-04-27 10:46:57,606 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2022-04-27 10:46:57,630 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:46:57,630 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:46:57,664 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:46:57,669 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7866028c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@229b676b [2022-04-27 10:46:57,669 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:46:57,675 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-27 10:46:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:46:57,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:57,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:57,680 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:46:57,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash -250128701, now seen corresponding path program 1 times [2022-04-27 10:46:57,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:57,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921790310] [2022-04-27 10:46:57,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:57,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:57,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:57,910 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-27 10:46:57,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2022-04-27 10:46:57,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #138#return; {47#true} is VALID [2022-04-27 10:46:57,912 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-27 10:46:57,912 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-27 10:46:57,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2022-04-27 10:46:57,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #138#return; {47#true} is VALID [2022-04-27 10:46:57,913 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-27 10:46:57,913 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-27 10:46:57,913 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-27 10:46:57,913 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-27 10:46:57,914 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-27 10:46:57,915 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-27 10:46:57,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {52#(<= 1 main_~r~0)} assume !(~l~0 > 1); {52#(<= 1 main_~r~0)} is VALID [2022-04-27 10:46:57,916 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-27 10:46:57,916 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-27 10:46:57,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {54#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {48#false} is VALID [2022-04-27 10:46:57,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {48#false} assume !false; {48#false} is VALID [2022-04-27 10:46:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:46:57,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:57,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921790310] [2022-04-27 10:46:57,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921790310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:57,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:57,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:46:57,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726761279] [2022-04-27 10:46:57,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:57,927 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-27 10:46:57,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:57,930 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-27 10:46:57,947 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-27 10:46:57,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:46:57,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:57,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:46:57,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:46:57,978 INFO L87 Difference]: Start difference. First operand has 44 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:58,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:58,535 INFO L93 Difference]: Finished difference Result 88 states and 148 transitions. [2022-04-27 10:46:58,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:46:58,535 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-27 10:46:58,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:58,536 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-27 10:46:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-27 10:46:58,543 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-27 10:46:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-27 10:46:58,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 148 transitions. [2022-04-27 10:46:58,659 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-27 10:46:58,670 INFO L225 Difference]: With dead ends: 88 [2022-04-27 10:46:58,671 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 10:46:58,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:46:58,676 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:58,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 63 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:46:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 10:46:58,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-27 10:46:58,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:58,712 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-27 10:46:58,714 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-27 10:46:58,715 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-27 10:46:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:58,719 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-04-27 10:46:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-27 10:46:58,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:58,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:58,721 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-27 10:46:58,721 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-27 10:46:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:58,724 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-04-27 10:46:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-27 10:46:58,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:58,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:58,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:58,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:58,725 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-27 10:46:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-27 10:46:58,732 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 15 [2022-04-27 10:46:58,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:58,734 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-27 10:46:58,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:58,735 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-27 10:46:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:46:58,735 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:58,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:58,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:46:58,736 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:46:58,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:58,736 INFO L85 PathProgramCache]: Analyzing trace with hash -254865470, now seen corresponding path program 1 times [2022-04-27 10:46:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:58,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280489552] [2022-04-27 10:46:58,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:58,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:58,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:58,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {352#(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); {344#true} is VALID [2022-04-27 10:46:58,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#true} assume true; {344#true} is VALID [2022-04-27 10:46:58,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {344#true} {344#true} #138#return; {344#true} is VALID [2022-04-27 10:46:58,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:58,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {352#(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); {344#true} is VALID [2022-04-27 10:46:58,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {344#true} assume true; {344#true} is VALID [2022-04-27 10:46:58,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {344#true} {344#true} #138#return; {344#true} is VALID [2022-04-27 10:46:58,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {344#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {344#true} is VALID [2022-04-27 10:46:58,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {344#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; {344#true} is VALID [2022-04-27 10:46:58,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {344#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; {344#true} is VALID [2022-04-27 10:46:58,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {344#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {344#true} is VALID [2022-04-27 10:46:58,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {344#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {344#true} is VALID [2022-04-27 10:46:58,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {344#true} assume !(~j~0 <= ~r~0); {344#true} is VALID [2022-04-27 10:46:58,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {344#true} assume ~l~0 > 1; {349#(<= 1 main_~l~0)} is VALID [2022-04-27 10:46:58,818 INFO L272 TraceCheckUtils]: 11: Hoare triple {349#(<= 1 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:46:58,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {350#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {351#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:46:58,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {351#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {345#false} is VALID [2022-04-27 10:46:58,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {345#false} assume !false; {345#false} is VALID [2022-04-27 10:46:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:46:58,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:58,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280489552] [2022-04-27 10:46:58,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280489552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:58,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:58,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:46:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643682066] [2022-04-27 10:46:58,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:58,821 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-27 10:46:58,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:58,822 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-27 10:46:58,844 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-27 10:46:58,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:46:58,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:58,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:46:58,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:46:58,846 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-27 10:46:59,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:59,447 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2022-04-27 10:46:59,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:46:59,447 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-27 10:46:59,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:59,447 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-27 10:46:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-27 10:46:59,450 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-27 10:46:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-27 10:46:59,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 102 transitions. [2022-04-27 10:46:59,547 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-27 10:46:59,549 INFO L225 Difference]: With dead ends: 71 [2022-04-27 10:46:59,549 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 10:46:59,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:46:59,550 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:59,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 56 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:46:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 10:46:59,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2022-04-27 10:46:59,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:59,572 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-27 10:46:59,572 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-27 10:46:59,572 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-27 10:46:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:59,576 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2022-04-27 10:46:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2022-04-27 10:46:59,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:59,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:59,578 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-27 10:46:59,578 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-27 10:46:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:59,581 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2022-04-27 10:46:59,581 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2022-04-27 10:46:59,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:59,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:59,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:59,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:59,583 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-27 10:46:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-27 10:46:59,585 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 15 [2022-04-27 10:46:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:59,585 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-27 10:46:59,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-27 10:46:59,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:46:59,585 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:59,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:59,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:46:59,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:46:59,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:59,586 INFO L85 PathProgramCache]: Analyzing trace with hash -216435080, now seen corresponding path program 1 times [2022-04-27 10:46:59,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:59,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632865119] [2022-04-27 10:46:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:59,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:59,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {686#(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); {677#true} is VALID [2022-04-27 10:46:59,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {677#true} assume true; {677#true} is VALID [2022-04-27 10:46:59,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {677#true} {677#true} #138#return; {677#true} is VALID [2022-04-27 10:46:59,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {677#true} call ULTIMATE.init(); {686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:59,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {686#(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); {677#true} is VALID [2022-04-27 10:46:59,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2022-04-27 10:46:59,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {677#true} {677#true} #138#return; {677#true} is VALID [2022-04-27 10:46:59,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {677#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {677#true} is VALID [2022-04-27 10:46:59,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {677#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; {677#true} is VALID [2022-04-27 10:46:59,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {677#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; {677#true} is VALID [2022-04-27 10:46:59,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {677#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {677#true} is VALID [2022-04-27 10:46:59,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {677#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {682#(<= 2 main_~r~0)} is VALID [2022-04-27 10:46:59,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#(<= 2 main_~r~0)} assume !!(~j~0 <= ~r~0); {682#(<= 2 main_~r~0)} is VALID [2022-04-27 10:46:59,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {682#(<= 2 main_~r~0)} assume !(~j~0 < ~r~0); {683#(<= 2 main_~j~0)} is VALID [2022-04-27 10:46:59,642 INFO L272 TraceCheckUtils]: 11: Hoare triple {683#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {684#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:46:59,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {684#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {685#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:46:59,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {678#false} is VALID [2022-04-27 10:46:59,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {678#false} assume !false; {678#false} is VALID [2022-04-27 10:46:59,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:46:59,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:59,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632865119] [2022-04-27 10:46:59,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632865119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:59,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:59,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:59,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968613179] [2022-04-27 10:46:59,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:59,644 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-27 10:46:59,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:59,645 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-27 10:46:59,653 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-27 10:46:59,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:59,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:59,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:59,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:59,654 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-27 10:47:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:00,438 INFO L93 Difference]: Finished difference Result 80 states and 115 transitions. [2022-04-27 10:47:00,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:47:00,438 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-27 10:47:00,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:00,439 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-27 10:47:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-27 10:47:00,445 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-27 10:47:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-27 10:47:00,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2022-04-27 10:47:00,548 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-27 10:47:00,551 INFO L225 Difference]: With dead ends: 80 [2022-04-27 10:47:00,551 INFO L226 Difference]: Without dead ends: 78 [2022-04-27 10:47:00,551 INFO L412 NwaCegarLoop]: 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-27 10:47:00,552 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 68 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:00,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 64 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:47:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-27 10:47:00,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2022-04-27 10:47:00,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:00,594 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-27 10:47:00,595 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-27 10:47:00,595 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-27 10:47:00,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:00,598 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2022-04-27 10:47:00,598 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2022-04-27 10:47:00,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:00,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:00,599 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-27 10:47:00,600 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-27 10:47:00,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:00,602 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2022-04-27 10:47:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2022-04-27 10:47:00,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:00,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:00,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:00,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:00,604 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-27 10:47:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2022-04-27 10:47:00,606 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 15 [2022-04-27 10:47:00,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:00,606 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2022-04-27 10:47:00,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:47:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2022-04-27 10:47:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:47:00,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:00,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:00,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:47:00,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:00,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:00,608 INFO L85 PathProgramCache]: Analyzing trace with hash -228679181, now seen corresponding path program 1 times [2022-04-27 10:47:00,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:00,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536512169] [2022-04-27 10:47:00,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:00,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:00,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:00,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {1086#(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); {1077#true} is VALID [2022-04-27 10:47:00,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {1077#true} assume true; {1077#true} is VALID [2022-04-27 10:47:00,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1077#true} {1077#true} #138#return; {1077#true} is VALID [2022-04-27 10:47:00,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {1077#true} call ULTIMATE.init(); {1086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:00,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {1086#(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); {1077#true} is VALID [2022-04-27 10:47:00,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {1077#true} assume true; {1077#true} is VALID [2022-04-27 10:47:00,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1077#true} {1077#true} #138#return; {1077#true} is VALID [2022-04-27 10:47:00,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {1077#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {1077#true} is VALID [2022-04-27 10:47:00,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {1077#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; {1077#true} is VALID [2022-04-27 10:47:00,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {1077#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; {1077#true} is VALID [2022-04-27 10:47:00,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {1077#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {1082#(<= 1 main_~l~0)} is VALID [2022-04-27 10:47:00,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {1082#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {1083#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:00,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {1083#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {1083#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:00,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {1083#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {1083#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:00,660 INFO L272 TraceCheckUtils]: 11: Hoare triple {1083#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {1084#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:00,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {1084#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1085#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:00,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {1085#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1078#false} is VALID [2022-04-27 10:47:00,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {1078#false} assume !false; {1078#false} is VALID [2022-04-27 10:47:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:47:00,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:00,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536512169] [2022-04-27 10:47:00,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536512169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:00,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:00,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:47:00,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448945861] [2022-04-27 10:47:00,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:00,662 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-27 10:47:00,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:00,662 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-27 10:47:00,670 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-27 10:47:00,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:47:00,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:00,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:47:00,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:47:00,671 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-27 10:47:01,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:01,521 INFO L93 Difference]: Finished difference Result 122 states and 183 transitions. [2022-04-27 10:47:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:47:01,521 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-27 10:47:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:01,522 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-27 10:47:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-27 10:47:01,523 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-27 10:47:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-27 10:47:01,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2022-04-27 10:47:01,611 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-27 10:47:01,613 INFO L225 Difference]: With dead ends: 122 [2022-04-27 10:47:01,613 INFO L226 Difference]: Without dead ends: 120 [2022-04-27 10:47:01,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:47:01,614 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 65 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:01,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 55 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:47:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-27 10:47:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2022-04-27 10:47:01,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:01,713 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-27 10:47:01,714 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-27 10:47:01,714 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-27 10:47:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:01,720 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2022-04-27 10:47:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2022-04-27 10:47:01,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:01,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:01,721 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-27 10:47:01,721 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-27 10:47:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:01,726 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2022-04-27 10:47:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2022-04-27 10:47:01,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:01,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:01,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:01,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:01,728 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-27 10:47:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2022-04-27 10:47:01,731 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 15 [2022-04-27 10:47:01,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:01,732 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2022-04-27 10:47:01,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:47:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2022-04-27 10:47:01,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:47:01,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:01,732 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:01,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:47:01,733 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:01,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:01,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1266022048, now seen corresponding path program 1 times [2022-04-27 10:47:01,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:01,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230392096] [2022-04-27 10:47:01,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:01,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:01,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:01,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {1680#(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); {1668#true} is VALID [2022-04-27 10:47:01,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {1668#true} assume true; {1668#true} is VALID [2022-04-27 10:47:01,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1668#true} {1668#true} #138#return; {1668#true} is VALID [2022-04-27 10:47:01,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:01,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {1668#true} ~cond := #in~cond; {1668#true} is VALID [2022-04-27 10:47:01,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {1668#true} assume !(0 == ~cond); {1668#true} is VALID [2022-04-27 10:47:01,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {1668#true} assume true; {1668#true} is VALID [2022-04-27 10:47:01,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1668#true} {1673#(<= main_~r~0 main_~n~0)} #134#return; {1673#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:01,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {1668#true} call ULTIMATE.init(); {1680#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:01,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {1680#(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); {1668#true} is VALID [2022-04-27 10:47:01,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {1668#true} assume true; {1668#true} is VALID [2022-04-27 10:47:01,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1668#true} {1668#true} #138#return; {1668#true} is VALID [2022-04-27 10:47:01,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {1668#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {1668#true} is VALID [2022-04-27 10:47:01,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {1668#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; {1668#true} is VALID [2022-04-27 10:47:01,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {1668#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; {1673#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:01,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {1673#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {1673#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:01,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {1673#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {1673#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:01,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {1673#(<= main_~r~0 main_~n~0)} assume !(~j~0 <= ~r~0); {1673#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:01,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {1673#(<= main_~r~0 main_~n~0)} assume !(~l~0 > 1); {1673#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:01,804 INFO L272 TraceCheckUtils]: 11: Hoare triple {1673#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~r~0 then 1 else 0)); {1668#true} is VALID [2022-04-27 10:47:01,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {1668#true} ~cond := #in~cond; {1668#true} is VALID [2022-04-27 10:47:01,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {1668#true} assume !(0 == ~cond); {1668#true} is VALID [2022-04-27 10:47:01,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {1668#true} assume true; {1668#true} is VALID [2022-04-27 10:47:01,806 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1668#true} {1673#(<= main_~r~0 main_~n~0)} #134#return; {1673#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:01,806 INFO L272 TraceCheckUtils]: 16: Hoare triple {1673#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if ~r~0 <= ~n~0 then 1 else 0)); {1678#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:01,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {1678#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1679#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:01,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {1679#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1669#false} is VALID [2022-04-27 10:47:01,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {1669#false} assume !false; {1669#false} is VALID [2022-04-27 10:47:01,807 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-27 10:47:01,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:01,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230392096] [2022-04-27 10:47:01,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230392096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:01,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:01,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:47:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039571189] [2022-04-27 10:47:01,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:01,808 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-27 10:47:01,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:01,809 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-27 10:47:01,819 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-27 10:47:01,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:47:01,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:01,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:47:01,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:47:01,820 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-27 10:47:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:02,266 INFO L93 Difference]: Finished difference Result 100 states and 145 transitions. [2022-04-27 10:47:02,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:47:02,266 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-27 10:47:02,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:02,267 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-27 10:47:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-27 10:47:02,268 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-27 10:47:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-27 10:47:02,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-27 10:47:02,328 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-27 10:47:02,330 INFO L225 Difference]: With dead ends: 100 [2022-04-27 10:47:02,330 INFO L226 Difference]: Without dead ends: 98 [2022-04-27 10:47:02,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:47:02,331 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 39 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:02,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 55 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:47:02,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-27 10:47:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-04-27 10:47:02,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:02,422 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-27 10:47:02,422 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-27 10:47:02,422 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-27 10:47:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:02,426 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-27 10:47:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-27 10:47:02,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:02,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:02,427 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-27 10:47:02,427 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-27 10:47:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:02,430 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-27 10:47:02,430 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-27 10:47:02,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:02,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:02,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:02,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:02,432 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-27 10:47:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2022-04-27 10:47:02,437 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 20 [2022-04-27 10:47:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:02,437 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2022-04-27 10:47:02,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:47:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-27 10:47:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:47:02,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:02,441 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:02,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:47:02,441 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:02,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash 884659585, now seen corresponding path program 1 times [2022-04-27 10:47:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:02,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606364248] [2022-04-27 10:47:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:02,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:02,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {2197#(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); {2183#true} is VALID [2022-04-27 10:47:02,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {2183#true} assume true; {2183#true} is VALID [2022-04-27 10:47:02,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2183#true} {2183#true} #138#return; {2183#true} is VALID [2022-04-27 10:47:02,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:02,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {2183#true} ~cond := #in~cond; {2183#true} is VALID [2022-04-27 10:47:02,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {2183#true} assume !(0 == ~cond); {2183#true} is VALID [2022-04-27 10:47:02,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {2183#true} assume true; {2183#true} is VALID [2022-04-27 10:47:02,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2183#true} {2190#(<= (+ main_~l~0 1) main_~n~0)} #130#return; {2190#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-27 10:47:02,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {2183#true} call ULTIMATE.init(); {2197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:02,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#(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); {2183#true} is VALID [2022-04-27 10:47:02,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {2183#true} assume true; {2183#true} is VALID [2022-04-27 10:47:02,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2183#true} {2183#true} #138#return; {2183#true} is VALID [2022-04-27 10:47:02,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {2183#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {2183#true} is VALID [2022-04-27 10:47:02,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {2183#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; {2183#true} is VALID [2022-04-27 10:47:02,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {2183#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; {2188#(<= (+ (* main_~l~0 2) main_~r~0) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-27 10:47:02,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {2188#(<= (+ (* 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; {2189#(<= (+ (* main_~l~0 2) main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:47:02,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {2189#(<= (+ (* main_~l~0 2) main_~r~0) (* main_~n~0 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {2190#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-27 10:47:02,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {2190#(<= (+ main_~l~0 1) main_~n~0)} assume !(~j~0 <= ~r~0); {2190#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-27 10:47:02,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {2190#(<= (+ main_~l~0 1) main_~n~0)} assume ~l~0 > 1; {2190#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-27 10:47:02,521 INFO L272 TraceCheckUtils]: 11: Hoare triple {2190#(<= (+ main_~l~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {2183#true} is VALID [2022-04-27 10:47:02,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {2183#true} ~cond := #in~cond; {2183#true} is VALID [2022-04-27 10:47:02,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {2183#true} assume !(0 == ~cond); {2183#true} is VALID [2022-04-27 10:47:02,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {2183#true} assume true; {2183#true} is VALID [2022-04-27 10:47:02,522 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2183#true} {2190#(<= (+ main_~l~0 1) main_~n~0)} #130#return; {2190#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-27 10:47:02,523 INFO L272 TraceCheckUtils]: 16: Hoare triple {2190#(<= (+ main_~l~0 1) main_~n~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {2195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:02,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {2195#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2196#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:02,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {2196#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2184#false} is VALID [2022-04-27 10:47:02,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {2184#false} assume !false; {2184#false} is VALID [2022-04-27 10:47:02,524 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-27 10:47:02,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:02,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606364248] [2022-04-27 10:47:02,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606364248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:02,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:02,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:47:02,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791846339] [2022-04-27 10:47:02,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:02,525 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-27 10:47:02,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:02,525 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-27 10:47:02,535 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-27 10:47:02,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:47:02,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:02,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:47:02,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:47:02,536 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-27 10:47:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:03,549 INFO L93 Difference]: Finished difference Result 131 states and 194 transitions. [2022-04-27 10:47:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:47:03,549 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-27 10:47:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:03,549 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-27 10:47:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-27 10:47:03,551 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-27 10:47:03,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-27 10:47:03,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-27 10:47:03,653 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-27 10:47:03,659 INFO L225 Difference]: With dead ends: 131 [2022-04-27 10:47:03,660 INFO L226 Difference]: Without dead ends: 129 [2022-04-27 10:47:03,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:47:03,660 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 74 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:03,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 67 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:47:03,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-27 10:47:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2022-04-27 10:47:03,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:03,848 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-27 10:47:03,849 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-27 10:47:03,849 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-27 10:47:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:03,854 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2022-04-27 10:47:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2022-04-27 10:47:03,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:03,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:03,855 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-27 10:47:03,856 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-27 10:47:03,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:03,863 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2022-04-27 10:47:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2022-04-27 10:47:03,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:03,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:03,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:03,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:03,864 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-27 10:47:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 189 transitions. [2022-04-27 10:47:03,870 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 189 transitions. Word has length 20 [2022-04-27 10:47:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:03,870 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 189 transitions. [2022-04-27 10:47:03,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:47:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 189 transitions. [2022-04-27 10:47:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:47:03,870 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:03,871 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:03,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 10:47:03,871 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:03,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:03,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1424204299, now seen corresponding path program 1 times [2022-04-27 10:47:03,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:03,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273306643] [2022-04-27 10:47:03,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:03,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:03,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:03,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {2870#(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); {2857#true} is VALID [2022-04-27 10:47:03,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {2857#true} assume true; {2857#true} is VALID [2022-04-27 10:47:03,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2857#true} {2857#true} #138#return; {2857#true} is VALID [2022-04-27 10:47:03,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:03,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {2857#true} ~cond := #in~cond; {2857#true} is VALID [2022-04-27 10:47:03,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {2857#true} assume !(0 == ~cond); {2857#true} is VALID [2022-04-27 10:47:03,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {2857#true} assume true; {2857#true} is VALID [2022-04-27 10:47:03,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2857#true} {2863#(<= main_~j~0 main_~n~0)} #118#return; {2863#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:47:03,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {2857#true} call ULTIMATE.init(); {2870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:03,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {2870#(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); {2857#true} is VALID [2022-04-27 10:47:03,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {2857#true} assume true; {2857#true} is VALID [2022-04-27 10:47:03,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2857#true} {2857#true} #138#return; {2857#true} is VALID [2022-04-27 10:47:03,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {2857#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {2857#true} is VALID [2022-04-27 10:47:03,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {2857#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; {2857#true} is VALID [2022-04-27 10:47:03,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {2857#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; {2862#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:03,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {2862#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {2862#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:03,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {2862#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {2862#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:03,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {2862#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {2863#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:47:03,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {2863#(<= main_~j~0 main_~n~0)} assume !(~j~0 < ~r~0); {2863#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:47:03,927 INFO L272 TraceCheckUtils]: 11: Hoare triple {2863#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {2857#true} is VALID [2022-04-27 10:47:03,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {2857#true} ~cond := #in~cond; {2857#true} is VALID [2022-04-27 10:47:03,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {2857#true} assume !(0 == ~cond); {2857#true} is VALID [2022-04-27 10:47:03,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {2857#true} assume true; {2857#true} is VALID [2022-04-27 10:47:03,928 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2857#true} {2863#(<= main_~j~0 main_~n~0)} #118#return; {2863#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:47:03,928 INFO L272 TraceCheckUtils]: 16: Hoare triple {2863#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {2868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:03,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {2868#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2869#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:03,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {2869#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2858#false} is VALID [2022-04-27 10:47:03,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {2858#false} assume !false; {2858#false} is VALID [2022-04-27 10:47:03,929 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-27 10:47:03,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:03,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273306643] [2022-04-27 10:47:03,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273306643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:03,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:03,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:47:03,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979395863] [2022-04-27 10:47:03,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:03,930 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-27 10:47:03,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:03,930 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-27 10:47:03,940 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-27 10:47:03,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:47:03,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:03,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:47:03,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:47:03,941 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-27 10:47:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:05,012 INFO L93 Difference]: Finished difference Result 188 states and 291 transitions. [2022-04-27 10:47:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:47:05,012 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-27 10:47:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:05,013 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-27 10:47:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-27 10:47:05,014 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-27 10:47:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-27 10:47:05,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-27 10:47:05,093 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-27 10:47:05,096 INFO L225 Difference]: With dead ends: 188 [2022-04-27 10:47:05,096 INFO L226 Difference]: Without dead ends: 186 [2022-04-27 10:47:05,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:47:05,097 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:05,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:47:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-27 10:47:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2022-04-27 10:47:05,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:05,342 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-27 10:47:05,343 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-27 10:47:05,343 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-27 10:47:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:05,350 INFO L93 Difference]: Finished difference Result 186 states and 289 transitions. [2022-04-27 10:47:05,350 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2022-04-27 10:47:05,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:05,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:05,352 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-27 10:47:05,352 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-27 10:47:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:05,359 INFO L93 Difference]: Finished difference Result 186 states and 289 transitions. [2022-04-27 10:47:05,359 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2022-04-27 10:47:05,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:05,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:05,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:05,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:05,360 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-27 10:47:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 252 transitions. [2022-04-27 10:47:05,366 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 252 transitions. Word has length 20 [2022-04-27 10:47:05,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:05,366 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 252 transitions. [2022-04-27 10:47:05,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:47:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 252 transitions. [2022-04-27 10:47:05,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:47:05,367 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:05,367 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:05,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 10:47:05,367 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:05,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:05,367 INFO L85 PathProgramCache]: Analyzing trace with hash 297853571, now seen corresponding path program 1 times [2022-04-27 10:47:05,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:05,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337728543] [2022-04-27 10:47:05,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:05,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:05,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:05,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {3805#(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); {3795#true} is VALID [2022-04-27 10:47:05,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-27 10:47:05,405 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3795#true} {3795#true} #138#return; {3795#true} is VALID [2022-04-27 10:47:05,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:05,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {3795#true} ~cond := #in~cond; {3795#true} is VALID [2022-04-27 10:47:05,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(0 == ~cond); {3795#true} is VALID [2022-04-27 10:47:05,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-27 10:47:05,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3795#true} {3796#false} #130#return; {3796#false} is VALID [2022-04-27 10:47:05,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {3795#true} call ULTIMATE.init(); {3805#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:05,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {3805#(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); {3795#true} is VALID [2022-04-27 10:47:05,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-27 10:47:05,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3795#true} {3795#true} #138#return; {3795#true} is VALID [2022-04-27 10:47:05,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {3795#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {3795#true} is VALID [2022-04-27 10:47:05,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {3795#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; {3795#true} is VALID [2022-04-27 10:47:05,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {3795#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; {3795#true} is VALID [2022-04-27 10:47:05,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {3795#true} assume !(~l~0 > 1);#t~post3 := ~r~0;~r~0 := #t~post3 - 1;havoc #t~post3; {3800#(<= main_~l~0 1)} is VALID [2022-04-27 10:47:05,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {3800#(<= main_~l~0 1)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {3800#(<= main_~l~0 1)} is VALID [2022-04-27 10:47:05,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {3800#(<= main_~l~0 1)} assume !(~j~0 <= ~r~0); {3800#(<= main_~l~0 1)} is VALID [2022-04-27 10:47:05,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {3800#(<= main_~l~0 1)} assume ~l~0 > 1; {3796#false} is VALID [2022-04-27 10:47:05,414 INFO L272 TraceCheckUtils]: 11: Hoare triple {3796#false} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {3795#true} is VALID [2022-04-27 10:47:05,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {3795#true} ~cond := #in~cond; {3795#true} is VALID [2022-04-27 10:47:05,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {3795#true} assume !(0 == ~cond); {3795#true} is VALID [2022-04-27 10:47:05,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-27 10:47:05,415 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3795#true} {3796#false} #130#return; {3796#false} is VALID [2022-04-27 10:47:05,415 INFO L272 TraceCheckUtils]: 16: Hoare triple {3796#false} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {3796#false} is VALID [2022-04-27 10:47:05,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {3796#false} ~cond := #in~cond; {3796#false} is VALID [2022-04-27 10:47:05,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {3796#false} assume 0 == ~cond; {3796#false} is VALID [2022-04-27 10:47:05,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {3796#false} assume !false; {3796#false} is VALID [2022-04-27 10:47:05,415 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-27 10:47:05,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:05,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337728543] [2022-04-27 10:47:05,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337728543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:05,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:05,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:47:05,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683340272] [2022-04-27 10:47:05,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:05,416 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-27 10:47:05,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:05,416 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-27 10:47:05,428 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-27 10:47:05,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:47:05,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:05,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:47:05,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:47:05,429 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-27 10:47:06,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:06,087 INFO L93 Difference]: Finished difference Result 329 states and 524 transitions. [2022-04-27 10:47:06,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:47:06,087 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-27 10:47:06,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:06,089 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-27 10:47:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-27 10:47:06,091 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-27 10:47:06,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-27 10:47:06,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-27 10:47:06,190 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-27 10:47:06,195 INFO L225 Difference]: With dead ends: 329 [2022-04-27 10:47:06,195 INFO L226 Difference]: Without dead ends: 239 [2022-04-27 10:47:06,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:47:06,197 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:06,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 64 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:47:06,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-27 10:47:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 209. [2022-04-27 10:47:06,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:06,569 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-27 10:47:06,570 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-27 10:47:06,570 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-27 10:47:06,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:06,580 INFO L93 Difference]: Finished difference Result 239 states and 389 transitions. [2022-04-27 10:47:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2022-04-27 10:47:06,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:06,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:06,582 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-27 10:47:06,582 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-27 10:47:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:06,592 INFO L93 Difference]: Finished difference Result 239 states and 389 transitions. [2022-04-27 10:47:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2022-04-27 10:47:06,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:06,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:06,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:06,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:06,594 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-27 10:47:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 336 transitions. [2022-04-27 10:47:06,617 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 336 transitions. Word has length 20 [2022-04-27 10:47:06,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:06,618 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 336 transitions. [2022-04-27 10:47:06,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:47:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 336 transitions. [2022-04-27 10:47:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 10:47:06,618 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:06,618 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:06,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 10:47:06,618 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:06,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash 288094237, now seen corresponding path program 1 times [2022-04-27 10:47:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:06,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798323999] [2022-04-27 10:47:06,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:06,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:06,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:06,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {5149#(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); {5132#true} is VALID [2022-04-27 10:47:06,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {5132#true} assume true; {5132#true} is VALID [2022-04-27 10:47:06,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5132#true} {5132#true} #138#return; {5132#true} is VALID [2022-04-27 10:47:06,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:06,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {5132#true} ~cond := #in~cond; {5132#true} is VALID [2022-04-27 10:47:06,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {5132#true} assume !(0 == ~cond); {5132#true} is VALID [2022-04-27 10:47:06,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {5132#true} assume true; {5132#true} is VALID [2022-04-27 10:47:06,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5132#true} {5138#(<= 1 main_~i~0)} #118#return; {5138#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:06,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:47:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:06,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {5132#true} ~cond := #in~cond; {5132#true} is VALID [2022-04-27 10:47:06,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {5132#true} assume !(0 == ~cond); {5132#true} is VALID [2022-04-27 10:47:06,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {5132#true} assume true; {5132#true} is VALID [2022-04-27 10:47:06,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5132#true} {5138#(<= 1 main_~i~0)} #120#return; {5138#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:06,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {5132#true} call ULTIMATE.init(); {5149#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:06,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {5149#(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); {5132#true} is VALID [2022-04-27 10:47:06,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {5132#true} assume true; {5132#true} is VALID [2022-04-27 10:47:06,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5132#true} {5132#true} #138#return; {5132#true} is VALID [2022-04-27 10:47:06,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {5132#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {5132#true} is VALID [2022-04-27 10:47:06,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {5132#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; {5132#true} is VALID [2022-04-27 10:47:06,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {5132#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; {5132#true} is VALID [2022-04-27 10:47:06,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {5132#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {5137#(<= 1 main_~l~0)} is VALID [2022-04-27 10:47:06,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {5137#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {5138#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:06,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {5138#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:06,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {5138#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {5138#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:06,685 INFO L272 TraceCheckUtils]: 11: Hoare triple {5138#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {5132#true} is VALID [2022-04-27 10:47:06,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {5132#true} ~cond := #in~cond; {5132#true} is VALID [2022-04-27 10:47:06,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {5132#true} assume !(0 == ~cond); {5132#true} is VALID [2022-04-27 10:47:06,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {5132#true} assume true; {5132#true} is VALID [2022-04-27 10:47:06,686 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5132#true} {5138#(<= 1 main_~i~0)} #118#return; {5138#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:06,686 INFO L272 TraceCheckUtils]: 16: Hoare triple {5138#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {5132#true} is VALID [2022-04-27 10:47:06,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {5132#true} ~cond := #in~cond; {5132#true} is VALID [2022-04-27 10:47:06,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {5132#true} assume !(0 == ~cond); {5132#true} is VALID [2022-04-27 10:47:06,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {5132#true} assume true; {5132#true} is VALID [2022-04-27 10:47:06,686 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5132#true} {5138#(<= 1 main_~i~0)} #120#return; {5138#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:06,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5138#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:06,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {5138#(<= 1 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {5138#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:06,687 INFO L272 TraceCheckUtils]: 23: Hoare triple {5138#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {5147#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:06,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {5147#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5148#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:06,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {5148#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5133#false} is VALID [2022-04-27 10:47:06,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {5133#false} assume !false; {5133#false} is VALID [2022-04-27 10:47:06,688 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-27 10:47:06,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:06,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798323999] [2022-04-27 10:47:06,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798323999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:06,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:06,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:47:06,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246262] [2022-04-27 10:47:06,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:06,689 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-27 10:47:06,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:06,689 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-27 10:47:06,701 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-27 10:47:06,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:47:06,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:06,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:47:06,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:47:06,701 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-27 10:47:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:07,981 INFO L93 Difference]: Finished difference Result 275 states and 448 transitions. [2022-04-27 10:47:07,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:47:07,982 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-27 10:47:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:07,982 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-27 10:47:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-27 10:47:07,984 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-27 10:47:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-27 10:47:07,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2022-04-27 10:47:08,108 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-27 10:47:08,114 INFO L225 Difference]: With dead ends: 275 [2022-04-27 10:47:08,114 INFO L226 Difference]: Without dead ends: 273 [2022-04-27 10:47:08,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:47:08,115 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 81 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:08,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 61 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:47:08,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-27 10:47:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 249. [2022-04-27 10:47:08,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:08,594 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-27 10:47:08,594 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-27 10:47:08,594 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-27 10:47:08,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:08,604 INFO L93 Difference]: Finished difference Result 273 states and 446 transitions. [2022-04-27 10:47:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 446 transitions. [2022-04-27 10:47:08,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:08,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:08,606 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-27 10:47:08,606 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-27 10:47:08,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:08,615 INFO L93 Difference]: Finished difference Result 273 states and 446 transitions. [2022-04-27 10:47:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 446 transitions. [2022-04-27 10:47:08,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:08,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:08,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:08,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:08,617 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-27 10:47:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 405 transitions. [2022-04-27 10:47:08,625 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 405 transitions. Word has length 27 [2022-04-27 10:47:08,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:08,626 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 405 transitions. [2022-04-27 10:47:08,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:47:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 405 transitions. [2022-04-27 10:47:08,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 10:47:08,626 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:08,626 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:08,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 10:47:08,626 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:08,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:08,627 INFO L85 PathProgramCache]: Analyzing trace with hash -870562259, now seen corresponding path program 1 times [2022-04-27 10:47:08,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:08,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514462333] [2022-04-27 10:47:08,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:08,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:08,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:08,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {6553#(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); {6537#true} is VALID [2022-04-27 10:47:08,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {6537#true} assume true; {6537#true} is VALID [2022-04-27 10:47:08,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6537#true} {6537#true} #138#return; {6537#true} is VALID [2022-04-27 10:47:08,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:08,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {6537#true} ~cond := #in~cond; {6537#true} is VALID [2022-04-27 10:47:08,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {6537#true} assume !(0 == ~cond); {6537#true} is VALID [2022-04-27 10:47:08,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {6537#true} assume true; {6537#true} is VALID [2022-04-27 10:47:08,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6537#true} {6538#false} #130#return; {6538#false} is VALID [2022-04-27 10:47:08,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:47:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:08,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {6537#true} ~cond := #in~cond; {6537#true} is VALID [2022-04-27 10:47:08,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {6537#true} assume !(0 == ~cond); {6537#true} is VALID [2022-04-27 10:47:08,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {6537#true} assume true; {6537#true} is VALID [2022-04-27 10:47:08,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6537#true} {6538#false} #132#return; {6538#false} is VALID [2022-04-27 10:47:08,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {6537#true} call ULTIMATE.init(); {6553#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:08,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {6553#(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); {6537#true} is VALID [2022-04-27 10:47:08,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {6537#true} assume true; {6537#true} is VALID [2022-04-27 10:47:08,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6537#true} {6537#true} #138#return; {6537#true} is VALID [2022-04-27 10:47:08,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {6537#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {6537#true} is VALID [2022-04-27 10:47:08,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {6537#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; {6537#true} is VALID [2022-04-27 10:47:08,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {6537#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; {6542#(<= (* main_~l~0 2) (+ main_~r~0 2))} is VALID [2022-04-27 10:47:08,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {6542#(<= (* main_~l~0 2) (+ main_~r~0 2))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {6543#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-27 10:47:08,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {6543#(<= (* main_~l~0 2) main_~r~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {6544#(<= main_~j~0 main_~r~0)} is VALID [2022-04-27 10:47:08,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {6544#(<= main_~j~0 main_~r~0)} assume !(~j~0 <= ~r~0); {6538#false} is VALID [2022-04-27 10:47:08,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {6538#false} assume ~l~0 > 1; {6538#false} is VALID [2022-04-27 10:47:08,672 INFO L272 TraceCheckUtils]: 11: Hoare triple {6538#false} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {6537#true} is VALID [2022-04-27 10:47:08,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {6537#true} ~cond := #in~cond; {6537#true} is VALID [2022-04-27 10:47:08,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {6537#true} assume !(0 == ~cond); {6537#true} is VALID [2022-04-27 10:47:08,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {6537#true} assume true; {6537#true} is VALID [2022-04-27 10:47:08,673 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6537#true} {6538#false} #130#return; {6538#false} is VALID [2022-04-27 10:47:08,673 INFO L272 TraceCheckUtils]: 16: Hoare triple {6538#false} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {6537#true} is VALID [2022-04-27 10:47:08,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {6537#true} ~cond := #in~cond; {6537#true} is VALID [2022-04-27 10:47:08,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {6537#true} assume !(0 == ~cond); {6537#true} is VALID [2022-04-27 10:47:08,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {6537#true} assume true; {6537#true} is VALID [2022-04-27 10:47:08,673 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6537#true} {6538#false} #132#return; {6538#false} is VALID [2022-04-27 10:47:08,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {6538#false} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {6538#false} is VALID [2022-04-27 10:47:08,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {6538#false} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {6538#false} is VALID [2022-04-27 10:47:08,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {6538#false} assume !!(~j~0 <= ~r~0); {6538#false} is VALID [2022-04-27 10:47:08,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {6538#false} assume ~j~0 < ~r~0; {6538#false} is VALID [2022-04-27 10:47:08,673 INFO L272 TraceCheckUtils]: 25: Hoare triple {6538#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {6538#false} is VALID [2022-04-27 10:47:08,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {6538#false} ~cond := #in~cond; {6538#false} is VALID [2022-04-27 10:47:08,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {6538#false} assume 0 == ~cond; {6538#false} is VALID [2022-04-27 10:47:08,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {6538#false} assume !false; {6538#false} is VALID [2022-04-27 10:47:08,674 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-27 10:47:08,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:08,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514462333] [2022-04-27 10:47:08,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514462333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:08,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:08,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:47:08,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603489151] [2022-04-27 10:47:08,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:08,675 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-27 10:47:08,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:08,675 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-27 10:47:08,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:08,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:47:08,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:08,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:47:08,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:47:08,693 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-27 10:47:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:10,428 INFO L93 Difference]: Finished difference Result 593 states and 971 transitions. [2022-04-27 10:47:10,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:47:10,428 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-27 10:47:10,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:10,428 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-27 10:47:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-04-27 10:47:10,432 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-27 10:47:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-04-27 10:47:10,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 258 transitions. [2022-04-27 10:47:10,627 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-27 10:47:10,641 INFO L225 Difference]: With dead ends: 593 [2022-04-27 10:47:10,641 INFO L226 Difference]: Without dead ends: 396 [2022-04-27 10:47:10,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-27 10:47:10,643 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 105 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:10,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 53 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:47:10,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-27 10:47:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 250. [2022-04-27 10:47:11,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:11,151 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-27 10:47:11,152 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-27 10:47:11,152 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-27 10:47:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:11,168 INFO L93 Difference]: Finished difference Result 396 states and 653 transitions. [2022-04-27 10:47:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 653 transitions. [2022-04-27 10:47:11,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:11,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:11,170 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-27 10:47:11,170 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-27 10:47:11,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:11,186 INFO L93 Difference]: Finished difference Result 396 states and 653 transitions. [2022-04-27 10:47:11,186 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 653 transitions. [2022-04-27 10:47:11,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:11,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:11,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:11,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:11,188 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-27 10:47:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 405 transitions. [2022-04-27 10:47:11,196 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 405 transitions. Word has length 29 [2022-04-27 10:47:11,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:11,196 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 405 transitions. [2022-04-27 10:47:11,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:47:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 405 transitions. [2022-04-27 10:47:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 10:47:11,197 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:11,197 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:11,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 10:47:11,197 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:11,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1319777776, now seen corresponding path program 1 times [2022-04-27 10:47:11,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:11,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808219236] [2022-04-27 10:47:11,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:11,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:11,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:11,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {8705#(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); {8684#true} is VALID [2022-04-27 10:47:11,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {8684#true} assume true; {8684#true} is VALID [2022-04-27 10:47:11,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8684#true} {8684#true} #138#return; {8684#true} is VALID [2022-04-27 10:47:11,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:11,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {8684#true} ~cond := #in~cond; {8684#true} is VALID [2022-04-27 10:47:11,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {8684#true} assume !(0 == ~cond); {8684#true} is VALID [2022-04-27 10:47:11,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {8684#true} assume true; {8684#true} is VALID [2022-04-27 10:47:11,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8684#true} {8690#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {8690#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:11,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:47:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:11,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {8684#true} ~cond := #in~cond; {8684#true} is VALID [2022-04-27 10:47:11,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {8684#true} assume !(0 == ~cond); {8684#true} is VALID [2022-04-27 10:47:11,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {8684#true} assume true; {8684#true} is VALID [2022-04-27 10:47:11,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8684#true} {8690#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {8690#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:11,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-27 10:47:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:11,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {8684#true} ~cond := #in~cond; {8684#true} is VALID [2022-04-27 10:47:11,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {8684#true} assume !(0 == ~cond); {8684#true} is VALID [2022-04-27 10:47:11,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {8684#true} assume true; {8684#true} is VALID [2022-04-27 10:47:11,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8684#true} {8690#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {8690#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:11,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {8684#true} call ULTIMATE.init(); {8705#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:11,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {8705#(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); {8684#true} is VALID [2022-04-27 10:47:11,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {8684#true} assume true; {8684#true} is VALID [2022-04-27 10:47:11,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8684#true} {8684#true} #138#return; {8684#true} is VALID [2022-04-27 10:47:11,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {8684#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {8684#true} is VALID [2022-04-27 10:47:11,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {8684#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; {8684#true} is VALID [2022-04-27 10:47:11,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {8684#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; {8689#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:11,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {8689#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {8689#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:11,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {8689#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {8689#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:11,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {8689#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {8689#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:11,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {8689#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {8690#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:11,257 INFO L272 TraceCheckUtils]: 11: Hoare triple {8690#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {8684#true} is VALID [2022-04-27 10:47:11,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {8684#true} ~cond := #in~cond; {8684#true} is VALID [2022-04-27 10:47:11,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {8684#true} assume !(0 == ~cond); {8684#true} is VALID [2022-04-27 10:47:11,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {8684#true} assume true; {8684#true} is VALID [2022-04-27 10:47:11,258 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8684#true} {8690#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {8690#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:11,258 INFO L272 TraceCheckUtils]: 16: Hoare triple {8690#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {8684#true} is VALID [2022-04-27 10:47:11,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {8684#true} ~cond := #in~cond; {8684#true} is VALID [2022-04-27 10:47:11,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {8684#true} assume !(0 == ~cond); {8684#true} is VALID [2022-04-27 10:47:11,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {8684#true} assume true; {8684#true} is VALID [2022-04-27 10:47:11,258 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8684#true} {8690#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {8690#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:11,258 INFO L272 TraceCheckUtils]: 21: Hoare triple {8690#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {8684#true} is VALID [2022-04-27 10:47:11,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {8684#true} ~cond := #in~cond; {8684#true} is VALID [2022-04-27 10:47:11,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {8684#true} assume !(0 == ~cond); {8684#true} is VALID [2022-04-27 10:47:11,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {8684#true} assume true; {8684#true} is VALID [2022-04-27 10:47:11,259 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8684#true} {8690#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {8690#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:11,259 INFO L272 TraceCheckUtils]: 26: Hoare triple {8690#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {8703#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:11,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {8703#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8704#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:11,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {8704#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8685#false} is VALID [2022-04-27 10:47:11,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {8685#false} assume !false; {8685#false} is VALID [2022-04-27 10:47:11,260 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-27 10:47:11,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:11,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808219236] [2022-04-27 10:47:11,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808219236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:11,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:11,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:47:11,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678586796] [2022-04-27 10:47:11,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:11,261 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-27 10:47:11,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:11,261 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-27 10:47:11,274 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-27 10:47:11,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:47:11,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:11,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:47:11,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:47:11,274 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-27 10:47:12,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:12,681 INFO L93 Difference]: Finished difference Result 324 states and 521 transitions. [2022-04-27 10:47:12,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:47:12,681 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-27 10:47:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:12,681 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-27 10:47:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-27 10:47:12,683 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-27 10:47:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-27 10:47:12,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-27 10:47:12,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:12,772 INFO L225 Difference]: With dead ends: 324 [2022-04-27 10:47:12,772 INFO L226 Difference]: Without dead ends: 322 [2022-04-27 10:47:12,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:47:12,772 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:12,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 75 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:47:12,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-27 10:47:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 300. [2022-04-27 10:47:13,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:13,437 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-27 10:47:13,437 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-27 10:47:13,437 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-27 10:47:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:13,455 INFO L93 Difference]: Finished difference Result 322 states and 519 transitions. [2022-04-27 10:47:13,455 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2022-04-27 10:47:13,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:13,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:13,457 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-27 10:47:13,457 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-27 10:47:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:13,467 INFO L93 Difference]: Finished difference Result 322 states and 519 transitions. [2022-04-27 10:47:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2022-04-27 10:47:13,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:13,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:13,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:13,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:13,470 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-27 10:47:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 489 transitions. [2022-04-27 10:47:13,480 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 489 transitions. Word has length 30 [2022-04-27 10:47:13,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:13,480 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 489 transitions. [2022-04-27 10:47:13,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 10:47:13,480 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 489 transitions. [2022-04-27 10:47:13,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 10:47:13,481 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:13,481 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:13,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 10:47:13,481 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:13,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:13,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1828949766, now seen corresponding path program 1 times [2022-04-27 10:47:13,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:13,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600457126] [2022-04-27 10:47:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:13,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:13,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:13,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {10367#(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); {10345#true} is VALID [2022-04-27 10:47:13,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {10345#true} assume true; {10345#true} is VALID [2022-04-27 10:47:13,528 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10345#true} {10345#true} #138#return; {10345#true} is VALID [2022-04-27 10:47:13,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:13,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {10345#true} ~cond := #in~cond; {10345#true} is VALID [2022-04-27 10:47:13,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {10345#true} assume !(0 == ~cond); {10345#true} is VALID [2022-04-27 10:47:13,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {10345#true} assume true; {10345#true} is VALID [2022-04-27 10:47:13,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10345#true} {10352#(<= (+ main_~i~0 1) main_~n~0)} #118#return; {10352#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-27 10:47:13,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:47:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:13,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {10345#true} ~cond := #in~cond; {10345#true} is VALID [2022-04-27 10:47:13,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {10345#true} assume !(0 == ~cond); {10345#true} is VALID [2022-04-27 10:47:13,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {10345#true} assume true; {10345#true} is VALID [2022-04-27 10:47:13,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10345#true} {10352#(<= (+ main_~i~0 1) main_~n~0)} #120#return; {10352#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-27 10:47:13,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 10:47:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:13,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {10345#true} ~cond := #in~cond; {10345#true} is VALID [2022-04-27 10:47:13,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {10345#true} assume !(0 == ~cond); {10345#true} is VALID [2022-04-27 10:47:13,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {10345#true} assume true; {10345#true} is VALID [2022-04-27 10:47:13,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10345#true} {10352#(<= (+ main_~i~0 1) main_~n~0)} #122#return; {10352#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-27 10:47:13,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {10345#true} call ULTIMATE.init(); {10367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:13,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {10367#(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); {10345#true} is VALID [2022-04-27 10:47:13,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {10345#true} assume true; {10345#true} is VALID [2022-04-27 10:47:13,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10345#true} {10345#true} #138#return; {10345#true} is VALID [2022-04-27 10:47:13,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {10345#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {10345#true} is VALID [2022-04-27 10:47:13,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {10345#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; {10345#true} is VALID [2022-04-27 10:47:13,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {10345#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; {10350#(<= (* main_~l~0 2) (+ main_~n~0 2))} is VALID [2022-04-27 10:47:13,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {10350#(<= (* main_~l~0 2) (+ main_~n~0 2))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {10351#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-27 10:47:13,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {10351#(<= (+ main_~l~0 1) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {10352#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-27 10:47:13,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {10352#(<= (+ main_~i~0 1) main_~n~0)} assume !!(~j~0 <= ~r~0); {10352#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-27 10:47:13,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {10352#(<= (+ main_~i~0 1) main_~n~0)} assume !(~j~0 < ~r~0); {10352#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-27 10:47:13,544 INFO L272 TraceCheckUtils]: 11: Hoare triple {10352#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {10345#true} is VALID [2022-04-27 10:47:13,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {10345#true} ~cond := #in~cond; {10345#true} is VALID [2022-04-27 10:47:13,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {10345#true} assume !(0 == ~cond); {10345#true} is VALID [2022-04-27 10:47:13,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {10345#true} assume true; {10345#true} is VALID [2022-04-27 10:47:13,544 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10345#true} {10352#(<= (+ main_~i~0 1) main_~n~0)} #118#return; {10352#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-27 10:47:13,545 INFO L272 TraceCheckUtils]: 16: Hoare triple {10352#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {10345#true} is VALID [2022-04-27 10:47:13,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {10345#true} ~cond := #in~cond; {10345#true} is VALID [2022-04-27 10:47:13,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {10345#true} assume !(0 == ~cond); {10345#true} is VALID [2022-04-27 10:47:13,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {10345#true} assume true; {10345#true} is VALID [2022-04-27 10:47:13,545 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10345#true} {10352#(<= (+ main_~i~0 1) main_~n~0)} #120#return; {10352#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-27 10:47:13,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {10352#(<= (+ main_~i~0 1) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {10352#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-27 10:47:13,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {10352#(<= (+ main_~i~0 1) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {10352#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-27 10:47:13,546 INFO L272 TraceCheckUtils]: 23: Hoare triple {10352#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {10345#true} is VALID [2022-04-27 10:47:13,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {10345#true} ~cond := #in~cond; {10345#true} is VALID [2022-04-27 10:47:13,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {10345#true} assume !(0 == ~cond); {10345#true} is VALID [2022-04-27 10:47:13,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {10345#true} assume true; {10345#true} is VALID [2022-04-27 10:47:13,546 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10345#true} {10352#(<= (+ main_~i~0 1) main_~n~0)} #122#return; {10352#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-27 10:47:13,547 INFO L272 TraceCheckUtils]: 28: Hoare triple {10352#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {10365#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:13,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {10365#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10366#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:13,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {10366#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10346#false} is VALID [2022-04-27 10:47:13,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {10346#false} assume !false; {10346#false} is VALID [2022-04-27 10:47:13,548 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-27 10:47:13,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:13,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600457126] [2022-04-27 10:47:13,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600457126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:13,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:13,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:47:13,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537307605] [2022-04-27 10:47:13,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:13,549 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-27 10:47:13,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:13,549 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-27 10:47:13,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:13,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:47:13,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:13,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:47:13,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:47:13,564 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-27 10:47:15,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:15,941 INFO L93 Difference]: Finished difference Result 470 states and 788 transitions. [2022-04-27 10:47:15,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:47:15,941 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-27 10:47:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:15,941 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-27 10:47:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-04-27 10:47:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 10:47:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-04-27 10:47:15,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 145 transitions. [2022-04-27 10:47:16,070 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-27 10:47:16,090 INFO L225 Difference]: With dead ends: 470 [2022-04-27 10:47:16,091 INFO L226 Difference]: Without dead ends: 468 [2022-04-27 10:47:16,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:47:16,092 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 98 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:16,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 76 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 10:47:16,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-27 10:47:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 422. [2022-04-27 10:47:17,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:17,236 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-27 10:47:17,244 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-27 10:47:17,244 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-27 10:47:17,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:17,264 INFO L93 Difference]: Finished difference Result 468 states and 786 transitions. [2022-04-27 10:47:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 786 transitions. [2022-04-27 10:47:17,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:17,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:17,273 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-27 10:47:17,274 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-27 10:47:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:17,293 INFO L93 Difference]: Finished difference Result 468 states and 786 transitions. [2022-04-27 10:47:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 786 transitions. [2022-04-27 10:47:17,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:17,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:17,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:17,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:17,296 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-27 10:47:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 708 transitions. [2022-04-27 10:47:17,314 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 708 transitions. Word has length 32 [2022-04-27 10:47:17,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:17,314 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 708 transitions. [2022-04-27 10:47:17,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 10:47:17,314 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 708 transitions. [2022-04-27 10:47:17,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 10:47:17,315 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:17,315 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:17,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 10:47:17,315 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:17,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:17,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1969498376, now seen corresponding path program 1 times [2022-04-27 10:47:17,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:17,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945831418] [2022-04-27 10:47:17,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:17,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:17,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {12772#(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); {12750#true} is VALID [2022-04-27 10:47:17,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {12750#true} assume true; {12750#true} is VALID [2022-04-27 10:47:17,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12750#true} {12750#true} #138#return; {12750#true} is VALID [2022-04-27 10:47:17,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:17,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {12750#true} ~cond := #in~cond; {12750#true} is VALID [2022-04-27 10:47:17,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {12750#true} assume !(0 == ~cond); {12750#true} is VALID [2022-04-27 10:47:17,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {12750#true} assume true; {12750#true} is VALID [2022-04-27 10:47:17,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12750#true} {12757#(<= main_~i~0 main_~n~0)} #118#return; {12757#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:47:17,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:47:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:17,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {12750#true} ~cond := #in~cond; {12750#true} is VALID [2022-04-27 10:47:17,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {12750#true} assume !(0 == ~cond); {12750#true} is VALID [2022-04-27 10:47:17,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {12750#true} assume true; {12750#true} is VALID [2022-04-27 10:47:17,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12750#true} {12757#(<= main_~i~0 main_~n~0)} #120#return; {12757#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:47:17,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 10:47:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:17,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {12750#true} ~cond := #in~cond; {12750#true} is VALID [2022-04-27 10:47:17,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {12750#true} assume !(0 == ~cond); {12750#true} is VALID [2022-04-27 10:47:17,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {12750#true} assume true; {12750#true} is VALID [2022-04-27 10:47:17,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12750#true} {12757#(<= main_~i~0 main_~n~0)} #122#return; {12757#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:47:17,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {12750#true} call ULTIMATE.init(); {12772#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:17,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {12772#(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); {12750#true} is VALID [2022-04-27 10:47:17,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {12750#true} assume true; {12750#true} is VALID [2022-04-27 10:47:17,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12750#true} {12750#true} #138#return; {12750#true} is VALID [2022-04-27 10:47:17,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {12750#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {12750#true} is VALID [2022-04-27 10:47:17,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {12750#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; {12750#true} is VALID [2022-04-27 10:47:17,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {12750#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; {12755#(<= 1 main_~n~0)} is VALID [2022-04-27 10:47:17,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {12755#(<= 1 main_~n~0)} assume !(~l~0 > 1);#t~post3 := ~r~0;~r~0 := #t~post3 - 1;havoc #t~post3; {12756#(<= main_~l~0 main_~n~0)} is VALID [2022-04-27 10:47:17,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {12756#(<= main_~l~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {12757#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:47:17,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {12757#(<= main_~i~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {12757#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:47:17,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {12757#(<= main_~i~0 main_~n~0)} assume !(~j~0 < ~r~0); {12757#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:47:17,397 INFO L272 TraceCheckUtils]: 11: Hoare triple {12757#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {12750#true} is VALID [2022-04-27 10:47:17,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {12750#true} ~cond := #in~cond; {12750#true} is VALID [2022-04-27 10:47:17,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {12750#true} assume !(0 == ~cond); {12750#true} is VALID [2022-04-27 10:47:17,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {12750#true} assume true; {12750#true} is VALID [2022-04-27 10:47:17,398 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12750#true} {12757#(<= main_~i~0 main_~n~0)} #118#return; {12757#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:47:17,400 INFO L272 TraceCheckUtils]: 16: Hoare triple {12757#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {12750#true} is VALID [2022-04-27 10:47:17,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {12750#true} ~cond := #in~cond; {12750#true} is VALID [2022-04-27 10:47:17,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {12750#true} assume !(0 == ~cond); {12750#true} is VALID [2022-04-27 10:47:17,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {12750#true} assume true; {12750#true} is VALID [2022-04-27 10:47:17,402 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {12750#true} {12757#(<= main_~i~0 main_~n~0)} #120#return; {12757#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:47:17,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {12757#(<= main_~i~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {12757#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:47:17,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {12757#(<= main_~i~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {12757#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:47:17,402 INFO L272 TraceCheckUtils]: 23: Hoare triple {12757#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {12750#true} is VALID [2022-04-27 10:47:17,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {12750#true} ~cond := #in~cond; {12750#true} is VALID [2022-04-27 10:47:17,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {12750#true} assume !(0 == ~cond); {12750#true} is VALID [2022-04-27 10:47:17,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {12750#true} assume true; {12750#true} is VALID [2022-04-27 10:47:17,404 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12750#true} {12757#(<= main_~i~0 main_~n~0)} #122#return; {12757#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:47:17,404 INFO L272 TraceCheckUtils]: 28: Hoare triple {12757#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {12770#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:17,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {12770#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12771#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:17,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {12771#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12751#false} is VALID [2022-04-27 10:47:17,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {12751#false} assume !false; {12751#false} is VALID [2022-04-27 10:47:17,405 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-27 10:47:17,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:17,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945831418] [2022-04-27 10:47:17,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945831418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:17,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:17,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:47:17,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151704776] [2022-04-27 10:47:17,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:17,406 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-27 10:47:17,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:17,406 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-27 10:47:17,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:17,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:47:17,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:17,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:47:17,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:47:17,421 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-27 10:47:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:19,731 INFO L93 Difference]: Finished difference Result 489 states and 817 transitions. [2022-04-27 10:47:19,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:47:19,731 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-27 10:47:19,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:19,732 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-27 10:47:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-27 10:47:19,733 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-27 10:47:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-27 10:47:19,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2022-04-27 10:47:19,831 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-27 10:47:19,843 INFO L225 Difference]: With dead ends: 489 [2022-04-27 10:47:19,843 INFO L226 Difference]: Without dead ends: 487 [2022-04-27 10:47:19,844 INFO L412 NwaCegarLoop]: 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-27 10:47:19,844 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 109 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:19,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 66 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:47:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-04-27 10:47:21,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 429. [2022-04-27 10:47:21,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:21,209 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-27 10:47:21,210 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-27 10:47:21,210 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-27 10:47:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:21,230 INFO L93 Difference]: Finished difference Result 487 states and 815 transitions. [2022-04-27 10:47:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 815 transitions. [2022-04-27 10:47:21,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:21,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:21,232 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-27 10:47:21,233 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-27 10:47:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:21,252 INFO L93 Difference]: Finished difference Result 487 states and 815 transitions. [2022-04-27 10:47:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 815 transitions. [2022-04-27 10:47:21,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:21,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:21,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:21,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:21,254 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-27 10:47:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 717 transitions. [2022-04-27 10:47:21,272 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 717 transitions. Word has length 32 [2022-04-27 10:47:21,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:21,272 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 717 transitions. [2022-04-27 10:47:21,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 10:47:21,272 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 717 transitions. [2022-04-27 10:47:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 10:47:21,273 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:21,273 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:21,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 10:47:21,273 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:21,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:21,273 INFO L85 PathProgramCache]: Analyzing trace with hash 154781133, now seen corresponding path program 1 times [2022-04-27 10:47:21,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:21,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569590129] [2022-04-27 10:47:21,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:21,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:21,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:21,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {15263#(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); {15233#true} is VALID [2022-04-27 10:47:21,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {15233#true} assume true; {15233#true} is VALID [2022-04-27 10:47:21,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15233#true} {15233#true} #138#return; {15233#true} is VALID [2022-04-27 10:47:21,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:21,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {15233#true} ~cond := #in~cond; {15233#true} is VALID [2022-04-27 10:47:21,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {15233#true} assume !(0 == ~cond); {15233#true} is VALID [2022-04-27 10:47:21,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {15233#true} assume true; {15233#true} is VALID [2022-04-27 10:47:21,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15233#true} {15239#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {15239#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:21,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:47:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:21,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {15233#true} ~cond := #in~cond; {15233#true} is VALID [2022-04-27 10:47:21,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {15233#true} assume !(0 == ~cond); {15233#true} is VALID [2022-04-27 10:47:21,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {15233#true} assume true; {15233#true} is VALID [2022-04-27 10:47:21,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15233#true} {15239#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {15239#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:21,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-27 10:47:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:21,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {15233#true} ~cond := #in~cond; {15233#true} is VALID [2022-04-27 10:47:21,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {15233#true} assume !(0 == ~cond); {15233#true} is VALID [2022-04-27 10:47:21,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {15233#true} assume true; {15233#true} is VALID [2022-04-27 10:47:21,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15233#true} {15239#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {15239#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:21,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 10:47:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:21,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {15233#true} ~cond := #in~cond; {15233#true} is VALID [2022-04-27 10:47:21,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {15233#true} assume !(0 == ~cond); {15233#true} is VALID [2022-04-27 10:47:21,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {15233#true} assume true; {15233#true} is VALID [2022-04-27 10:47:21,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15233#true} {15239#(<= (+ main_~j~0 1) main_~n~0)} #116#return; {15239#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:21,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-27 10:47:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:21,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {15233#true} ~cond := #in~cond; {15233#true} is VALID [2022-04-27 10:47:21,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {15233#true} assume !(0 == ~cond); {15233#true} is VALID [2022-04-27 10:47:21,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {15233#true} assume true; {15233#true} is VALID [2022-04-27 10:47:21,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15233#true} {15256#(<= main_~j~0 main_~n~0)} #118#return; {15256#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:47:21,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {15233#true} call ULTIMATE.init(); {15263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:21,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {15263#(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); {15233#true} is VALID [2022-04-27 10:47:21,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {15233#true} assume true; {15233#true} is VALID [2022-04-27 10:47:21,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15233#true} {15233#true} #138#return; {15233#true} is VALID [2022-04-27 10:47:21,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {15233#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {15233#true} is VALID [2022-04-27 10:47:21,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {15233#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; {15233#true} is VALID [2022-04-27 10:47:21,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {15233#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; {15238#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:21,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {15238#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {15238#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:21,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {15238#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {15238#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:21,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {15238#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {15238#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:47:21,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {15238#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {15239#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:21,562 INFO L272 TraceCheckUtils]: 11: Hoare triple {15239#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {15233#true} is VALID [2022-04-27 10:47:21,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {15233#true} ~cond := #in~cond; {15233#true} is VALID [2022-04-27 10:47:21,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {15233#true} assume !(0 == ~cond); {15233#true} is VALID [2022-04-27 10:47:21,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {15233#true} assume true; {15233#true} is VALID [2022-04-27 10:47:21,562 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15233#true} {15239#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {15239#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:21,562 INFO L272 TraceCheckUtils]: 16: Hoare triple {15239#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {15233#true} is VALID [2022-04-27 10:47:21,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {15233#true} ~cond := #in~cond; {15233#true} is VALID [2022-04-27 10:47:21,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {15233#true} assume !(0 == ~cond); {15233#true} is VALID [2022-04-27 10:47:21,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {15233#true} assume true; {15233#true} is VALID [2022-04-27 10:47:21,563 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {15233#true} {15239#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {15239#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:21,563 INFO L272 TraceCheckUtils]: 21: Hoare triple {15239#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {15233#true} is VALID [2022-04-27 10:47:21,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {15233#true} ~cond := #in~cond; {15233#true} is VALID [2022-04-27 10:47:21,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {15233#true} assume !(0 == ~cond); {15233#true} is VALID [2022-04-27 10:47:21,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {15233#true} assume true; {15233#true} is VALID [2022-04-27 10:47:21,563 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15233#true} {15239#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {15239#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:21,563 INFO L272 TraceCheckUtils]: 26: Hoare triple {15239#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {15233#true} is VALID [2022-04-27 10:47:21,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {15233#true} ~cond := #in~cond; {15233#true} is VALID [2022-04-27 10:47:21,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {15233#true} assume !(0 == ~cond); {15233#true} is VALID [2022-04-27 10:47:21,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {15233#true} assume true; {15233#true} is VALID [2022-04-27 10:47:21,564 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15233#true} {15239#(<= (+ main_~j~0 1) main_~n~0)} #116#return; {15239#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:21,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {15239#(<= (+ main_~j~0 1) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {15239#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:21,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {15239#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {15256#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:47:21,565 INFO L272 TraceCheckUtils]: 33: Hoare triple {15256#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {15233#true} is VALID [2022-04-27 10:47:21,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {15233#true} ~cond := #in~cond; {15233#true} is VALID [2022-04-27 10:47:21,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {15233#true} assume !(0 == ~cond); {15233#true} is VALID [2022-04-27 10:47:21,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {15233#true} assume true; {15233#true} is VALID [2022-04-27 10:47:21,565 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {15233#true} {15256#(<= main_~j~0 main_~n~0)} #118#return; {15256#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:47:21,565 INFO L272 TraceCheckUtils]: 38: Hoare triple {15256#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {15261#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:21,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {15261#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15262#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:21,566 INFO L290 TraceCheckUtils]: 40: Hoare triple {15262#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15234#false} is VALID [2022-04-27 10:47:21,566 INFO L290 TraceCheckUtils]: 41: Hoare triple {15234#false} assume !false; {15234#false} is VALID [2022-04-27 10:47:21,566 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-27 10:47:21,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:21,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569590129] [2022-04-27 10:47:21,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569590129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:21,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:21,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:47:21,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705645182] [2022-04-27 10:47:21,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:21,567 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-27 10:47:21,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:21,567 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-27 10:47:21,583 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-27 10:47:21,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:47:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:21,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:47:21,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:47:21,584 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-27 10:47:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:23,903 INFO L93 Difference]: Finished difference Result 484 states and 791 transitions. [2022-04-27 10:47:23,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:47:23,904 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-27 10:47:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:23,904 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-27 10:47:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-27 10:47:23,905 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-27 10:47:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-27 10:47:23,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2022-04-27 10:47:24,005 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-27 10:47:24,025 INFO L225 Difference]: With dead ends: 484 [2022-04-27 10:47:24,025 INFO L226 Difference]: Without dead ends: 482 [2022-04-27 10:47:24,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:47:24,031 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 56 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:24,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 82 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:47:24,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-04-27 10:47:25,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 433. [2022-04-27 10:47:25,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:25,479 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-27 10:47:25,480 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-27 10:47:25,480 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-27 10:47:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:25,496 INFO L93 Difference]: Finished difference Result 482 states and 789 transitions. [2022-04-27 10:47:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 789 transitions. [2022-04-27 10:47:25,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:25,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:25,499 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-27 10:47:25,500 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-27 10:47:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:25,517 INFO L93 Difference]: Finished difference Result 482 states and 789 transitions. [2022-04-27 10:47:25,517 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 789 transitions. [2022-04-27 10:47:25,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:25,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:25,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:25,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:25,519 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-27 10:47:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 720 transitions. [2022-04-27 10:47:25,536 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 720 transitions. Word has length 42 [2022-04-27 10:47:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:25,536 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 720 transitions. [2022-04-27 10:47:25,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 10:47:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 720 transitions. [2022-04-27 10:47:25,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 10:47:25,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:25,538 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:25,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 10:47:25,538 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:25,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:25,538 INFO L85 PathProgramCache]: Analyzing trace with hash -756625364, now seen corresponding path program 1 times [2022-04-27 10:47:25,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:25,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296117648] [2022-04-27 10:47:25,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:25,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:25,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:25,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {17722#(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); {17696#true} is VALID [2022-04-27 10:47:25,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {17696#true} assume true; {17696#true} is VALID [2022-04-27 10:47:25,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17696#true} {17696#true} #138#return; {17696#true} is VALID [2022-04-27 10:47:25,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:25,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {17696#true} ~cond := #in~cond; {17696#true} is VALID [2022-04-27 10:47:25,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {17696#true} assume !(0 == ~cond); {17696#true} is VALID [2022-04-27 10:47:25,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {17696#true} assume true; {17696#true} is VALID [2022-04-27 10:47:25,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17696#true} {17696#true} #118#return; {17696#true} is VALID [2022-04-27 10:47:25,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:47:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:25,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {17696#true} ~cond := #in~cond; {17696#true} is VALID [2022-04-27 10:47:25,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {17696#true} assume !(0 == ~cond); {17696#true} is VALID [2022-04-27 10:47:25,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {17696#true} assume true; {17696#true} is VALID [2022-04-27 10:47:25,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17696#true} {17696#true} #120#return; {17696#true} is VALID [2022-04-27 10:47:25,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 10:47:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:25,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {17696#true} ~cond := #in~cond; {17696#true} is VALID [2022-04-27 10:47:25,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {17696#true} assume !(0 == ~cond); {17696#true} is VALID [2022-04-27 10:47:25,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {17696#true} assume true; {17696#true} is VALID [2022-04-27 10:47:25,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17696#true} {17709#(<= 2 main_~l~0)} #130#return; {17709#(<= 2 main_~l~0)} is VALID [2022-04-27 10:47:25,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-27 10:47:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:25,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {17696#true} ~cond := #in~cond; {17696#true} is VALID [2022-04-27 10:47:25,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {17696#true} assume !(0 == ~cond); {17696#true} is VALID [2022-04-27 10:47:25,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {17696#true} assume true; {17696#true} is VALID [2022-04-27 10:47:25,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17696#true} {17709#(<= 2 main_~l~0)} #132#return; {17709#(<= 2 main_~l~0)} is VALID [2022-04-27 10:47:25,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {17696#true} call ULTIMATE.init(); {17722#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:25,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {17722#(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); {17696#true} is VALID [2022-04-27 10:47:25,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {17696#true} assume true; {17696#true} is VALID [2022-04-27 10:47:25,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17696#true} {17696#true} #138#return; {17696#true} is VALID [2022-04-27 10:47:25,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {17696#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {17696#true} is VALID [2022-04-27 10:47:25,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {17696#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; {17696#true} is VALID [2022-04-27 10:47:25,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {17696#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; {17696#true} is VALID [2022-04-27 10:47:25,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {17696#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {17696#true} is VALID [2022-04-27 10:47:25,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {17696#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {17696#true} is VALID [2022-04-27 10:47:25,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {17696#true} assume !!(~j~0 <= ~r~0); {17696#true} is VALID [2022-04-27 10:47:25,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {17696#true} assume !(~j~0 < ~r~0); {17696#true} is VALID [2022-04-27 10:47:25,603 INFO L272 TraceCheckUtils]: 11: Hoare triple {17696#true} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {17696#true} is VALID [2022-04-27 10:47:25,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {17696#true} ~cond := #in~cond; {17696#true} is VALID [2022-04-27 10:47:25,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {17696#true} assume !(0 == ~cond); {17696#true} is VALID [2022-04-27 10:47:25,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {17696#true} assume true; {17696#true} is VALID [2022-04-27 10:47:25,603 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17696#true} {17696#true} #118#return; {17696#true} is VALID [2022-04-27 10:47:25,603 INFO L272 TraceCheckUtils]: 16: Hoare triple {17696#true} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {17696#true} is VALID [2022-04-27 10:47:25,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {17696#true} ~cond := #in~cond; {17696#true} is VALID [2022-04-27 10:47:25,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {17696#true} assume !(0 == ~cond); {17696#true} is VALID [2022-04-27 10:47:25,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {17696#true} assume true; {17696#true} is VALID [2022-04-27 10:47:25,605 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17696#true} {17696#true} #120#return; {17696#true} is VALID [2022-04-27 10:47:25,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {17696#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {17696#true} is VALID [2022-04-27 10:47:25,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {17696#true} assume 0 != #t~nondet5;havoc #t~nondet5; {17696#true} is VALID [2022-04-27 10:47:25,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {17696#true} assume ~l~0 > 1; {17709#(<= 2 main_~l~0)} is VALID [2022-04-27 10:47:25,607 INFO L272 TraceCheckUtils]: 24: Hoare triple {17709#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {17696#true} is VALID [2022-04-27 10:47:25,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {17696#true} ~cond := #in~cond; {17696#true} is VALID [2022-04-27 10:47:25,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {17696#true} assume !(0 == ~cond); {17696#true} is VALID [2022-04-27 10:47:25,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {17696#true} assume true; {17696#true} is VALID [2022-04-27 10:47:25,607 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {17696#true} {17709#(<= 2 main_~l~0)} #130#return; {17709#(<= 2 main_~l~0)} is VALID [2022-04-27 10:47:25,607 INFO L272 TraceCheckUtils]: 29: Hoare triple {17709#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {17696#true} is VALID [2022-04-27 10:47:25,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {17696#true} ~cond := #in~cond; {17696#true} is VALID [2022-04-27 10:47:25,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {17696#true} assume !(0 == ~cond); {17696#true} is VALID [2022-04-27 10:47:25,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {17696#true} assume true; {17696#true} is VALID [2022-04-27 10:47:25,608 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {17696#true} {17709#(<= 2 main_~l~0)} #132#return; {17709#(<= 2 main_~l~0)} is VALID [2022-04-27 10:47:25,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {17709#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {17718#(<= 1 main_~l~0)} is VALID [2022-04-27 10:47:25,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {17718#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {17719#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:25,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {17719#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {17719#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:25,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {17719#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {17719#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:25,609 INFO L272 TraceCheckUtils]: 38: Hoare triple {17719#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {17720#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:25,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {17720#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {17721#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:25,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {17721#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17697#false} is VALID [2022-04-27 10:47:25,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {17697#false} assume !false; {17697#false} is VALID [2022-04-27 10:47:25,610 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-27 10:47:25,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:25,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296117648] [2022-04-27 10:47:25,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296117648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:25,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:25,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:47:25,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2625655] [2022-04-27 10:47:25,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:25,611 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-27 10:47:25,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:25,611 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-27 10:47:25,626 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-27 10:47:25,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:47:25,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:25,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:47:25,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:47:25,627 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-27 10:47:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:27,497 INFO L93 Difference]: Finished difference Result 440 states and 726 transitions. [2022-04-27 10:47:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:47:27,498 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-27 10:47:27,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:27,498 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-27 10:47:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-27 10:47:27,499 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-27 10:47:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-27 10:47:27,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-27 10:47:27,554 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-27 10:47:27,574 INFO L225 Difference]: With dead ends: 440 [2022-04-27 10:47:27,574 INFO L226 Difference]: Without dead ends: 438 [2022-04-27 10:47:27,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:47:27,574 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:27,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 52 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:47:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-04-27 10:47:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 437. [2022-04-27 10:47:28,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:28,959 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-27 10:47:28,960 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-27 10:47:28,960 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-27 10:47:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:28,974 INFO L93 Difference]: Finished difference Result 438 states and 724 transitions. [2022-04-27 10:47:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 724 transitions. [2022-04-27 10:47:28,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:28,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:28,976 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-27 10:47:28,976 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-27 10:47:28,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:28,991 INFO L93 Difference]: Finished difference Result 438 states and 724 transitions. [2022-04-27 10:47:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 724 transitions. [2022-04-27 10:47:28,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:28,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:28,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:28,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:28,993 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-27 10:47:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 723 transitions. [2022-04-27 10:47:29,008 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 723 transitions. Word has length 42 [2022-04-27 10:47:29,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:29,008 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 723 transitions. [2022-04-27 10:47:29,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 10:47:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 723 transitions. [2022-04-27 10:47:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 10:47:29,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:29,010 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:29,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 10:47:29,010 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:29,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:29,010 INFO L85 PathProgramCache]: Analyzing trace with hash 202086614, now seen corresponding path program 1 times [2022-04-27 10:47:29,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:29,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131216286] [2022-04-27 10:47:29,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:29,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:29,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:29,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {20049#(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); {20015#true} is VALID [2022-04-27 10:47:29,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {20015#true} assume true; {20015#true} is VALID [2022-04-27 10:47:29,055 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20015#true} {20015#true} #138#return; {20015#true} is VALID [2022-04-27 10:47:29,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:29,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {20015#true} ~cond := #in~cond; {20015#true} is VALID [2022-04-27 10:47:29,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {20015#true} assume !(0 == ~cond); {20015#true} is VALID [2022-04-27 10:47:29,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {20015#true} assume true; {20015#true} is VALID [2022-04-27 10:47:29,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20015#true} {20015#true} #118#return; {20015#true} is VALID [2022-04-27 10:47:29,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:47:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:29,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {20015#true} ~cond := #in~cond; {20015#true} is VALID [2022-04-27 10:47:29,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {20015#true} assume !(0 == ~cond); {20015#true} is VALID [2022-04-27 10:47:29,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {20015#true} assume true; {20015#true} is VALID [2022-04-27 10:47:29,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20015#true} {20015#true} #120#return; {20015#true} is VALID [2022-04-27 10:47:29,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 10:47:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:29,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {20015#true} ~cond := #in~cond; {20015#true} is VALID [2022-04-27 10:47:29,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {20015#true} assume !(0 == ~cond); {20015#true} is VALID [2022-04-27 10:47:29,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {20015#true} assume true; {20015#true} is VALID [2022-04-27 10:47:29,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20015#true} {20028#(<= 2 main_~l~0)} #130#return; {20028#(<= 2 main_~l~0)} is VALID [2022-04-27 10:47:29,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-27 10:47:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:29,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {20015#true} ~cond := #in~cond; {20015#true} is VALID [2022-04-27 10:47:29,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {20015#true} assume !(0 == ~cond); {20015#true} is VALID [2022-04-27 10:47:29,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {20015#true} assume true; {20015#true} is VALID [2022-04-27 10:47:29,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20015#true} {20028#(<= 2 main_~l~0)} #132#return; {20028#(<= 2 main_~l~0)} is VALID [2022-04-27 10:47:29,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 10:47:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:29,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {20015#true} ~cond := #in~cond; {20015#true} is VALID [2022-04-27 10:47:29,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {20015#true} assume !(0 == ~cond); {20015#true} is VALID [2022-04-27 10:47:29,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {20015#true} assume true; {20015#true} is VALID [2022-04-27 10:47:29,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20015#true} {20038#(<= 1 main_~i~0)} #118#return; {20038#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:29,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-27 10:47:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:29,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {20015#true} ~cond := #in~cond; {20015#true} is VALID [2022-04-27 10:47:29,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {20015#true} assume !(0 == ~cond); {20015#true} is VALID [2022-04-27 10:47:29,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {20015#true} assume true; {20015#true} is VALID [2022-04-27 10:47:29,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20015#true} {20038#(<= 1 main_~i~0)} #120#return; {20038#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:29,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {20015#true} call ULTIMATE.init(); {20049#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:29,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {20049#(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); {20015#true} is VALID [2022-04-27 10:47:29,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {20015#true} assume true; {20015#true} is VALID [2022-04-27 10:47:29,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20015#true} {20015#true} #138#return; {20015#true} is VALID [2022-04-27 10:47:29,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {20015#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {20015#true} is VALID [2022-04-27 10:47:29,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {20015#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; {20015#true} is VALID [2022-04-27 10:47:29,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {20015#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; {20015#true} is VALID [2022-04-27 10:47:29,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {20015#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {20015#true} is VALID [2022-04-27 10:47:29,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {20015#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {20015#true} is VALID [2022-04-27 10:47:29,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {20015#true} assume !!(~j~0 <= ~r~0); {20015#true} is VALID [2022-04-27 10:47:29,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {20015#true} assume !(~j~0 < ~r~0); {20015#true} is VALID [2022-04-27 10:47:29,072 INFO L272 TraceCheckUtils]: 11: Hoare triple {20015#true} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {20015#true} is VALID [2022-04-27 10:47:29,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {20015#true} ~cond := #in~cond; {20015#true} is VALID [2022-04-27 10:47:29,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {20015#true} assume !(0 == ~cond); {20015#true} is VALID [2022-04-27 10:47:29,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {20015#true} assume true; {20015#true} is VALID [2022-04-27 10:47:29,073 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20015#true} {20015#true} #118#return; {20015#true} is VALID [2022-04-27 10:47:29,073 INFO L272 TraceCheckUtils]: 16: Hoare triple {20015#true} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {20015#true} is VALID [2022-04-27 10:47:29,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {20015#true} ~cond := #in~cond; {20015#true} is VALID [2022-04-27 10:47:29,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {20015#true} assume !(0 == ~cond); {20015#true} is VALID [2022-04-27 10:47:29,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {20015#true} assume true; {20015#true} is VALID [2022-04-27 10:47:29,073 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20015#true} {20015#true} #120#return; {20015#true} is VALID [2022-04-27 10:47:29,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {20015#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20015#true} is VALID [2022-04-27 10:47:29,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {20015#true} assume 0 != #t~nondet5;havoc #t~nondet5; {20015#true} is VALID [2022-04-27 10:47:29,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {20015#true} assume ~l~0 > 1; {20028#(<= 2 main_~l~0)} is VALID [2022-04-27 10:47:29,074 INFO L272 TraceCheckUtils]: 24: Hoare triple {20028#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {20015#true} is VALID [2022-04-27 10:47:29,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {20015#true} ~cond := #in~cond; {20015#true} is VALID [2022-04-27 10:47:29,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {20015#true} assume !(0 == ~cond); {20015#true} is VALID [2022-04-27 10:47:29,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {20015#true} assume true; {20015#true} is VALID [2022-04-27 10:47:29,074 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {20015#true} {20028#(<= 2 main_~l~0)} #130#return; {20028#(<= 2 main_~l~0)} is VALID [2022-04-27 10:47:29,074 INFO L272 TraceCheckUtils]: 29: Hoare triple {20028#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {20015#true} is VALID [2022-04-27 10:47:29,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {20015#true} ~cond := #in~cond; {20015#true} is VALID [2022-04-27 10:47:29,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {20015#true} assume !(0 == ~cond); {20015#true} is VALID [2022-04-27 10:47:29,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {20015#true} assume true; {20015#true} is VALID [2022-04-27 10:47:29,075 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {20015#true} {20028#(<= 2 main_~l~0)} #132#return; {20028#(<= 2 main_~l~0)} is VALID [2022-04-27 10:47:29,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {20028#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {20037#(<= 1 main_~l~0)} is VALID [2022-04-27 10:47:29,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {20037#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {20038#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:29,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {20038#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {20038#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:29,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {20038#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {20038#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:29,076 INFO L272 TraceCheckUtils]: 38: Hoare triple {20038#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {20015#true} is VALID [2022-04-27 10:47:29,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {20015#true} ~cond := #in~cond; {20015#true} is VALID [2022-04-27 10:47:29,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {20015#true} assume !(0 == ~cond); {20015#true} is VALID [2022-04-27 10:47:29,076 INFO L290 TraceCheckUtils]: 41: Hoare triple {20015#true} assume true; {20015#true} is VALID [2022-04-27 10:47:29,076 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20015#true} {20038#(<= 1 main_~i~0)} #118#return; {20038#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:29,076 INFO L272 TraceCheckUtils]: 43: Hoare triple {20038#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {20015#true} is VALID [2022-04-27 10:47:29,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {20015#true} ~cond := #in~cond; {20015#true} is VALID [2022-04-27 10:47:29,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {20015#true} assume !(0 == ~cond); {20015#true} is VALID [2022-04-27 10:47:29,077 INFO L290 TraceCheckUtils]: 46: Hoare triple {20015#true} assume true; {20015#true} is VALID [2022-04-27 10:47:29,077 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20015#true} {20038#(<= 1 main_~i~0)} #120#return; {20038#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:29,077 INFO L290 TraceCheckUtils]: 48: Hoare triple {20038#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20038#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:29,077 INFO L290 TraceCheckUtils]: 49: Hoare triple {20038#(<= 1 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {20038#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:29,078 INFO L272 TraceCheckUtils]: 50: Hoare triple {20038#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {20047#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:29,078 INFO L290 TraceCheckUtils]: 51: Hoare triple {20047#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {20048#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:29,078 INFO L290 TraceCheckUtils]: 52: Hoare triple {20048#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20016#false} is VALID [2022-04-27 10:47:29,078 INFO L290 TraceCheckUtils]: 53: Hoare triple {20016#false} assume !false; {20016#false} is VALID [2022-04-27 10:47:29,078 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-27 10:47:29,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:29,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131216286] [2022-04-27 10:47:29,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131216286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:29,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:29,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:47:29,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72323819] [2022-04-27 10:47:29,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:29,080 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-27 10:47:29,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:29,082 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-27 10:47:29,100 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-27 10:47:29,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:47:29,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:29,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:47:29,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:47:29,101 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-27 10:47:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:31,489 INFO L93 Difference]: Finished difference Result 501 states and 826 transitions. [2022-04-27 10:47:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:47:31,490 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-27 10:47:31,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:31,490 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-27 10:47:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-27 10:47:31,491 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-27 10:47:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-27 10:47:31,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 107 transitions. [2022-04-27 10:47:31,585 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-27 10:47:31,599 INFO L225 Difference]: With dead ends: 501 [2022-04-27 10:47:31,599 INFO L226 Difference]: Without dead ends: 499 [2022-04-27 10:47:31,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-27 10:47:31,600 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 80 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:31,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 61 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:47:31,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-27 10:47:32,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 441. [2022-04-27 10:47:32,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:32,998 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-27 10:47:32,998 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-27 10:47:32,998 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-27 10:47:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:33,014 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-27 10:47:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-27 10:47:33,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:33,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:33,016 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-27 10:47:33,017 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-27 10:47:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:33,033 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-27 10:47:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-27 10:47:33,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:33,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:33,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:33,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:33,035 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-27 10:47:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 726 transitions. [2022-04-27 10:47:33,051 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 726 transitions. Word has length 54 [2022-04-27 10:47:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:33,051 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 726 transitions. [2022-04-27 10:47:33,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 10:47:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 726 transitions. [2022-04-27 10:47:33,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-27 10:47:33,052 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:33,052 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:33,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 10:47:33,053 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:33,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:33,053 INFO L85 PathProgramCache]: Analyzing trace with hash -667500302, now seen corresponding path program 1 times [2022-04-27 10:47:33,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:33,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119156468] [2022-04-27 10:47:33,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:33,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:33,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:33,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {22613#(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); {22571#true} is VALID [2022-04-27 10:47:33,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22571#true} {22571#true} #138#return; {22571#true} is VALID [2022-04-27 10:47:33,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:33,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22571#true} {22577#(<= 2 main_~j~0)} #118#return; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:47:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:33,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22571#true} {22577#(<= 2 main_~j~0)} #120#return; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 10:47:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:33,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22571#true} {22577#(<= 2 main_~j~0)} #122#return; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-27 10:47:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:33,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22571#true} {22577#(<= 2 main_~j~0)} #124#return; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-27 10:47:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:33,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22571#true} {22577#(<= 2 main_~j~0)} #126#return; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 10:47:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:33,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22571#true} {22577#(<= 2 main_~j~0)} #128#return; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 10:47:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:33,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22571#true} {22602#(<= 2 main_~i~0)} #118#return; {22602#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:33,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-27 10:47:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:33,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22571#true} {22602#(<= 2 main_~i~0)} #120#return; {22602#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:33,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {22571#true} call ULTIMATE.init(); {22613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:33,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {22613#(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); {22571#true} is VALID [2022-04-27 10:47:33,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22571#true} {22571#true} #138#return; {22571#true} is VALID [2022-04-27 10:47:33,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {22571#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {22571#true} is VALID [2022-04-27 10:47:33,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {22571#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; {22571#true} is VALID [2022-04-27 10:47:33,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {22571#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; {22571#true} is VALID [2022-04-27 10:47:33,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {22571#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {22576#(<= 1 main_~l~0)} is VALID [2022-04-27 10:47:33,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {22576#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {22577#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {22577#(<= 2 main_~j~0)} assume !(~j~0 < ~r~0); {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,127 INFO L272 TraceCheckUtils]: 11: Hoare triple {22577#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {22571#true} is VALID [2022-04-27 10:47:33,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,127 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22571#true} {22577#(<= 2 main_~j~0)} #118#return; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,127 INFO L272 TraceCheckUtils]: 16: Hoare triple {22577#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {22571#true} is VALID [2022-04-27 10:47:33,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,128 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {22571#true} {22577#(<= 2 main_~j~0)} #120#return; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {22577#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {22577#(<= 2 main_~j~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,128 INFO L272 TraceCheckUtils]: 23: Hoare triple {22577#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {22571#true} is VALID [2022-04-27 10:47:33,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,129 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {22571#true} {22577#(<= 2 main_~j~0)} #122#return; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,129 INFO L272 TraceCheckUtils]: 28: Hoare triple {22577#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {22571#true} is VALID [2022-04-27 10:47:33,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,129 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {22571#true} {22577#(<= 2 main_~j~0)} #124#return; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,129 INFO L272 TraceCheckUtils]: 33: Hoare triple {22577#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {22571#true} is VALID [2022-04-27 10:47:33,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,130 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {22571#true} {22577#(<= 2 main_~j~0)} #126#return; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,130 INFO L272 TraceCheckUtils]: 38: Hoare triple {22577#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {22571#true} is VALID [2022-04-27 10:47:33,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,130 INFO L290 TraceCheckUtils]: 41: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,130 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {22571#true} {22577#(<= 2 main_~j~0)} #128#return; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {22577#(<= 2 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {22602#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:33,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {22602#(<= 2 main_~i~0)} assume !!(~j~0 <= ~r~0); {22602#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:33,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {22602#(<= 2 main_~i~0)} assume !(~j~0 < ~r~0); {22602#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:33,131 INFO L272 TraceCheckUtils]: 46: Hoare triple {22602#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {22571#true} is VALID [2022-04-27 10:47:33,131 INFO L290 TraceCheckUtils]: 47: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,131 INFO L290 TraceCheckUtils]: 48: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,132 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {22571#true} {22602#(<= 2 main_~i~0)} #118#return; {22602#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:33,132 INFO L272 TraceCheckUtils]: 51: Hoare triple {22602#(<= 2 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {22571#true} is VALID [2022-04-27 10:47:33,132 INFO L290 TraceCheckUtils]: 52: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,132 INFO L290 TraceCheckUtils]: 53: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,132 INFO L290 TraceCheckUtils]: 54: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,132 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22571#true} {22602#(<= 2 main_~i~0)} #120#return; {22602#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:33,133 INFO L290 TraceCheckUtils]: 56: Hoare triple {22602#(<= 2 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {22602#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:33,133 INFO L290 TraceCheckUtils]: 57: Hoare triple {22602#(<= 2 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {22602#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:33,133 INFO L272 TraceCheckUtils]: 58: Hoare triple {22602#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {22611#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:33,134 INFO L290 TraceCheckUtils]: 59: Hoare triple {22611#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {22612#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:33,134 INFO L290 TraceCheckUtils]: 60: Hoare triple {22612#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {22572#false} is VALID [2022-04-27 10:47:33,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {22572#false} assume !false; {22572#false} is VALID [2022-04-27 10:47:33,134 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-27 10:47:33,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:33,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119156468] [2022-04-27 10:47:33,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119156468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:47:33,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663715150] [2022-04-27 10:47:33,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:33,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:33,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:47:33,136 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:47:33,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:47:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:33,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:47:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:33,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:47:33,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {22571#true} call ULTIMATE.init(); {22571#true} is VALID [2022-04-27 10:47:33,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {22571#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); {22571#true} is VALID [2022-04-27 10:47:33,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22571#true} {22571#true} #138#return; {22571#true} is VALID [2022-04-27 10:47:33,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {22571#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {22571#true} is VALID [2022-04-27 10:47:33,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {22571#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; {22571#true} is VALID [2022-04-27 10:47:33,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {22571#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; {22571#true} is VALID [2022-04-27 10:47:33,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {22571#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {22576#(<= 1 main_~l~0)} is VALID [2022-04-27 10:47:33,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {22576#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {22577#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {22577#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:33,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {22577#(<= 2 main_~j~0)} assume !(~j~0 < ~r~0); {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-27 10:47:33,785 INFO L272 TraceCheckUtils]: 11: Hoare triple {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {22571#true} is VALID [2022-04-27 10:47:33,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,785 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22571#true} {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} #118#return; {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-27 10:47:33,785 INFO L272 TraceCheckUtils]: 16: Hoare triple {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {22571#true} is VALID [2022-04-27 10:47:33,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,786 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {22571#true} {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} #120#return; {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-27 10:47:33,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-27 10:47:33,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-27 10:47:33,787 INFO L272 TraceCheckUtils]: 23: Hoare triple {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {22571#true} is VALID [2022-04-27 10:47:33,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,787 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {22571#true} {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} #122#return; {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-27 10:47:33,787 INFO L272 TraceCheckUtils]: 28: Hoare triple {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {22571#true} is VALID [2022-04-27 10:47:33,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,788 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {22571#true} {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} #124#return; {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-27 10:47:33,788 INFO L272 TraceCheckUtils]: 33: Hoare triple {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {22571#true} is VALID [2022-04-27 10:47:33,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,789 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {22571#true} {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} #126#return; {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-27 10:47:33,789 INFO L272 TraceCheckUtils]: 38: Hoare triple {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {22571#true} is VALID [2022-04-27 10:47:33,789 INFO L290 TraceCheckUtils]: 39: Hoare triple {22571#true} ~cond := #in~cond; {22571#true} is VALID [2022-04-27 10:47:33,789 INFO L290 TraceCheckUtils]: 40: Hoare triple {22571#true} assume !(0 == ~cond); {22571#true} is VALID [2022-04-27 10:47:33,789 INFO L290 TraceCheckUtils]: 41: Hoare triple {22571#true} assume true; {22571#true} is VALID [2022-04-27 10:47:33,789 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {22571#true} {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} #128#return; {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-27 10:47:33,790 INFO L290 TraceCheckUtils]: 43: Hoare triple {22647#(and (<= 2 main_~j~0) (not (< main_~j~0 main_~r~0)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {22747#(and (<= 2 (div main_~j~0 2)) (<= main_~r~0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:33,790 INFO L290 TraceCheckUtils]: 44: Hoare triple {22747#(and (<= 2 (div main_~j~0 2)) (<= main_~r~0 (div main_~j~0 2)))} assume !!(~j~0 <= ~r~0); {22572#false} is VALID [2022-04-27 10:47:33,790 INFO L290 TraceCheckUtils]: 45: Hoare triple {22572#false} assume !(~j~0 < ~r~0); {22572#false} is VALID [2022-04-27 10:47:33,790 INFO L272 TraceCheckUtils]: 46: Hoare triple {22572#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {22572#false} is VALID [2022-04-27 10:47:33,790 INFO L290 TraceCheckUtils]: 47: Hoare triple {22572#false} ~cond := #in~cond; {22572#false} is VALID [2022-04-27 10:47:33,790 INFO L290 TraceCheckUtils]: 48: Hoare triple {22572#false} assume !(0 == ~cond); {22572#false} is VALID [2022-04-27 10:47:33,791 INFO L290 TraceCheckUtils]: 49: Hoare triple {22572#false} assume true; {22572#false} is VALID [2022-04-27 10:47:33,791 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {22572#false} {22572#false} #118#return; {22572#false} is VALID [2022-04-27 10:47:33,791 INFO L272 TraceCheckUtils]: 51: Hoare triple {22572#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {22572#false} is VALID [2022-04-27 10:47:33,791 INFO L290 TraceCheckUtils]: 52: Hoare triple {22572#false} ~cond := #in~cond; {22572#false} is VALID [2022-04-27 10:47:33,791 INFO L290 TraceCheckUtils]: 53: Hoare triple {22572#false} assume !(0 == ~cond); {22572#false} is VALID [2022-04-27 10:47:33,791 INFO L290 TraceCheckUtils]: 54: Hoare triple {22572#false} assume true; {22572#false} is VALID [2022-04-27 10:47:33,791 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22572#false} {22572#false} #120#return; {22572#false} is VALID [2022-04-27 10:47:33,791 INFO L290 TraceCheckUtils]: 56: Hoare triple {22572#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {22572#false} is VALID [2022-04-27 10:47:33,791 INFO L290 TraceCheckUtils]: 57: Hoare triple {22572#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {22572#false} is VALID [2022-04-27 10:47:33,791 INFO L272 TraceCheckUtils]: 58: Hoare triple {22572#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {22572#false} is VALID [2022-04-27 10:47:33,791 INFO L290 TraceCheckUtils]: 59: Hoare triple {22572#false} ~cond := #in~cond; {22572#false} is VALID [2022-04-27 10:47:33,791 INFO L290 TraceCheckUtils]: 60: Hoare triple {22572#false} assume 0 == ~cond; {22572#false} is VALID [2022-04-27 10:47:33,791 INFO L290 TraceCheckUtils]: 61: Hoare triple {22572#false} assume !false; {22572#false} is VALID [2022-04-27 10:47:33,792 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-27 10:47:33,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:47:33,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663715150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:33,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:47:33,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2022-04-27 10:47:33,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735802031] [2022-04-27 10:47:33,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:33,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-27 10:47:33,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:33,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-27 10:47:33,817 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-27 10:47:33,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:47:33,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:33,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:47:33,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:47:33,818 INFO L87 Difference]: Start difference. First operand 441 states and 726 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-27 10:47:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:36,124 INFO L93 Difference]: Finished difference Result 888 states and 1455 transitions. [2022-04-27 10:47:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:47:36,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-27 10:47:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-27 10:47:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 199 transitions. [2022-04-27 10:47:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-27 10:47:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 199 transitions. [2022-04-27 10:47:36,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 199 transitions. [2022-04-27 10:47:36,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:36,271 INFO L225 Difference]: With dead ends: 888 [2022-04-27 10:47:36,271 INFO L226 Difference]: Without dead ends: 482 [2022-04-27 10:47:36,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:47:36,273 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 36 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:36,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 215 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:47:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-04-27 10:47:37,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 447. [2022-04-27 10:47:37,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:37,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 482 states. Second operand has 447 states, 197 states have (on average 1.365482233502538) internal successors, (269), 221 states have internal predecessors, (269), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 207 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-27 10:47:37,791 INFO L74 IsIncluded]: Start isIncluded. First operand 482 states. Second operand has 447 states, 197 states have (on average 1.365482233502538) internal successors, (269), 221 states have internal predecessors, (269), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 207 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-27 10:47:37,791 INFO L87 Difference]: Start difference. First operand 482 states. Second operand has 447 states, 197 states have (on average 1.365482233502538) internal successors, (269), 221 states have internal predecessors, (269), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 207 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-27 10:47:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:37,805 INFO L93 Difference]: Finished difference Result 482 states and 783 transitions. [2022-04-27 10:47:37,805 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 783 transitions. [2022-04-27 10:47:37,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:37,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:37,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 197 states have (on average 1.365482233502538) internal successors, (269), 221 states have internal predecessors, (269), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 207 states have call predecessors, (231), 231 states have call successors, (231) Second operand 482 states. [2022-04-27 10:47:37,808 INFO L87 Difference]: Start difference. First operand has 447 states, 197 states have (on average 1.365482233502538) internal successors, (269), 221 states have internal predecessors, (269), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 207 states have call predecessors, (231), 231 states have call successors, (231) Second operand 482 states. [2022-04-27 10:47:37,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:37,823 INFO L93 Difference]: Finished difference Result 482 states and 783 transitions. [2022-04-27 10:47:37,823 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 783 transitions. [2022-04-27 10:47:37,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:37,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:37,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:37,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 197 states have (on average 1.365482233502538) internal successors, (269), 221 states have internal predecessors, (269), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 207 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-27 10:47:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 732 transitions. [2022-04-27 10:47:37,841 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 732 transitions. Word has length 62 [2022-04-27 10:47:37,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:37,841 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 732 transitions. [2022-04-27 10:47:37,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-27 10:47:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 732 transitions. [2022-04-27 10:47:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 10:47:37,842 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:37,842 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:37,861 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-27 10:47:38,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 10:47:38,053 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:38,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:38,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1858540084, now seen corresponding path program 1 times [2022-04-27 10:47:38,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:38,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277157874] [2022-04-27 10:47:38,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:38,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {25950#(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); {25891#true} is VALID [2022-04-27 10:47:38,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25891#true} {25891#true} #138#return; {25891#true} is VALID [2022-04-27 10:47:38,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25891#true} {25897#(<= 2 main_~j~0)} #110#return; {25897#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:38,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:47:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25891#true} {25897#(<= 2 main_~j~0)} #112#return; {25897#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:38,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-27 10:47:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25891#true} {25897#(<= 2 main_~j~0)} #114#return; {25897#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:38,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 10:47:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25891#true} {25897#(<= 2 main_~j~0)} #116#return; {25897#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:38,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-27 10:47:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25891#true} {25914#(<= 3 main_~j~0)} #118#return; {25914#(<= 3 main_~j~0)} is VALID [2022-04-27 10:47:38,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 10:47:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25891#true} {25914#(<= 3 main_~j~0)} #120#return; {25914#(<= 3 main_~j~0)} is VALID [2022-04-27 10:47:38,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-27 10:47:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25891#true} {25914#(<= 3 main_~j~0)} #122#return; {25914#(<= 3 main_~j~0)} is VALID [2022-04-27 10:47:38,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-27 10:47:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25891#true} {25914#(<= 3 main_~j~0)} #124#return; {25914#(<= 3 main_~j~0)} is VALID [2022-04-27 10:47:38,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-27 10:47:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25891#true} {25914#(<= 3 main_~j~0)} #126#return; {25914#(<= 3 main_~j~0)} is VALID [2022-04-27 10:47:38,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-27 10:47:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25891#true} {25914#(<= 3 main_~j~0)} #128#return; {25914#(<= 3 main_~j~0)} is VALID [2022-04-27 10:47:38,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-27 10:47:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25891#true} {25939#(<= 3 main_~i~0)} #118#return; {25939#(<= 3 main_~i~0)} is VALID [2022-04-27 10:47:38,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-27 10:47:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25891#true} {25939#(<= 3 main_~i~0)} #120#return; {25939#(<= 3 main_~i~0)} is VALID [2022-04-27 10:47:38,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {25891#true} call ULTIMATE.init(); {25950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:38,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {25950#(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); {25891#true} is VALID [2022-04-27 10:47:38,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25891#true} {25891#true} #138#return; {25891#true} is VALID [2022-04-27 10:47:38,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {25891#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {25891#true} is VALID [2022-04-27 10:47:38,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {25891#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; {25891#true} is VALID [2022-04-27 10:47:38,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {25891#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; {25891#true} is VALID [2022-04-27 10:47:38,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {25891#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {25896#(<= 1 main_~l~0)} is VALID [2022-04-27 10:47:38,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {25896#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {25897#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:38,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {25897#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {25897#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:38,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {25897#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {25897#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:38,204 INFO L272 TraceCheckUtils]: 11: Hoare triple {25897#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {25891#true} is VALID [2022-04-27 10:47:38,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,205 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {25891#true} {25897#(<= 2 main_~j~0)} #110#return; {25897#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:38,205 INFO L272 TraceCheckUtils]: 16: Hoare triple {25897#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {25891#true} is VALID [2022-04-27 10:47:38,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,206 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {25891#true} {25897#(<= 2 main_~j~0)} #112#return; {25897#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:38,206 INFO L272 TraceCheckUtils]: 21: Hoare triple {25897#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {25891#true} is VALID [2022-04-27 10:47:38,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,206 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25891#true} {25897#(<= 2 main_~j~0)} #114#return; {25897#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:38,206 INFO L272 TraceCheckUtils]: 26: Hoare triple {25897#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {25891#true} is VALID [2022-04-27 10:47:38,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,207 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {25891#true} {25897#(<= 2 main_~j~0)} #116#return; {25897#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:38,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {25897#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {25897#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:38,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {25897#(<= 2 main_~j~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {25914#(<= 3 main_~j~0)} is VALID [2022-04-27 10:47:38,208 INFO L272 TraceCheckUtils]: 33: Hoare triple {25914#(<= 3 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {25891#true} is VALID [2022-04-27 10:47:38,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,208 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25891#true} {25914#(<= 3 main_~j~0)} #118#return; {25914#(<= 3 main_~j~0)} is VALID [2022-04-27 10:47:38,208 INFO L272 TraceCheckUtils]: 38: Hoare triple {25914#(<= 3 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {25891#true} is VALID [2022-04-27 10:47:38,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,208 INFO L290 TraceCheckUtils]: 41: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,209 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {25891#true} {25914#(<= 3 main_~j~0)} #120#return; {25914#(<= 3 main_~j~0)} is VALID [2022-04-27 10:47:38,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {25914#(<= 3 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {25914#(<= 3 main_~j~0)} is VALID [2022-04-27 10:47:38,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {25914#(<= 3 main_~j~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {25914#(<= 3 main_~j~0)} is VALID [2022-04-27 10:47:38,209 INFO L272 TraceCheckUtils]: 45: Hoare triple {25914#(<= 3 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {25891#true} is VALID [2022-04-27 10:47:38,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,210 INFO L290 TraceCheckUtils]: 48: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,210 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {25891#true} {25914#(<= 3 main_~j~0)} #122#return; {25914#(<= 3 main_~j~0)} is VALID [2022-04-27 10:47:38,210 INFO L272 TraceCheckUtils]: 50: Hoare triple {25914#(<= 3 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {25891#true} is VALID [2022-04-27 10:47:38,210 INFO L290 TraceCheckUtils]: 51: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,210 INFO L290 TraceCheckUtils]: 52: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,210 INFO L290 TraceCheckUtils]: 53: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,211 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {25891#true} {25914#(<= 3 main_~j~0)} #124#return; {25914#(<= 3 main_~j~0)} is VALID [2022-04-27 10:47:38,211 INFO L272 TraceCheckUtils]: 55: Hoare triple {25914#(<= 3 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {25891#true} is VALID [2022-04-27 10:47:38,211 INFO L290 TraceCheckUtils]: 56: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,211 INFO L290 TraceCheckUtils]: 57: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,211 INFO L290 TraceCheckUtils]: 58: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,211 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25891#true} {25914#(<= 3 main_~j~0)} #126#return; {25914#(<= 3 main_~j~0)} is VALID [2022-04-27 10:47:38,211 INFO L272 TraceCheckUtils]: 60: Hoare triple {25914#(<= 3 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {25891#true} is VALID [2022-04-27 10:47:38,211 INFO L290 TraceCheckUtils]: 61: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,211 INFO L290 TraceCheckUtils]: 62: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,211 INFO L290 TraceCheckUtils]: 63: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,212 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25891#true} {25914#(<= 3 main_~j~0)} #128#return; {25914#(<= 3 main_~j~0)} is VALID [2022-04-27 10:47:38,212 INFO L290 TraceCheckUtils]: 65: Hoare triple {25914#(<= 3 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {25939#(<= 3 main_~i~0)} is VALID [2022-04-27 10:47:38,212 INFO L290 TraceCheckUtils]: 66: Hoare triple {25939#(<= 3 main_~i~0)} assume !!(~j~0 <= ~r~0); {25939#(<= 3 main_~i~0)} is VALID [2022-04-27 10:47:38,213 INFO L290 TraceCheckUtils]: 67: Hoare triple {25939#(<= 3 main_~i~0)} assume !(~j~0 < ~r~0); {25939#(<= 3 main_~i~0)} is VALID [2022-04-27 10:47:38,213 INFO L272 TraceCheckUtils]: 68: Hoare triple {25939#(<= 3 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {25891#true} is VALID [2022-04-27 10:47:38,213 INFO L290 TraceCheckUtils]: 69: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,213 INFO L290 TraceCheckUtils]: 70: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,213 INFO L290 TraceCheckUtils]: 71: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,213 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {25891#true} {25939#(<= 3 main_~i~0)} #118#return; {25939#(<= 3 main_~i~0)} is VALID [2022-04-27 10:47:38,213 INFO L272 TraceCheckUtils]: 73: Hoare triple {25939#(<= 3 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {25891#true} is VALID [2022-04-27 10:47:38,213 INFO L290 TraceCheckUtils]: 74: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:38,214 INFO L290 TraceCheckUtils]: 75: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:38,214 INFO L290 TraceCheckUtils]: 76: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:38,214 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {25891#true} {25939#(<= 3 main_~i~0)} #120#return; {25939#(<= 3 main_~i~0)} is VALID [2022-04-27 10:47:38,214 INFO L290 TraceCheckUtils]: 78: Hoare triple {25939#(<= 3 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {25939#(<= 3 main_~i~0)} is VALID [2022-04-27 10:47:38,214 INFO L290 TraceCheckUtils]: 79: Hoare triple {25939#(<= 3 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {25939#(<= 3 main_~i~0)} is VALID [2022-04-27 10:47:38,215 INFO L272 TraceCheckUtils]: 80: Hoare triple {25939#(<= 3 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {25948#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:38,215 INFO L290 TraceCheckUtils]: 81: Hoare triple {25948#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {25949#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:38,215 INFO L290 TraceCheckUtils]: 82: Hoare triple {25949#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25892#false} is VALID [2022-04-27 10:47:38,216 INFO L290 TraceCheckUtils]: 83: Hoare triple {25892#false} assume !false; {25892#false} is VALID [2022-04-27 10:47:38,216 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-27 10:47:38,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:38,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277157874] [2022-04-27 10:47:38,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277157874] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:47:38,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231878012] [2022-04-27 10:47:38,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:38,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:38,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:47:38,217 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:47:38,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:47:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 10:47:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:47:43,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {25891#true} call ULTIMATE.init(); {25891#true} is VALID [2022-04-27 10:47:43,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {25891#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); {25891#true} is VALID [2022-04-27 10:47:43,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:43,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25891#true} {25891#true} #138#return; {25891#true} is VALID [2022-04-27 10:47:43,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {25891#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {25891#true} is VALID [2022-04-27 10:47:43,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {25891#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; {25891#true} is VALID [2022-04-27 10:47:43,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {25891#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; {25972#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) main_~l~0))} is VALID [2022-04-27 10:47:43,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {25972#(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; {25976#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:47:43,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {25976#(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; {25980#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:43,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {25980#(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); {25980#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:43,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {25980#(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; {25980#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:43,171 INFO L272 TraceCheckUtils]: 11: Hoare triple {25980#(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)); {25891#true} is VALID [2022-04-27 10:47:43,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:43,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:43,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:43,172 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {25891#true} {25980#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #110#return; {25980#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:43,172 INFO L272 TraceCheckUtils]: 16: Hoare triple {25980#(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)); {25891#true} is VALID [2022-04-27 10:47:43,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:43,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:43,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:43,173 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {25891#true} {25980#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #112#return; {25980#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:43,173 INFO L272 TraceCheckUtils]: 21: Hoare triple {25980#(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)); {25891#true} is VALID [2022-04-27 10:47:43,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:43,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:43,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:43,173 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25891#true} {25980#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #114#return; {25980#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:43,173 INFO L272 TraceCheckUtils]: 26: Hoare triple {25980#(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)); {25891#true} is VALID [2022-04-27 10:47:43,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:43,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:43,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:43,174 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {25891#true} {25980#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #116#return; {25980#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:43,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {25980#(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; {25980#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:43,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {25980#(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;~j~0 := 1 + ~j~0; {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-27 10:47:43,175 INFO L272 TraceCheckUtils]: 33: Hoare triple {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (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)); {25891#true} is VALID [2022-04-27 10:47:43,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:43,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:43,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:43,176 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25891#true} {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #118#return; {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-27 10:47:43,176 INFO L272 TraceCheckUtils]: 38: Hoare triple {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (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)); {25891#true} is VALID [2022-04-27 10:47:43,176 INFO L290 TraceCheckUtils]: 39: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:43,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:43,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:43,176 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {25891#true} {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #120#return; {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-27 10:47:43,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-27 10:47:43,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-27 10:47:43,177 INFO L272 TraceCheckUtils]: 45: Hoare triple {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (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)); {25891#true} is VALID [2022-04-27 10:47:43,178 INFO L290 TraceCheckUtils]: 46: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:43,178 INFO L290 TraceCheckUtils]: 47: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:43,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:43,178 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {25891#true} {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #122#return; {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-27 10:47:43,178 INFO L272 TraceCheckUtils]: 50: Hoare triple {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (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)); {25891#true} is VALID [2022-04-27 10:47:43,178 INFO L290 TraceCheckUtils]: 51: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:43,178 INFO L290 TraceCheckUtils]: 52: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:43,178 INFO L290 TraceCheckUtils]: 53: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:43,179 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {25891#true} {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #124#return; {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-27 10:47:43,179 INFO L272 TraceCheckUtils]: 55: Hoare triple {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (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)); {25891#true} is VALID [2022-04-27 10:47:43,179 INFO L290 TraceCheckUtils]: 56: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:43,179 INFO L290 TraceCheckUtils]: 57: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:43,179 INFO L290 TraceCheckUtils]: 58: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:43,180 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25891#true} {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #126#return; {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-27 10:47:43,180 INFO L272 TraceCheckUtils]: 60: Hoare triple {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (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)); {25891#true} is VALID [2022-04-27 10:47:43,180 INFO L290 TraceCheckUtils]: 61: Hoare triple {25891#true} ~cond := #in~cond; {25891#true} is VALID [2022-04-27 10:47:43,180 INFO L290 TraceCheckUtils]: 62: Hoare triple {25891#true} assume !(0 == ~cond); {25891#true} is VALID [2022-04-27 10:47:43,180 INFO L290 TraceCheckUtils]: 63: Hoare triple {25891#true} assume true; {25891#true} is VALID [2022-04-27 10:47:43,180 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25891#true} {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #128#return; {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-27 10:47:43,181 INFO L290 TraceCheckUtils]: 65: Hoare triple {26053#(and (< 0 (div (+ (- 1) main_~j~0) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {26153#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< 0 (div (div (+ (- 2) main_~j~0) 2) 2)))} is VALID [2022-04-27 10:47:43,182 INFO L290 TraceCheckUtils]: 66: Hoare triple {26153#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< 0 (div (div (+ (- 2) main_~j~0) 2) 2)))} assume !!(~j~0 <= ~r~0); {25892#false} is VALID [2022-04-27 10:47:43,182 INFO L290 TraceCheckUtils]: 67: Hoare triple {25892#false} assume !(~j~0 < ~r~0); {25892#false} is VALID [2022-04-27 10:47:43,182 INFO L272 TraceCheckUtils]: 68: Hoare triple {25892#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {25892#false} is VALID [2022-04-27 10:47:43,182 INFO L290 TraceCheckUtils]: 69: Hoare triple {25892#false} ~cond := #in~cond; {25892#false} is VALID [2022-04-27 10:47:43,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {25892#false} assume !(0 == ~cond); {25892#false} is VALID [2022-04-27 10:47:43,182 INFO L290 TraceCheckUtils]: 71: Hoare triple {25892#false} assume true; {25892#false} is VALID [2022-04-27 10:47:43,182 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {25892#false} {25892#false} #118#return; {25892#false} is VALID [2022-04-27 10:47:43,182 INFO L272 TraceCheckUtils]: 73: Hoare triple {25892#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {25892#false} is VALID [2022-04-27 10:47:43,182 INFO L290 TraceCheckUtils]: 74: Hoare triple {25892#false} ~cond := #in~cond; {25892#false} is VALID [2022-04-27 10:47:43,182 INFO L290 TraceCheckUtils]: 75: Hoare triple {25892#false} assume !(0 == ~cond); {25892#false} is VALID [2022-04-27 10:47:43,182 INFO L290 TraceCheckUtils]: 76: Hoare triple {25892#false} assume true; {25892#false} is VALID [2022-04-27 10:47:43,182 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {25892#false} {25892#false} #120#return; {25892#false} is VALID [2022-04-27 10:47:43,183 INFO L290 TraceCheckUtils]: 78: Hoare triple {25892#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {25892#false} is VALID [2022-04-27 10:47:43,183 INFO L290 TraceCheckUtils]: 79: Hoare triple {25892#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {25892#false} is VALID [2022-04-27 10:47:43,183 INFO L272 TraceCheckUtils]: 80: Hoare triple {25892#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {25892#false} is VALID [2022-04-27 10:47:43,183 INFO L290 TraceCheckUtils]: 81: Hoare triple {25892#false} ~cond := #in~cond; {25892#false} is VALID [2022-04-27 10:47:43,183 INFO L290 TraceCheckUtils]: 82: Hoare triple {25892#false} assume 0 == ~cond; {25892#false} is VALID [2022-04-27 10:47:43,183 INFO L290 TraceCheckUtils]: 83: Hoare triple {25892#false} assume !false; {25892#false} is VALID [2022-04-27 10:47:43,183 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-27 10:47:43,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:47:43,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231878012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:43,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:47:43,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2022-04-27 10:47:43,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375391006] [2022-04-27 10:47:43,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:43,185 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-27 10:47:43,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:43,185 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-27 10:47:43,227 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-27 10:47:43,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:47:43,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:47:43,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:47:43,228 INFO L87 Difference]: Start difference. First operand 447 states and 732 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-27 10:47:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:45,551 INFO L93 Difference]: Finished difference Result 816 states and 1313 transitions. [2022-04-27 10:47:45,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 10:47:45,551 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-27 10:47:45,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:45,551 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-27 10:47:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2022-04-27 10:47:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 10:47:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2022-04-27 10:47:45,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 239 transitions. [2022-04-27 10:47:45,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:45,749 INFO L225 Difference]: With dead ends: 816 [2022-04-27 10:47:45,749 INFO L226 Difference]: Without dead ends: 377 [2022-04-27 10:47:45,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-04-27 10:47:45,752 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 48 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:45,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 212 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:47:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-27 10:47:46,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 341. [2022-04-27 10:47:46,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:46,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 341 states, 156 states have (on average 1.3269230769230769) internal successors, (207), 172 states have internal predecessors, (207), 168 states have call successors, (168), 17 states have call predecessors, (168), 16 states have return successors, (167), 151 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 10:47:46,968 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 341 states, 156 states have (on average 1.3269230769230769) internal successors, (207), 172 states have internal predecessors, (207), 168 states have call successors, (168), 17 states have call predecessors, (168), 16 states have return successors, (167), 151 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 10:47:46,969 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 341 states, 156 states have (on average 1.3269230769230769) internal successors, (207), 172 states have internal predecessors, (207), 168 states have call successors, (168), 17 states have call predecessors, (168), 16 states have return successors, (167), 151 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 10:47:46,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:46,977 INFO L93 Difference]: Finished difference Result 377 states and 594 transitions. [2022-04-27 10:47:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 594 transitions. [2022-04-27 10:47:46,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:46,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:46,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 341 states, 156 states have (on average 1.3269230769230769) internal successors, (207), 172 states have internal predecessors, (207), 168 states have call successors, (168), 17 states have call predecessors, (168), 16 states have return successors, (167), 151 states have call predecessors, (167), 167 states have call successors, (167) Second operand 377 states. [2022-04-27 10:47:46,979 INFO L87 Difference]: Start difference. First operand has 341 states, 156 states have (on average 1.3269230769230769) internal successors, (207), 172 states have internal predecessors, (207), 168 states have call successors, (168), 17 states have call predecessors, (168), 16 states have return successors, (167), 151 states have call predecessors, (167), 167 states have call successors, (167) Second operand 377 states. [2022-04-27 10:47:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:46,988 INFO L93 Difference]: Finished difference Result 377 states and 594 transitions. [2022-04-27 10:47:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 594 transitions. [2022-04-27 10:47:46,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:46,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:46,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:46,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:46,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 156 states have (on average 1.3269230769230769) internal successors, (207), 172 states have internal predecessors, (207), 168 states have call successors, (168), 17 states have call predecessors, (168), 16 states have return successors, (167), 151 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 10:47:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 542 transitions. [2022-04-27 10:47:46,998 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 542 transitions. Word has length 84 [2022-04-27 10:47:46,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:46,999 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 542 transitions. [2022-04-27 10:47:46,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 10:47:46,999 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 542 transitions. [2022-04-27 10:47:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 10:47:46,999 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:47,000 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:47,020 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-27 10:47:47,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 10:47:47,218 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:47,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:47,219 INFO L85 PathProgramCache]: Analyzing trace with hash -898087182, now seen corresponding path program 1 times [2022-04-27 10:47:47,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:47,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484761268] [2022-04-27 10:47:47,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:47,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {28855#(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); {28797#true} is VALID [2022-04-27 10:47:47,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28797#true} {28797#true} #138#return; {28797#true} is VALID [2022-04-27 10:47:47,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #110#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:47:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #112#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-27 10:47:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #114#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 10:47:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #116#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-27 10:47:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #118#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 10:47:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #120#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-27 10:47:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #122#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-27 10:47:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #124#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-27 10:47:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #126#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-27 10:47:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #128#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-27 10:47:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28844#(<= 2 main_~i~0)} #118#return; {28844#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:47,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-27 10:47:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28844#(<= 2 main_~i~0)} #120#return; {28844#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:47,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {28797#true} call ULTIMATE.init(); {28855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:47,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {28855#(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); {28797#true} is VALID [2022-04-27 10:47:47,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28797#true} #138#return; {28797#true} is VALID [2022-04-27 10:47:47,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {28797#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {28797#true} is VALID [2022-04-27 10:47:47,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {28797#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; {28797#true} is VALID [2022-04-27 10:47:47,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {28797#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; {28797#true} is VALID [2022-04-27 10:47:47,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {28797#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {28802#(<= 1 main_~l~0)} is VALID [2022-04-27 10:47:47,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {28802#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {28803#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {28803#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,324 INFO L272 TraceCheckUtils]: 11: Hoare triple {28803#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {28797#true} is VALID [2022-04-27 10:47:47,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,324 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #110#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,324 INFO L272 TraceCheckUtils]: 16: Hoare triple {28803#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {28797#true} is VALID [2022-04-27 10:47:47,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,325 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #112#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,325 INFO L272 TraceCheckUtils]: 21: Hoare triple {28803#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {28797#true} is VALID [2022-04-27 10:47:47,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,325 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #114#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,325 INFO L272 TraceCheckUtils]: 26: Hoare triple {28803#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {28797#true} is VALID [2022-04-27 10:47:47,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,326 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #116#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {28803#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {28803#(<= 2 main_~j~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,326 INFO L272 TraceCheckUtils]: 33: Hoare triple {28803#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {28797#true} is VALID [2022-04-27 10:47:47,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,327 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #118#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,327 INFO L272 TraceCheckUtils]: 38: Hoare triple {28803#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {28797#true} is VALID [2022-04-27 10:47:47,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,328 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #120#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,328 INFO L290 TraceCheckUtils]: 43: Hoare triple {28803#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,328 INFO L290 TraceCheckUtils]: 44: Hoare triple {28803#(<= 2 main_~j~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,328 INFO L272 TraceCheckUtils]: 45: Hoare triple {28803#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {28797#true} is VALID [2022-04-27 10:47:47,328 INFO L290 TraceCheckUtils]: 46: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,328 INFO L290 TraceCheckUtils]: 47: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,328 INFO L290 TraceCheckUtils]: 48: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,329 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #122#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,329 INFO L272 TraceCheckUtils]: 50: Hoare triple {28803#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {28797#true} is VALID [2022-04-27 10:47:47,329 INFO L290 TraceCheckUtils]: 51: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,329 INFO L290 TraceCheckUtils]: 52: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,329 INFO L290 TraceCheckUtils]: 53: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,329 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #124#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,329 INFO L272 TraceCheckUtils]: 55: Hoare triple {28803#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {28797#true} is VALID [2022-04-27 10:47:47,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,330 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #126#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,330 INFO L272 TraceCheckUtils]: 60: Hoare triple {28803#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {28797#true} is VALID [2022-04-27 10:47:47,330 INFO L290 TraceCheckUtils]: 61: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,330 INFO L290 TraceCheckUtils]: 62: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,330 INFO L290 TraceCheckUtils]: 63: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,330 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {28797#true} {28803#(<= 2 main_~j~0)} #128#return; {28803#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:47,331 INFO L290 TraceCheckUtils]: 65: Hoare triple {28803#(<= 2 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {28844#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:47,331 INFO L290 TraceCheckUtils]: 66: Hoare triple {28844#(<= 2 main_~i~0)} assume !!(~j~0 <= ~r~0); {28844#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:47,331 INFO L290 TraceCheckUtils]: 67: Hoare triple {28844#(<= 2 main_~i~0)} assume !(~j~0 < ~r~0); {28844#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:47,331 INFO L272 TraceCheckUtils]: 68: Hoare triple {28844#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {28797#true} is VALID [2022-04-27 10:47:47,331 INFO L290 TraceCheckUtils]: 69: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,332 INFO L290 TraceCheckUtils]: 70: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,332 INFO L290 TraceCheckUtils]: 71: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,332 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {28797#true} {28844#(<= 2 main_~i~0)} #118#return; {28844#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:47,332 INFO L272 TraceCheckUtils]: 73: Hoare triple {28844#(<= 2 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {28797#true} is VALID [2022-04-27 10:47:47,332 INFO L290 TraceCheckUtils]: 74: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:47,332 INFO L290 TraceCheckUtils]: 75: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:47,332 INFO L290 TraceCheckUtils]: 76: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:47,333 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {28797#true} {28844#(<= 2 main_~i~0)} #120#return; {28844#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:47,333 INFO L290 TraceCheckUtils]: 78: Hoare triple {28844#(<= 2 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {28844#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:47,333 INFO L290 TraceCheckUtils]: 79: Hoare triple {28844#(<= 2 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {28844#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:47,333 INFO L272 TraceCheckUtils]: 80: Hoare triple {28844#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {28853#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:47,334 INFO L290 TraceCheckUtils]: 81: Hoare triple {28853#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {28854#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:47,334 INFO L290 TraceCheckUtils]: 82: Hoare triple {28854#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28798#false} is VALID [2022-04-27 10:47:47,334 INFO L290 TraceCheckUtils]: 83: Hoare triple {28798#false} assume !false; {28798#false} is VALID [2022-04-27 10:47:47,334 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-27 10:47:47,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:47,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484761268] [2022-04-27 10:47:47,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484761268] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:47:47,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75274660] [2022-04-27 10:47:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:47,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:47,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:47:47,342 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:47:47,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 10:47:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:47:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:47,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:47:51,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {28797#true} call ULTIMATE.init(); {28797#true} is VALID [2022-04-27 10:47:51,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {28797#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); {28797#true} is VALID [2022-04-27 10:47:51,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:51,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28797#true} {28797#true} #138#return; {28797#true} is VALID [2022-04-27 10:47:51,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {28797#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {28797#true} is VALID [2022-04-27 10:47:51,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {28797#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; {28797#true} is VALID [2022-04-27 10:47:51,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {28797#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; {28877#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) main_~l~0))} is VALID [2022-04-27 10:47:51,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {28877#(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; {28881#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:47:51,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {28881#(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; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {28885#(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); {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {28885#(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; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,853 INFO L272 TraceCheckUtils]: 11: Hoare triple {28885#(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)); {28797#true} is VALID [2022-04-27 10:47:51,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:51,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:51,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:51,854 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28797#true} {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #110#return; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,854 INFO L272 TraceCheckUtils]: 16: Hoare triple {28885#(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)); {28797#true} is VALID [2022-04-27 10:47:51,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:51,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:51,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:51,854 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {28797#true} {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #112#return; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,854 INFO L272 TraceCheckUtils]: 21: Hoare triple {28885#(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)); {28797#true} is VALID [2022-04-27 10:47:51,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:51,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:51,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:51,855 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {28797#true} {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #114#return; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,855 INFO L272 TraceCheckUtils]: 26: Hoare triple {28885#(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)); {28797#true} is VALID [2022-04-27 10:47:51,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:51,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:51,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:51,856 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {28797#true} {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #116#return; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {28885#(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; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {28885#(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; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,857 INFO L272 TraceCheckUtils]: 33: Hoare triple {28885#(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)); {28797#true} is VALID [2022-04-27 10:47:51,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:51,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:51,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:51,857 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {28797#true} {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #118#return; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,857 INFO L272 TraceCheckUtils]: 38: Hoare triple {28885#(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)); {28797#true} is VALID [2022-04-27 10:47:51,857 INFO L290 TraceCheckUtils]: 39: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:51,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:51,857 INFO L290 TraceCheckUtils]: 41: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:51,858 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {28797#true} {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #120#return; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,858 INFO L290 TraceCheckUtils]: 43: Hoare triple {28885#(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; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {28885#(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; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,859 INFO L272 TraceCheckUtils]: 45: Hoare triple {28885#(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)); {28797#true} is VALID [2022-04-27 10:47:51,859 INFO L290 TraceCheckUtils]: 46: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:51,859 INFO L290 TraceCheckUtils]: 47: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:51,859 INFO L290 TraceCheckUtils]: 48: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:51,859 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {28797#true} {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #122#return; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,859 INFO L272 TraceCheckUtils]: 50: Hoare triple {28885#(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)); {28797#true} is VALID [2022-04-27 10:47:51,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:51,860 INFO L290 TraceCheckUtils]: 52: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:51,860 INFO L290 TraceCheckUtils]: 53: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:51,860 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {28797#true} {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #124#return; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,860 INFO L272 TraceCheckUtils]: 55: Hoare triple {28885#(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)); {28797#true} is VALID [2022-04-27 10:47:51,860 INFO L290 TraceCheckUtils]: 56: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:51,860 INFO L290 TraceCheckUtils]: 57: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:51,860 INFO L290 TraceCheckUtils]: 58: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:51,861 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {28797#true} {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #126#return; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,861 INFO L272 TraceCheckUtils]: 60: Hoare triple {28885#(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)); {28797#true} is VALID [2022-04-27 10:47:51,861 INFO L290 TraceCheckUtils]: 61: Hoare triple {28797#true} ~cond := #in~cond; {28797#true} is VALID [2022-04-27 10:47:51,861 INFO L290 TraceCheckUtils]: 62: Hoare triple {28797#true} assume !(0 == ~cond); {28797#true} is VALID [2022-04-27 10:47:51,861 INFO L290 TraceCheckUtils]: 63: Hoare triple {28797#true} assume true; {28797#true} is VALID [2022-04-27 10:47:51,861 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {28797#true} {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #128#return; {28885#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:47:51,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {28885#(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; {29057#(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-27 10:47:51,863 INFO L290 TraceCheckUtils]: 66: Hoare triple {29057#(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); {28798#false} is VALID [2022-04-27 10:47:51,863 INFO L290 TraceCheckUtils]: 67: Hoare triple {28798#false} assume !(~j~0 < ~r~0); {28798#false} is VALID [2022-04-27 10:47:51,863 INFO L272 TraceCheckUtils]: 68: Hoare triple {28798#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {28798#false} is VALID [2022-04-27 10:47:51,863 INFO L290 TraceCheckUtils]: 69: Hoare triple {28798#false} ~cond := #in~cond; {28798#false} is VALID [2022-04-27 10:47:51,863 INFO L290 TraceCheckUtils]: 70: Hoare triple {28798#false} assume !(0 == ~cond); {28798#false} is VALID [2022-04-27 10:47:51,863 INFO L290 TraceCheckUtils]: 71: Hoare triple {28798#false} assume true; {28798#false} is VALID [2022-04-27 10:47:51,863 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {28798#false} {28798#false} #118#return; {28798#false} is VALID [2022-04-27 10:47:51,863 INFO L272 TraceCheckUtils]: 73: Hoare triple {28798#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {28798#false} is VALID [2022-04-27 10:47:51,863 INFO L290 TraceCheckUtils]: 74: Hoare triple {28798#false} ~cond := #in~cond; {28798#false} is VALID [2022-04-27 10:47:51,863 INFO L290 TraceCheckUtils]: 75: Hoare triple {28798#false} assume !(0 == ~cond); {28798#false} is VALID [2022-04-27 10:47:51,863 INFO L290 TraceCheckUtils]: 76: Hoare triple {28798#false} assume true; {28798#false} is VALID [2022-04-27 10:47:51,864 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {28798#false} {28798#false} #120#return; {28798#false} is VALID [2022-04-27 10:47:51,864 INFO L290 TraceCheckUtils]: 78: Hoare triple {28798#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {28798#false} is VALID [2022-04-27 10:47:51,864 INFO L290 TraceCheckUtils]: 79: Hoare triple {28798#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {28798#false} is VALID [2022-04-27 10:47:51,864 INFO L272 TraceCheckUtils]: 80: Hoare triple {28798#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {28798#false} is VALID [2022-04-27 10:47:51,864 INFO L290 TraceCheckUtils]: 81: Hoare triple {28798#false} ~cond := #in~cond; {28798#false} is VALID [2022-04-27 10:47:51,864 INFO L290 TraceCheckUtils]: 82: Hoare triple {28798#false} assume 0 == ~cond; {28798#false} is VALID [2022-04-27 10:47:51,864 INFO L290 TraceCheckUtils]: 83: Hoare triple {28798#false} assume !false; {28798#false} is VALID [2022-04-27 10:47:51,864 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-27 10:47:51,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:47:51,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75274660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:51,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:47:51,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-04-27 10:47:51,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950190704] [2022-04-27 10:47:51,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:51,865 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-27 10:47:51,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:51,865 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-27 10:47:51,908 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-27 10:47:51,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:47:51,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:51,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:47:51,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:47:51,909 INFO L87 Difference]: Start difference. First operand 341 states and 542 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-27 10:47:53,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:53,549 INFO L93 Difference]: Finished difference Result 641 states and 1014 transitions. [2022-04-27 10:47:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:47:53,549 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-27 10:47:53,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:53,550 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-27 10:47:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-04-27 10:47:53,551 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-27 10:47:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-04-27 10:47:53,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 168 transitions. [2022-04-27 10:47:53,664 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-27 10:47:53,669 INFO L225 Difference]: With dead ends: 641 [2022-04-27 10:47:53,669 INFO L226 Difference]: Without dead ends: 295 [2022-04-27 10:47:53,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:47:53,671 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 20 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:53,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 144 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:47:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-04-27 10:47:54,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 284. [2022-04-27 10:47:54,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:54,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand has 284 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 145 states have internal predecessors, (171), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 121 states have call predecessors, (135), 135 states have call successors, (135) [2022-04-27 10:47:54,586 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand has 284 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 145 states have internal predecessors, (171), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 121 states have call predecessors, (135), 135 states have call successors, (135) [2022-04-27 10:47:54,586 INFO L87 Difference]: Start difference. First operand 295 states. Second operand has 284 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 145 states have internal predecessors, (171), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 121 states have call predecessors, (135), 135 states have call successors, (135) [2022-04-27 10:47:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:54,593 INFO L93 Difference]: Finished difference Result 295 states and 457 transitions. [2022-04-27 10:47:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 457 transitions. [2022-04-27 10:47:54,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:54,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:54,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 284 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 145 states have internal predecessors, (171), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 121 states have call predecessors, (135), 135 states have call successors, (135) Second operand 295 states. [2022-04-27 10:47:54,595 INFO L87 Difference]: Start difference. First operand has 284 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 145 states have internal predecessors, (171), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 121 states have call predecessors, (135), 135 states have call successors, (135) Second operand 295 states. [2022-04-27 10:47:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:54,601 INFO L93 Difference]: Finished difference Result 295 states and 457 transitions. [2022-04-27 10:47:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 457 transitions. [2022-04-27 10:47:54,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:54,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:54,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:54,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 145 states have internal predecessors, (171), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 121 states have call predecessors, (135), 135 states have call successors, (135) [2022-04-27 10:47:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 442 transitions. [2022-04-27 10:47:54,610 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 442 transitions. Word has length 84 [2022-04-27 10:47:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:54,610 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 442 transitions. [2022-04-27 10:47:54,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 10:47:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 442 transitions. [2022-04-27 10:47:54,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-27 10:47:54,611 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:54,611 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-27 10:47:54,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 10:47:54,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:54,827 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:54,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:54,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1038278041, now seen corresponding path program 1 times [2022-04-27 10:47:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:54,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253424889] [2022-04-27 10:47:54,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:54,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:54,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:54,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {31216#(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); {31157#true} is VALID [2022-04-27 10:47:54,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31157#true} {31157#true} #138#return; {31157#true} is VALID [2022-04-27 10:47:54,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:47:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:54,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31157#true} {31157#true} #118#return; {31157#true} is VALID [2022-04-27 10:47:54,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:47:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:54,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31157#true} {31157#true} #120#return; {31157#true} is VALID [2022-04-27 10:47:54,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 10:47:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:54,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31157#true} {31170#(<= 2 main_~l~0)} #130#return; {31170#(<= 2 main_~l~0)} is VALID [2022-04-27 10:47:54,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-27 10:47:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:54,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31157#true} {31170#(<= 2 main_~l~0)} #132#return; {31170#(<= 2 main_~l~0)} is VALID [2022-04-27 10:47:54,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 10:47:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:54,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31157#true} {31180#(<= 2 main_~j~0)} #118#return; {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-27 10:47:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:54,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31157#true} {31180#(<= 2 main_~j~0)} #120#return; {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-27 10:47:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:54,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31157#true} {31180#(<= 2 main_~j~0)} #122#return; {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-27 10:47:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:54,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31157#true} {31180#(<= 2 main_~j~0)} #124#return; {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-27 10:47:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:54,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31157#true} {31180#(<= 2 main_~j~0)} #126#return; {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-27 10:47:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:54,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31157#true} {31180#(<= 2 main_~j~0)} #128#return; {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-27 10:47:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:54,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31157#true} {31205#(<= 2 main_~i~0)} #118#return; {31205#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:54,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-27 10:47:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:54,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31157#true} {31205#(<= 2 main_~i~0)} #120#return; {31205#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:54,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {31157#true} call ULTIMATE.init(); {31216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:54,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {31216#(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); {31157#true} is VALID [2022-04-27 10:47:54,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31157#true} {31157#true} #138#return; {31157#true} is VALID [2022-04-27 10:47:54,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {31157#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {31157#true} is VALID [2022-04-27 10:47:54,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {31157#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; {31157#true} is VALID [2022-04-27 10:47:54,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {31157#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; {31157#true} is VALID [2022-04-27 10:47:54,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {31157#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {31157#true} is VALID [2022-04-27 10:47:54,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {31157#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {31157#true} is VALID [2022-04-27 10:47:54,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {31157#true} assume !!(~j~0 <= ~r~0); {31157#true} is VALID [2022-04-27 10:47:54,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {31157#true} assume !(~j~0 < ~r~0); {31157#true} is VALID [2022-04-27 10:47:54,946 INFO L272 TraceCheckUtils]: 11: Hoare triple {31157#true} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:54,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,946 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31157#true} {31157#true} #118#return; {31157#true} is VALID [2022-04-27 10:47:54,946 INFO L272 TraceCheckUtils]: 16: Hoare triple {31157#true} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:54,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,946 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {31157#true} {31157#true} #120#return; {31157#true} is VALID [2022-04-27 10:47:54,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {31157#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {31157#true} is VALID [2022-04-27 10:47:54,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {31157#true} assume 0 != #t~nondet5;havoc #t~nondet5; {31157#true} is VALID [2022-04-27 10:47:54,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {31157#true} assume ~l~0 > 1; {31170#(<= 2 main_~l~0)} is VALID [2022-04-27 10:47:54,947 INFO L272 TraceCheckUtils]: 24: Hoare triple {31170#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:54,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,947 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {31157#true} {31170#(<= 2 main_~l~0)} #130#return; {31170#(<= 2 main_~l~0)} is VALID [2022-04-27 10:47:54,947 INFO L272 TraceCheckUtils]: 29: Hoare triple {31170#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:54,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,948 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {31157#true} {31170#(<= 2 main_~l~0)} #132#return; {31170#(<= 2 main_~l~0)} is VALID [2022-04-27 10:47:54,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {31170#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {31179#(<= 1 main_~l~0)} is VALID [2022-04-27 10:47:54,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {31179#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {31180#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {31180#(<= 2 main_~j~0)} assume !(~j~0 < ~r~0); {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,949 INFO L272 TraceCheckUtils]: 38: Hoare triple {31180#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:54,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,950 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {31157#true} {31180#(<= 2 main_~j~0)} #118#return; {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,950 INFO L272 TraceCheckUtils]: 43: Hoare triple {31180#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:54,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,950 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31157#true} {31180#(<= 2 main_~j~0)} #120#return; {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {31180#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {31180#(<= 2 main_~j~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,951 INFO L272 TraceCheckUtils]: 50: Hoare triple {31180#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:54,951 INFO L290 TraceCheckUtils]: 51: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,951 INFO L290 TraceCheckUtils]: 52: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,951 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {31157#true} {31180#(<= 2 main_~j~0)} #122#return; {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,951 INFO L272 TraceCheckUtils]: 55: Hoare triple {31180#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:54,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,952 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {31157#true} {31180#(<= 2 main_~j~0)} #124#return; {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,952 INFO L272 TraceCheckUtils]: 60: Hoare triple {31180#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:54,952 INFO L290 TraceCheckUtils]: 61: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,952 INFO L290 TraceCheckUtils]: 62: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,952 INFO L290 TraceCheckUtils]: 63: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,952 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {31157#true} {31180#(<= 2 main_~j~0)} #126#return; {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,952 INFO L272 TraceCheckUtils]: 65: Hoare triple {31180#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:54,952 INFO L290 TraceCheckUtils]: 66: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,952 INFO L290 TraceCheckUtils]: 67: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,952 INFO L290 TraceCheckUtils]: 68: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,953 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {31157#true} {31180#(<= 2 main_~j~0)} #128#return; {31180#(<= 2 main_~j~0)} is VALID [2022-04-27 10:47:54,953 INFO L290 TraceCheckUtils]: 70: Hoare triple {31180#(<= 2 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {31205#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:54,953 INFO L290 TraceCheckUtils]: 71: Hoare triple {31205#(<= 2 main_~i~0)} assume !!(~j~0 <= ~r~0); {31205#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:54,954 INFO L290 TraceCheckUtils]: 72: Hoare triple {31205#(<= 2 main_~i~0)} assume !(~j~0 < ~r~0); {31205#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:54,954 INFO L272 TraceCheckUtils]: 73: Hoare triple {31205#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:54,954 INFO L290 TraceCheckUtils]: 74: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,954 INFO L290 TraceCheckUtils]: 75: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,954 INFO L290 TraceCheckUtils]: 76: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,954 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {31157#true} {31205#(<= 2 main_~i~0)} #118#return; {31205#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:54,954 INFO L272 TraceCheckUtils]: 78: Hoare triple {31205#(<= 2 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:54,954 INFO L290 TraceCheckUtils]: 79: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:54,954 INFO L290 TraceCheckUtils]: 80: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:54,954 INFO L290 TraceCheckUtils]: 81: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:54,955 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {31157#true} {31205#(<= 2 main_~i~0)} #120#return; {31205#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:54,955 INFO L290 TraceCheckUtils]: 83: Hoare triple {31205#(<= 2 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {31205#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:54,955 INFO L290 TraceCheckUtils]: 84: Hoare triple {31205#(<= 2 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {31205#(<= 2 main_~i~0)} is VALID [2022-04-27 10:47:54,956 INFO L272 TraceCheckUtils]: 85: Hoare triple {31205#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {31214#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:54,956 INFO L290 TraceCheckUtils]: 86: Hoare triple {31214#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {31215#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:54,956 INFO L290 TraceCheckUtils]: 87: Hoare triple {31215#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {31158#false} is VALID [2022-04-27 10:47:54,956 INFO L290 TraceCheckUtils]: 88: Hoare triple {31158#false} assume !false; {31158#false} is VALID [2022-04-27 10:47:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-27 10:47:54,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:54,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253424889] [2022-04-27 10:47:54,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253424889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:47:54,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942556769] [2022-04-27 10:47:54,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:54,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:54,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:47:54,958 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:47:54,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 10:47:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:55,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 10:47:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:55,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:47:55,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {31157#true} call ULTIMATE.init(); {31157#true} is VALID [2022-04-27 10:47:55,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#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); {31157#true} is VALID [2022-04-27 10:47:55,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31157#true} {31157#true} #138#return; {31157#true} is VALID [2022-04-27 10:47:55,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {31157#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {31157#true} is VALID [2022-04-27 10:47:55,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {31157#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; {31157#true} is VALID [2022-04-27 10:47:55,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {31157#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; {31157#true} is VALID [2022-04-27 10:47:55,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {31157#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {31157#true} is VALID [2022-04-27 10:47:55,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {31157#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {31244#(<= (* main_~l~0 2) main_~j~0)} is VALID [2022-04-27 10:47:55,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {31244#(<= (* main_~l~0 2) main_~j~0)} assume !!(~j~0 <= ~r~0); {31248#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-27 10:47:55,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {31248#(<= (* main_~l~0 2) main_~r~0)} assume !(~j~0 < ~r~0); {31248#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-27 10:47:55,425 INFO L272 TraceCheckUtils]: 11: Hoare triple {31248#(<= (* main_~l~0 2) main_~r~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,426 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31157#true} {31248#(<= (* main_~l~0 2) main_~r~0)} #118#return; {31248#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-27 10:47:55,426 INFO L272 TraceCheckUtils]: 16: Hoare triple {31248#(<= (* main_~l~0 2) main_~r~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,427 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {31157#true} {31248#(<= (* main_~l~0 2) main_~r~0)} #120#return; {31248#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-27 10:47:55,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {31248#(<= (* main_~l~0 2) main_~r~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {31248#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-27 10:47:55,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {31248#(<= (* main_~l~0 2) main_~r~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {31248#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-27 10:47:55,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {31248#(<= (* main_~l~0 2) main_~r~0)} assume ~l~0 > 1; {31248#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-27 10:47:55,428 INFO L272 TraceCheckUtils]: 24: Hoare triple {31248#(<= (* main_~l~0 2) main_~r~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,428 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {31157#true} {31248#(<= (* main_~l~0 2) main_~r~0)} #130#return; {31248#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-27 10:47:55,429 INFO L272 TraceCheckUtils]: 29: Hoare triple {31248#(<= (* main_~l~0 2) main_~r~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,429 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {31157#true} {31248#(<= (* main_~l~0 2) main_~r~0)} #132#return; {31248#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-27 10:47:55,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {31248#(<= (* main_~l~0 2) main_~r~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {31324#(<= (+ main_~l~0 1) (div main_~r~0 2))} is VALID [2022-04-27 10:47:55,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {31324#(<= (+ main_~l~0 1) (div main_~r~0 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {31328#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-27 10:47:55,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {31328#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} assume !!(~j~0 <= ~r~0); {31328#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-27 10:47:55,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {31328#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} assume !(~j~0 < ~r~0); {31158#false} is VALID [2022-04-27 10:47:55,431 INFO L272 TraceCheckUtils]: 38: Hoare triple {31158#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {31158#false} is VALID [2022-04-27 10:47:55,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {31158#false} ~cond := #in~cond; {31158#false} is VALID [2022-04-27 10:47:55,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {31158#false} assume !(0 == ~cond); {31158#false} is VALID [2022-04-27 10:47:55,431 INFO L290 TraceCheckUtils]: 41: Hoare triple {31158#false} assume true; {31158#false} is VALID [2022-04-27 10:47:55,431 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {31158#false} {31158#false} #118#return; {31158#false} is VALID [2022-04-27 10:47:55,431 INFO L272 TraceCheckUtils]: 43: Hoare triple {31158#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {31158#false} is VALID [2022-04-27 10:47:55,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {31158#false} ~cond := #in~cond; {31158#false} is VALID [2022-04-27 10:47:55,431 INFO L290 TraceCheckUtils]: 45: Hoare triple {31158#false} assume !(0 == ~cond); {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L290 TraceCheckUtils]: 46: Hoare triple {31158#false} assume true; {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31158#false} {31158#false} #120#return; {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L290 TraceCheckUtils]: 48: Hoare triple {31158#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L290 TraceCheckUtils]: 49: Hoare triple {31158#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L272 TraceCheckUtils]: 50: Hoare triple {31158#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {31158#false} ~cond := #in~cond; {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {31158#false} assume !(0 == ~cond); {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {31158#false} assume true; {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {31158#false} {31158#false} #122#return; {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L272 TraceCheckUtils]: 55: Hoare triple {31158#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L290 TraceCheckUtils]: 56: Hoare triple {31158#false} ~cond := #in~cond; {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L290 TraceCheckUtils]: 57: Hoare triple {31158#false} assume !(0 == ~cond); {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L290 TraceCheckUtils]: 58: Hoare triple {31158#false} assume true; {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {31158#false} {31158#false} #124#return; {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L272 TraceCheckUtils]: 60: Hoare triple {31158#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L290 TraceCheckUtils]: 61: Hoare triple {31158#false} ~cond := #in~cond; {31158#false} is VALID [2022-04-27 10:47:55,432 INFO L290 TraceCheckUtils]: 62: Hoare triple {31158#false} assume !(0 == ~cond); {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L290 TraceCheckUtils]: 63: Hoare triple {31158#false} assume true; {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {31158#false} {31158#false} #126#return; {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L272 TraceCheckUtils]: 65: Hoare triple {31158#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L290 TraceCheckUtils]: 66: Hoare triple {31158#false} ~cond := #in~cond; {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L290 TraceCheckUtils]: 67: Hoare triple {31158#false} assume !(0 == ~cond); {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L290 TraceCheckUtils]: 68: Hoare triple {31158#false} assume true; {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {31158#false} {31158#false} #128#return; {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L290 TraceCheckUtils]: 70: Hoare triple {31158#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L290 TraceCheckUtils]: 71: Hoare triple {31158#false} assume !!(~j~0 <= ~r~0); {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L290 TraceCheckUtils]: 72: Hoare triple {31158#false} assume !(~j~0 < ~r~0); {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L272 TraceCheckUtils]: 73: Hoare triple {31158#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L290 TraceCheckUtils]: 74: Hoare triple {31158#false} ~cond := #in~cond; {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L290 TraceCheckUtils]: 75: Hoare triple {31158#false} assume !(0 == ~cond); {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L290 TraceCheckUtils]: 76: Hoare triple {31158#false} assume true; {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {31158#false} {31158#false} #118#return; {31158#false} is VALID [2022-04-27 10:47:55,433 INFO L272 TraceCheckUtils]: 78: Hoare triple {31158#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {31158#false} is VALID [2022-04-27 10:47:55,434 INFO L290 TraceCheckUtils]: 79: Hoare triple {31158#false} ~cond := #in~cond; {31158#false} is VALID [2022-04-27 10:47:55,434 INFO L290 TraceCheckUtils]: 80: Hoare triple {31158#false} assume !(0 == ~cond); {31158#false} is VALID [2022-04-27 10:47:55,434 INFO L290 TraceCheckUtils]: 81: Hoare triple {31158#false} assume true; {31158#false} is VALID [2022-04-27 10:47:55,434 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {31158#false} {31158#false} #120#return; {31158#false} is VALID [2022-04-27 10:47:55,434 INFO L290 TraceCheckUtils]: 83: Hoare triple {31158#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {31158#false} is VALID [2022-04-27 10:47:55,434 INFO L290 TraceCheckUtils]: 84: Hoare triple {31158#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {31158#false} is VALID [2022-04-27 10:47:55,434 INFO L272 TraceCheckUtils]: 85: Hoare triple {31158#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {31158#false} is VALID [2022-04-27 10:47:55,434 INFO L290 TraceCheckUtils]: 86: Hoare triple {31158#false} ~cond := #in~cond; {31158#false} is VALID [2022-04-27 10:47:55,434 INFO L290 TraceCheckUtils]: 87: Hoare triple {31158#false} assume 0 == ~cond; {31158#false} is VALID [2022-04-27 10:47:55,434 INFO L290 TraceCheckUtils]: 88: Hoare triple {31158#false} assume !false; {31158#false} is VALID [2022-04-27 10:47:55,434 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-04-27 10:47:55,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:47:55,879 INFO L290 TraceCheckUtils]: 88: Hoare triple {31158#false} assume !false; {31158#false} is VALID [2022-04-27 10:47:55,880 INFO L290 TraceCheckUtils]: 87: Hoare triple {31158#false} assume 0 == ~cond; {31158#false} is VALID [2022-04-27 10:47:55,880 INFO L290 TraceCheckUtils]: 86: Hoare triple {31158#false} ~cond := #in~cond; {31158#false} is VALID [2022-04-27 10:47:55,880 INFO L272 TraceCheckUtils]: 85: Hoare triple {31158#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {31158#false} is VALID [2022-04-27 10:47:55,880 INFO L290 TraceCheckUtils]: 84: Hoare triple {31158#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {31158#false} is VALID [2022-04-27 10:47:55,880 INFO L290 TraceCheckUtils]: 83: Hoare triple {31158#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {31158#false} is VALID [2022-04-27 10:47:55,880 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {31157#true} {31158#false} #120#return; {31158#false} is VALID [2022-04-27 10:47:55,880 INFO L290 TraceCheckUtils]: 81: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,880 INFO L290 TraceCheckUtils]: 80: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,880 INFO L290 TraceCheckUtils]: 79: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,880 INFO L272 TraceCheckUtils]: 78: Hoare triple {31158#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,880 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {31157#true} {31158#false} #118#return; {31158#false} is VALID [2022-04-27 10:47:55,880 INFO L290 TraceCheckUtils]: 76: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,880 INFO L290 TraceCheckUtils]: 75: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,880 INFO L290 TraceCheckUtils]: 74: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,880 INFO L272 TraceCheckUtils]: 73: Hoare triple {31158#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {31158#false} assume !(~j~0 < ~r~0); {31158#false} is VALID [2022-04-27 10:47:55,881 INFO L290 TraceCheckUtils]: 71: Hoare triple {31158#false} assume !!(~j~0 <= ~r~0); {31158#false} is VALID [2022-04-27 10:47:55,881 INFO L290 TraceCheckUtils]: 70: Hoare triple {31158#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {31158#false} is VALID [2022-04-27 10:47:55,881 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {31157#true} {31158#false} #128#return; {31158#false} is VALID [2022-04-27 10:47:55,881 INFO L290 TraceCheckUtils]: 68: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,881 INFO L290 TraceCheckUtils]: 67: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,881 INFO L290 TraceCheckUtils]: 66: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,881 INFO L272 TraceCheckUtils]: 65: Hoare triple {31158#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,881 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {31157#true} {31158#false} #126#return; {31158#false} is VALID [2022-04-27 10:47:55,881 INFO L290 TraceCheckUtils]: 63: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,881 INFO L290 TraceCheckUtils]: 62: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,881 INFO L290 TraceCheckUtils]: 61: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,881 INFO L272 TraceCheckUtils]: 60: Hoare triple {31158#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,881 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {31157#true} {31158#false} #124#return; {31158#false} is VALID [2022-04-27 10:47:55,881 INFO L290 TraceCheckUtils]: 58: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,881 INFO L290 TraceCheckUtils]: 57: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,881 INFO L290 TraceCheckUtils]: 56: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,882 INFO L272 TraceCheckUtils]: 55: Hoare triple {31158#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,882 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {31157#true} {31158#false} #122#return; {31158#false} is VALID [2022-04-27 10:47:55,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,882 INFO L272 TraceCheckUtils]: 50: Hoare triple {31158#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,882 INFO L290 TraceCheckUtils]: 49: Hoare triple {31158#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {31158#false} is VALID [2022-04-27 10:47:55,882 INFO L290 TraceCheckUtils]: 48: Hoare triple {31158#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {31158#false} is VALID [2022-04-27 10:47:55,882 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31157#true} {31158#false} #120#return; {31158#false} is VALID [2022-04-27 10:47:55,882 INFO L290 TraceCheckUtils]: 46: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,882 INFO L272 TraceCheckUtils]: 43: Hoare triple {31158#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,882 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {31157#true} {31158#false} #118#return; {31158#false} is VALID [2022-04-27 10:47:55,882 INFO L290 TraceCheckUtils]: 41: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,882 INFO L290 TraceCheckUtils]: 40: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,882 INFO L290 TraceCheckUtils]: 39: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,883 INFO L272 TraceCheckUtils]: 38: Hoare triple {31158#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {31641#(< main_~j~0 main_~r~0)} assume !(~j~0 < ~r~0); {31158#false} is VALID [2022-04-27 10:47:55,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {31641#(< main_~j~0 main_~r~0)} assume !!(~j~0 <= ~r~0); {31641#(< main_~j~0 main_~r~0)} is VALID [2022-04-27 10:47:55,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {31648#(< (* main_~l~0 2) main_~r~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {31641#(< main_~j~0 main_~r~0)} is VALID [2022-04-27 10:47:55,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {31648#(< (* main_~l~0 2) main_~r~0)} is VALID [2022-04-27 10:47:55,884 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {31157#true} {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} #132#return; {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} is VALID [2022-04-27 10:47:55,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,885 INFO L272 TraceCheckUtils]: 29: Hoare triple {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,885 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {31157#true} {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} #130#return; {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} is VALID [2022-04-27 10:47:55,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,885 INFO L272 TraceCheckUtils]: 24: Hoare triple {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} assume ~l~0 > 1; {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} is VALID [2022-04-27 10:47:55,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} assume 0 != #t~nondet5;havoc #t~nondet5; {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} is VALID [2022-04-27 10:47:55,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} is VALID [2022-04-27 10:47:55,887 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {31157#true} {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} #120#return; {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} is VALID [2022-04-27 10:47:55,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,887 INFO L272 TraceCheckUtils]: 16: Hoare triple {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,887 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31157#true} {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} #118#return; {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} is VALID [2022-04-27 10:47:55,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {31157#true} assume !(0 == ~cond); {31157#true} is VALID [2022-04-27 10:47:55,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {31157#true} ~cond := #in~cond; {31157#true} is VALID [2022-04-27 10:47:55,888 INFO L272 TraceCheckUtils]: 11: Hoare triple {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {31157#true} is VALID [2022-04-27 10:47:55,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} assume !(~j~0 < ~r~0); {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} is VALID [2022-04-27 10:47:55,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {31728#(<= main_~l~0 (+ (div (+ main_~j~0 (- 3)) 2) 2))} assume !!(~j~0 <= ~r~0); {31652#(< main_~l~0 (+ 2 (div (+ (- 1) main_~r~0) 2)))} is VALID [2022-04-27 10:47:55,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {31157#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {31728#(<= main_~l~0 (+ (div (+ main_~j~0 (- 3)) 2) 2))} is VALID [2022-04-27 10:47:55,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {31157#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {31157#true} is VALID [2022-04-27 10:47:55,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {31157#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; {31157#true} is VALID [2022-04-27 10:47:55,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {31157#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; {31157#true} is VALID [2022-04-27 10:47:55,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {31157#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {31157#true} is VALID [2022-04-27 10:47:55,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31157#true} {31157#true} #138#return; {31157#true} is VALID [2022-04-27 10:47:55,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {31157#true} assume true; {31157#true} is VALID [2022-04-27 10:47:55,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#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); {31157#true} is VALID [2022-04-27 10:47:55,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {31157#true} call ULTIMATE.init(); {31157#true} is VALID [2022-04-27 10:47:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-04-27 10:47:55,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942556769] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:47:55,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:47:55,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2022-04-27 10:47:55,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415831821] [2022-04-27 10:47:55,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:47:55,891 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 7 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) Word has length 89 [2022-04-27 10:47:55,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:55,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 7 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-04-27 10:47:55,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:55,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 10:47:55,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:55,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 10:47:56,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-04-27 10:47:56,000 INFO L87 Difference]: Start difference. First operand 284 states and 442 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 7 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-04-27 10:48:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:04,081 INFO L93 Difference]: Finished difference Result 637 states and 986 transitions. [2022-04-27 10:48:04,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-27 10:48:04,082 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 7 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) Word has length 89 [2022-04-27 10:48:04,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:48:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 7 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-04-27 10:48:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 437 transitions. [2022-04-27 10:48:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 7 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-04-27 10:48:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 437 transitions. [2022-04-27 10:48:04,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 437 transitions. [2022-04-27 10:48:04,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 437 edges. 437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:48:04,533 INFO L225 Difference]: With dead ends: 637 [2022-04-27 10:48:04,533 INFO L226 Difference]: Without dead ends: 405 [2022-04-27 10:48:04,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=493, Invalid=1399, Unknown=0, NotChecked=0, Total=1892 [2022-04-27 10:48:04,535 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 167 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2267 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 3051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 2267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:48:04,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 177 Invalid, 3051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 2267 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-27 10:48:04,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-27 10:48:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 317. [2022-04-27 10:48:05,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:48:05,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 317 states, 153 states have (on average 1.2810457516339868) internal successors, (196), 167 states have internal predecessors, (196), 145 states have call successors, (145), 19 states have call predecessors, (145), 18 states have return successors, (144), 130 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-27 10:48:05,692 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 317 states, 153 states have (on average 1.2810457516339868) internal successors, (196), 167 states have internal predecessors, (196), 145 states have call successors, (145), 19 states have call predecessors, (145), 18 states have return successors, (144), 130 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-27 10:48:05,692 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 317 states, 153 states have (on average 1.2810457516339868) internal successors, (196), 167 states have internal predecessors, (196), 145 states have call successors, (145), 19 states have call predecessors, (145), 18 states have return successors, (144), 130 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-27 10:48:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:05,701 INFO L93 Difference]: Finished difference Result 405 states and 617 transitions. [2022-04-27 10:48:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 617 transitions. [2022-04-27 10:48:05,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:05,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:05,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 317 states, 153 states have (on average 1.2810457516339868) internal successors, (196), 167 states have internal predecessors, (196), 145 states have call successors, (145), 19 states have call predecessors, (145), 18 states have return successors, (144), 130 states have call predecessors, (144), 144 states have call successors, (144) Second operand 405 states. [2022-04-27 10:48:05,703 INFO L87 Difference]: Start difference. First operand has 317 states, 153 states have (on average 1.2810457516339868) internal successors, (196), 167 states have internal predecessors, (196), 145 states have call successors, (145), 19 states have call predecessors, (145), 18 states have return successors, (144), 130 states have call predecessors, (144), 144 states have call successors, (144) Second operand 405 states. [2022-04-27 10:48:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:05,712 INFO L93 Difference]: Finished difference Result 405 states and 617 transitions. [2022-04-27 10:48:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 617 transitions. [2022-04-27 10:48:05,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:05,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:05,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:48:05,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:48:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 153 states have (on average 1.2810457516339868) internal successors, (196), 167 states have internal predecessors, (196), 145 states have call successors, (145), 19 states have call predecessors, (145), 18 states have return successors, (144), 130 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-27 10:48:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 485 transitions. [2022-04-27 10:48:05,721 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 485 transitions. Word has length 89 [2022-04-27 10:48:05,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:48:05,722 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 485 transitions. [2022-04-27 10:48:05,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 7 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-04-27 10:48:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 485 transitions. [2022-04-27 10:48:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-27 10:48:05,723 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:48:05,723 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:48:05,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 10:48:05,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:48:05,934 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:48:05,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:48:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1099325000, now seen corresponding path program 1 times [2022-04-27 10:48:05,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:48:05,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705889728] [2022-04-27 10:48:05,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:05,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:48:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:48:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {34194#(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); {34114#true} is VALID [2022-04-27 10:48:06,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34114#true} {34114#true} #138#return; {34114#true} is VALID [2022-04-27 10:48:06,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:48:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34120#(<= main_~r~0 (* main_~l~0 2))} #118#return; {34120#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:06,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:48:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34120#(<= main_~r~0 (* main_~l~0 2))} #120#return; {34120#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:06,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 10:48:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34129#(<= (+ main_~r~0 4) (* main_~l~0 4))} #130#return; {34129#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-27 10:48:06,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-27 10:48:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34129#(<= (+ main_~r~0 4) (* main_~l~0 4))} #132#return; {34129#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-27 10:48:06,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 10:48:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34139#(<= main_~r~0 (* main_~j~0 2))} #110#return; {34139#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-27 10:48:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34139#(<= main_~r~0 (* main_~j~0 2))} #112#return; {34139#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 10:48:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34139#(<= main_~r~0 (* main_~j~0 2))} #114#return; {34139#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-27 10:48:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34139#(<= main_~r~0 (* main_~j~0 2))} #116#return; {34139#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-27 10:48:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} #118#return; {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-27 10:48:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} #120#return; {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-27 10:48:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} #122#return; {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-27 10:48:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} #124#return; {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-27 10:48:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} #126#return; {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-27 10:48:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} #128#return; {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-27 10:48:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34115#false} #118#return; {34115#false} is VALID [2022-04-27 10:48:06,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-27 10:48:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34115#false} #120#return; {34115#false} is VALID [2022-04-27 10:48:06,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-04-27 10:48:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34115#false} #122#return; {34115#false} is VALID [2022-04-27 10:48:06,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {34114#true} call ULTIMATE.init(); {34194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:48:06,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {34194#(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); {34114#true} is VALID [2022-04-27 10:48:06,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34114#true} #138#return; {34114#true} is VALID [2022-04-27 10:48:06,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {34114#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {34114#true} is VALID [2022-04-27 10:48:06,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {34114#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; {34114#true} is VALID [2022-04-27 10:48:06,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {34114#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; {34114#true} is VALID [2022-04-27 10:48:06,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {34114#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {34114#true} is VALID [2022-04-27 10:48:06,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {34114#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {34119#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:06,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {34119#(<= main_~j~0 (* main_~l~0 2))} assume !!(~j~0 <= ~r~0); {34119#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:06,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {34119#(<= main_~j~0 (* main_~l~0 2))} assume !(~j~0 < ~r~0); {34120#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:06,093 INFO L272 TraceCheckUtils]: 11: Hoare triple {34120#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,093 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34114#true} {34120#(<= main_~r~0 (* main_~l~0 2))} #118#return; {34120#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:06,094 INFO L272 TraceCheckUtils]: 16: Hoare triple {34120#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,094 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {34114#true} {34120#(<= main_~r~0 (* main_~l~0 2))} #120#return; {34120#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:06,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {34120#(<= main_~r~0 (* main_~l~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {34120#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:06,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {34120#(<= main_~r~0 (* main_~l~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {34120#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:06,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {34120#(<= main_~r~0 (* main_~l~0 2))} assume ~l~0 > 1; {34129#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-27 10:48:06,095 INFO L272 TraceCheckUtils]: 24: Hoare triple {34129#(<= (+ main_~r~0 4) (* main_~l~0 4))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,096 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {34114#true} {34129#(<= (+ main_~r~0 4) (* main_~l~0 4))} #130#return; {34129#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-27 10:48:06,096 INFO L272 TraceCheckUtils]: 29: Hoare triple {34129#(<= (+ main_~r~0 4) (* main_~l~0 4))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,096 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {34114#true} {34129#(<= (+ main_~r~0 4) (* main_~l~0 4))} #132#return; {34129#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-27 10:48:06,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {34129#(<= (+ main_~r~0 4) (* main_~l~0 4))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {34138#(<= main_~r~0 (* main_~l~0 4))} is VALID [2022-04-27 10:48:06,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {34138#(<= main_~r~0 (* main_~l~0 4))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {34139#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {34139#(<= main_~r~0 (* main_~j~0 2))} assume !!(~j~0 <= ~r~0); {34139#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,098 INFO L290 TraceCheckUtils]: 37: Hoare triple {34139#(<= main_~r~0 (* main_~j~0 2))} assume ~j~0 < ~r~0; {34139#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,098 INFO L272 TraceCheckUtils]: 38: Hoare triple {34139#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,098 INFO L290 TraceCheckUtils]: 39: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,098 INFO L290 TraceCheckUtils]: 40: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,098 INFO L290 TraceCheckUtils]: 41: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,098 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {34114#true} {34139#(<= main_~r~0 (* main_~j~0 2))} #110#return; {34139#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,098 INFO L272 TraceCheckUtils]: 43: Hoare triple {34139#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,098 INFO L290 TraceCheckUtils]: 44: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,099 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34114#true} {34139#(<= main_~r~0 (* main_~j~0 2))} #112#return; {34139#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,099 INFO L272 TraceCheckUtils]: 48: Hoare triple {34139#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,099 INFO L290 TraceCheckUtils]: 51: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,099 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {34114#true} {34139#(<= main_~r~0 (* main_~j~0 2))} #114#return; {34139#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,100 INFO L272 TraceCheckUtils]: 53: Hoare triple {34139#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,100 INFO L290 TraceCheckUtils]: 54: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,100 INFO L290 TraceCheckUtils]: 55: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,100 INFO L290 TraceCheckUtils]: 56: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,100 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {34114#true} {34139#(<= main_~r~0 (* main_~j~0 2))} #116#return; {34139#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,100 INFO L290 TraceCheckUtils]: 58: Hoare triple {34139#(<= main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {34139#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,101 INFO L290 TraceCheckUtils]: 59: Hoare triple {34139#(<= main_~r~0 (* main_~j~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,101 INFO L272 TraceCheckUtils]: 60: Hoare triple {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,101 INFO L290 TraceCheckUtils]: 61: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,101 INFO L290 TraceCheckUtils]: 62: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,101 INFO L290 TraceCheckUtils]: 63: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,101 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {34114#true} {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} #118#return; {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,101 INFO L272 TraceCheckUtils]: 65: Hoare triple {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,102 INFO L290 TraceCheckUtils]: 66: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,102 INFO L290 TraceCheckUtils]: 67: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,102 INFO L290 TraceCheckUtils]: 68: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,102 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {34114#true} {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} #120#return; {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,102 INFO L290 TraceCheckUtils]: 70: Hoare triple {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,103 INFO L290 TraceCheckUtils]: 71: Hoare triple {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,103 INFO L272 TraceCheckUtils]: 72: Hoare triple {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,103 INFO L290 TraceCheckUtils]: 73: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,103 INFO L290 TraceCheckUtils]: 74: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,103 INFO L290 TraceCheckUtils]: 75: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,103 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {34114#true} {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} #122#return; {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,103 INFO L272 TraceCheckUtils]: 77: Hoare triple {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,103 INFO L290 TraceCheckUtils]: 78: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,103 INFO L290 TraceCheckUtils]: 79: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,104 INFO L290 TraceCheckUtils]: 80: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,104 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {34114#true} {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} #124#return; {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,104 INFO L272 TraceCheckUtils]: 82: Hoare triple {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,104 INFO L290 TraceCheckUtils]: 83: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,104 INFO L290 TraceCheckUtils]: 84: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,104 INFO L290 TraceCheckUtils]: 85: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,105 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {34114#true} {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} #126#return; {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,105 INFO L272 TraceCheckUtils]: 87: Hoare triple {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,105 INFO L290 TraceCheckUtils]: 88: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,105 INFO L290 TraceCheckUtils]: 89: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,105 INFO L290 TraceCheckUtils]: 90: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,105 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {34114#true} {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} #128#return; {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-27 10:48:06,106 INFO L290 TraceCheckUtils]: 92: Hoare triple {34156#(<= (+ main_~r~0 2) (* main_~j~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {34181#(<= (+ main_~r~0 2) main_~j~0)} is VALID [2022-04-27 10:48:06,106 INFO L290 TraceCheckUtils]: 93: Hoare triple {34181#(<= (+ main_~r~0 2) main_~j~0)} assume !!(~j~0 <= ~r~0); {34115#false} is VALID [2022-04-27 10:48:06,106 INFO L290 TraceCheckUtils]: 94: Hoare triple {34115#false} assume !(~j~0 < ~r~0); {34115#false} is VALID [2022-04-27 10:48:06,106 INFO L272 TraceCheckUtils]: 95: Hoare triple {34115#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,106 INFO L290 TraceCheckUtils]: 96: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,106 INFO L290 TraceCheckUtils]: 97: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,106 INFO L290 TraceCheckUtils]: 98: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,106 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {34114#true} {34115#false} #118#return; {34115#false} is VALID [2022-04-27 10:48:06,106 INFO L272 TraceCheckUtils]: 100: Hoare triple {34115#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,106 INFO L290 TraceCheckUtils]: 101: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,106 INFO L290 TraceCheckUtils]: 102: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,106 INFO L290 TraceCheckUtils]: 103: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,107 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {34114#true} {34115#false} #120#return; {34115#false} is VALID [2022-04-27 10:48:06,107 INFO L290 TraceCheckUtils]: 105: Hoare triple {34115#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {34115#false} is VALID [2022-04-27 10:48:06,107 INFO L290 TraceCheckUtils]: 106: Hoare triple {34115#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {34115#false} is VALID [2022-04-27 10:48:06,107 INFO L272 TraceCheckUtils]: 107: Hoare triple {34115#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:06,107 INFO L290 TraceCheckUtils]: 108: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:06,107 INFO L290 TraceCheckUtils]: 109: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:06,107 INFO L290 TraceCheckUtils]: 110: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:06,107 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {34114#true} {34115#false} #122#return; {34115#false} is VALID [2022-04-27 10:48:06,107 INFO L272 TraceCheckUtils]: 112: Hoare triple {34115#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {34115#false} is VALID [2022-04-27 10:48:06,107 INFO L290 TraceCheckUtils]: 113: Hoare triple {34115#false} ~cond := #in~cond; {34115#false} is VALID [2022-04-27 10:48:06,107 INFO L290 TraceCheckUtils]: 114: Hoare triple {34115#false} assume 0 == ~cond; {34115#false} is VALID [2022-04-27 10:48:06,107 INFO L290 TraceCheckUtils]: 115: Hoare triple {34115#false} assume !false; {34115#false} is VALID [2022-04-27 10:48:06,108 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-27 10:48:06,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:48:06,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705889728] [2022-04-27 10:48:06,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705889728] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:48:06,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92695375] [2022-04-27 10:48:06,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:06,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:48:06,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:48:06,109 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:48:06,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 10:48:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:48:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:06,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:48:10,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {34114#true} call ULTIMATE.init(); {34114#true} is VALID [2022-04-27 10:48:10,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#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); {34114#true} is VALID [2022-04-27 10:48:10,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:10,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34114#true} #138#return; {34114#true} is VALID [2022-04-27 10:48:10,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {34114#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {34114#true} is VALID [2022-04-27 10:48:10,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {34114#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; {34114#true} is VALID [2022-04-27 10:48:10,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {34114#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; {34114#true} is VALID [2022-04-27 10:48:10,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {34114#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {34114#true} is VALID [2022-04-27 10:48:10,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {34114#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {34119#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:10,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {34119#(<= main_~j~0 (* main_~l~0 2))} assume !!(~j~0 <= ~r~0); {34119#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:10,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {34119#(<= main_~j~0 (* main_~l~0 2))} assume !(~j~0 < ~r~0); {34120#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:10,794 INFO L272 TraceCheckUtils]: 11: Hoare triple {34120#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:10,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:10,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:10,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:10,795 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34114#true} {34120#(<= main_~r~0 (* main_~l~0 2))} #118#return; {34120#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:10,795 INFO L272 TraceCheckUtils]: 16: Hoare triple {34120#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:10,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:10,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:10,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:10,796 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {34114#true} {34120#(<= main_~r~0 (* main_~l~0 2))} #120#return; {34120#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:10,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {34120#(<= main_~r~0 (* main_~l~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {34120#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:10,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {34120#(<= main_~r~0 (* main_~l~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {34120#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-27 10:48:10,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {34120#(<= main_~r~0 (* main_~l~0 2))} assume ~l~0 > 1; {34267#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-27 10:48:10,797 INFO L272 TraceCheckUtils]: 24: Hoare triple {34267#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:10,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:10,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:10,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:10,797 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {34114#true} {34267#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #130#return; {34267#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-27 10:48:10,797 INFO L272 TraceCheckUtils]: 29: Hoare triple {34267#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:10,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:10,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:10,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:10,798 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {34114#true} {34267#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #132#return; {34267#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-27 10:48:10,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {34267#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {34301#(and (<= (div (- main_~r~0) (- 2)) (+ main_~l~0 1)) (< 0 main_~l~0))} is VALID [2022-04-27 10:48:10,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {34301#(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; {34305#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:48:10,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {34305#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !!(~j~0 <= ~r~0); {34305#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:48:10,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {34305#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume ~j~0 < ~r~0; {34305#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:48:10,800 INFO L272 TraceCheckUtils]: 38: Hoare triple {34305#(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)); {34114#true} is VALID [2022-04-27 10:48:10,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:10,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:10,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:10,800 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {34114#true} {34305#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #110#return; {34305#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:48:10,800 INFO L272 TraceCheckUtils]: 43: Hoare triple {34305#(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)); {34114#true} is VALID [2022-04-27 10:48:10,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:10,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:10,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:10,801 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34114#true} {34305#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #112#return; {34305#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:48:10,801 INFO L272 TraceCheckUtils]: 48: Hoare triple {34305#(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)); {34114#true} is VALID [2022-04-27 10:48:10,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:10,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:10,801 INFO L290 TraceCheckUtils]: 51: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:10,808 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {34114#true} {34305#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #114#return; {34305#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:48:10,808 INFO L272 TraceCheckUtils]: 53: Hoare triple {34305#(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)); {34114#true} is VALID [2022-04-27 10:48:10,808 INFO L290 TraceCheckUtils]: 54: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:10,809 INFO L290 TraceCheckUtils]: 55: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:10,809 INFO L290 TraceCheckUtils]: 56: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:10,809 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {34114#true} {34305#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #116#return; {34305#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:48:10,809 INFO L290 TraceCheckUtils]: 58: Hoare triple {34305#(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; {34305#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-27 10:48:10,810 INFO L290 TraceCheckUtils]: 59: Hoare triple {34305#(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; {34378#(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-27 10:48:10,810 INFO L272 TraceCheckUtils]: 60: Hoare triple {34378#(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)); {34114#true} is VALID [2022-04-27 10:48:10,810 INFO L290 TraceCheckUtils]: 61: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:10,810 INFO L290 TraceCheckUtils]: 62: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:10,810 INFO L290 TraceCheckUtils]: 63: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:10,811 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {34114#true} {34378#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #118#return; {34378#(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-27 10:48:10,811 INFO L272 TraceCheckUtils]: 65: Hoare triple {34378#(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)); {34114#true} is VALID [2022-04-27 10:48:10,811 INFO L290 TraceCheckUtils]: 66: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:10,811 INFO L290 TraceCheckUtils]: 67: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:10,811 INFO L290 TraceCheckUtils]: 68: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:10,811 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {34114#true} {34378#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #120#return; {34378#(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-27 10:48:10,812 INFO L290 TraceCheckUtils]: 70: Hoare triple {34378#(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; {34378#(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-27 10:48:10,812 INFO L290 TraceCheckUtils]: 71: Hoare triple {34378#(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; {34378#(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-27 10:48:10,812 INFO L272 TraceCheckUtils]: 72: Hoare triple {34378#(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)); {34114#true} is VALID [2022-04-27 10:48:10,812 INFO L290 TraceCheckUtils]: 73: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:10,812 INFO L290 TraceCheckUtils]: 74: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:10,812 INFO L290 TraceCheckUtils]: 75: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:10,813 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {34114#true} {34378#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #122#return; {34378#(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-27 10:48:10,813 INFO L272 TraceCheckUtils]: 77: Hoare triple {34378#(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)); {34114#true} is VALID [2022-04-27 10:48:10,813 INFO L290 TraceCheckUtils]: 78: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:10,813 INFO L290 TraceCheckUtils]: 79: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:10,813 INFO L290 TraceCheckUtils]: 80: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:10,821 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {34114#true} {34378#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #124#return; {34378#(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-27 10:48:10,821 INFO L272 TraceCheckUtils]: 82: Hoare triple {34378#(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)); {34114#true} is VALID [2022-04-27 10:48:10,821 INFO L290 TraceCheckUtils]: 83: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:10,821 INFO L290 TraceCheckUtils]: 84: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:10,821 INFO L290 TraceCheckUtils]: 85: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:10,822 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {34114#true} {34378#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #126#return; {34378#(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-27 10:48:10,822 INFO L272 TraceCheckUtils]: 87: Hoare triple {34378#(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)); {34114#true} is VALID [2022-04-27 10:48:10,822 INFO L290 TraceCheckUtils]: 88: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:10,822 INFO L290 TraceCheckUtils]: 89: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:10,822 INFO L290 TraceCheckUtils]: 90: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:10,822 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {34114#true} {34378#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #128#return; {34378#(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-27 10:48:10,823 INFO L290 TraceCheckUtils]: 92: Hoare triple {34378#(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; {34478#(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-27 10:48:10,824 INFO L290 TraceCheckUtils]: 93: Hoare triple {34478#(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); {34115#false} is VALID [2022-04-27 10:48:10,824 INFO L290 TraceCheckUtils]: 94: Hoare triple {34115#false} assume !(~j~0 < ~r~0); {34115#false} is VALID [2022-04-27 10:48:10,824 INFO L272 TraceCheckUtils]: 95: Hoare triple {34115#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {34115#false} is VALID [2022-04-27 10:48:10,824 INFO L290 TraceCheckUtils]: 96: Hoare triple {34115#false} ~cond := #in~cond; {34115#false} is VALID [2022-04-27 10:48:10,824 INFO L290 TraceCheckUtils]: 97: Hoare triple {34115#false} assume !(0 == ~cond); {34115#false} is VALID [2022-04-27 10:48:10,824 INFO L290 TraceCheckUtils]: 98: Hoare triple {34115#false} assume true; {34115#false} is VALID [2022-04-27 10:48:10,824 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {34115#false} {34115#false} #118#return; {34115#false} is VALID [2022-04-27 10:48:10,824 INFO L272 TraceCheckUtils]: 100: Hoare triple {34115#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {34115#false} is VALID [2022-04-27 10:48:10,824 INFO L290 TraceCheckUtils]: 101: Hoare triple {34115#false} ~cond := #in~cond; {34115#false} is VALID [2022-04-27 10:48:10,824 INFO L290 TraceCheckUtils]: 102: Hoare triple {34115#false} assume !(0 == ~cond); {34115#false} is VALID [2022-04-27 10:48:10,824 INFO L290 TraceCheckUtils]: 103: Hoare triple {34115#false} assume true; {34115#false} is VALID [2022-04-27 10:48:10,824 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {34115#false} {34115#false} #120#return; {34115#false} is VALID [2022-04-27 10:48:10,824 INFO L290 TraceCheckUtils]: 105: Hoare triple {34115#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {34115#false} is VALID [2022-04-27 10:48:10,824 INFO L290 TraceCheckUtils]: 106: Hoare triple {34115#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {34115#false} is VALID [2022-04-27 10:48:10,824 INFO L272 TraceCheckUtils]: 107: Hoare triple {34115#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {34115#false} is VALID [2022-04-27 10:48:10,825 INFO L290 TraceCheckUtils]: 108: Hoare triple {34115#false} ~cond := #in~cond; {34115#false} is VALID [2022-04-27 10:48:10,825 INFO L290 TraceCheckUtils]: 109: Hoare triple {34115#false} assume !(0 == ~cond); {34115#false} is VALID [2022-04-27 10:48:10,825 INFO L290 TraceCheckUtils]: 110: Hoare triple {34115#false} assume true; {34115#false} is VALID [2022-04-27 10:48:10,825 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {34115#false} {34115#false} #122#return; {34115#false} is VALID [2022-04-27 10:48:10,825 INFO L272 TraceCheckUtils]: 112: Hoare triple {34115#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {34115#false} is VALID [2022-04-27 10:48:10,825 INFO L290 TraceCheckUtils]: 113: Hoare triple {34115#false} ~cond := #in~cond; {34115#false} is VALID [2022-04-27 10:48:10,825 INFO L290 TraceCheckUtils]: 114: Hoare triple {34115#false} assume 0 == ~cond; {34115#false} is VALID [2022-04-27 10:48:10,825 INFO L290 TraceCheckUtils]: 115: Hoare triple {34115#false} assume !false; {34115#false} is VALID [2022-04-27 10:48:10,825 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-27 10:48:10,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:48:11,539 INFO L290 TraceCheckUtils]: 115: Hoare triple {34115#false} assume !false; {34115#false} is VALID [2022-04-27 10:48:11,539 INFO L290 TraceCheckUtils]: 114: Hoare triple {34115#false} assume 0 == ~cond; {34115#false} is VALID [2022-04-27 10:48:11,539 INFO L290 TraceCheckUtils]: 113: Hoare triple {34115#false} ~cond := #in~cond; {34115#false} is VALID [2022-04-27 10:48:11,539 INFO L272 TraceCheckUtils]: 112: Hoare triple {34115#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {34115#false} is VALID [2022-04-27 10:48:11,539 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {34114#true} {34115#false} #122#return; {34115#false} is VALID [2022-04-27 10:48:11,539 INFO L290 TraceCheckUtils]: 110: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,539 INFO L290 TraceCheckUtils]: 109: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,539 INFO L290 TraceCheckUtils]: 108: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,539 INFO L272 TraceCheckUtils]: 107: Hoare triple {34115#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:11,539 INFO L290 TraceCheckUtils]: 106: Hoare triple {34115#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {34115#false} is VALID [2022-04-27 10:48:11,539 INFO L290 TraceCheckUtils]: 105: Hoare triple {34115#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {34115#false} is VALID [2022-04-27 10:48:11,539 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {34114#true} {34115#false} #120#return; {34115#false} is VALID [2022-04-27 10:48:11,540 INFO L290 TraceCheckUtils]: 103: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,540 INFO L290 TraceCheckUtils]: 102: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,540 INFO L290 TraceCheckUtils]: 101: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,540 INFO L272 TraceCheckUtils]: 100: Hoare triple {34115#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:11,540 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {34114#true} {34115#false} #118#return; {34115#false} is VALID [2022-04-27 10:48:11,540 INFO L290 TraceCheckUtils]: 98: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,540 INFO L290 TraceCheckUtils]: 97: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,540 INFO L290 TraceCheckUtils]: 96: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,540 INFO L272 TraceCheckUtils]: 95: Hoare triple {34115#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:11,540 INFO L290 TraceCheckUtils]: 94: Hoare triple {34115#false} assume !(~j~0 < ~r~0); {34115#false} is VALID [2022-04-27 10:48:11,540 INFO L290 TraceCheckUtils]: 93: Hoare triple {34614#(not (<= main_~j~0 main_~r~0))} assume !!(~j~0 <= ~r~0); {34115#false} is VALID [2022-04-27 10:48:11,541 INFO L290 TraceCheckUtils]: 92: Hoare triple {34618#(< main_~r~0 (* main_~j~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {34614#(not (<= main_~j~0 main_~r~0))} is VALID [2022-04-27 10:48:11,541 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {34114#true} {34618#(< main_~r~0 (* main_~j~0 2))} #128#return; {34618#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:11,541 INFO L290 TraceCheckUtils]: 90: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,541 INFO L290 TraceCheckUtils]: 89: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,542 INFO L290 TraceCheckUtils]: 88: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,542 INFO L272 TraceCheckUtils]: 87: Hoare triple {34618#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:11,544 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {34114#true} {34618#(< main_~r~0 (* main_~j~0 2))} #126#return; {34618#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:11,544 INFO L290 TraceCheckUtils]: 85: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,544 INFO L290 TraceCheckUtils]: 84: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,544 INFO L290 TraceCheckUtils]: 83: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,544 INFO L272 TraceCheckUtils]: 82: Hoare triple {34618#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:11,545 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {34114#true} {34618#(< main_~r~0 (* main_~j~0 2))} #124#return; {34618#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:11,545 INFO L290 TraceCheckUtils]: 80: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,545 INFO L290 TraceCheckUtils]: 79: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,545 INFO L290 TraceCheckUtils]: 78: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,545 INFO L272 TraceCheckUtils]: 77: Hoare triple {34618#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:11,545 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {34114#true} {34618#(< main_~r~0 (* main_~j~0 2))} #122#return; {34618#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:11,546 INFO L290 TraceCheckUtils]: 75: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,546 INFO L290 TraceCheckUtils]: 74: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,546 INFO L290 TraceCheckUtils]: 73: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,546 INFO L272 TraceCheckUtils]: 72: Hoare triple {34618#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:11,546 INFO L290 TraceCheckUtils]: 71: Hoare triple {34618#(< main_~r~0 (* main_~j~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {34618#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:11,546 INFO L290 TraceCheckUtils]: 70: Hoare triple {34618#(< main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {34618#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:11,547 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {34114#true} {34618#(< main_~r~0 (* main_~j~0 2))} #120#return; {34618#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:11,547 INFO L290 TraceCheckUtils]: 68: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,547 INFO L290 TraceCheckUtils]: 67: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,547 INFO L290 TraceCheckUtils]: 66: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,547 INFO L272 TraceCheckUtils]: 65: Hoare triple {34618#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:11,548 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {34114#true} {34618#(< main_~r~0 (* main_~j~0 2))} #118#return; {34618#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:11,548 INFO L290 TraceCheckUtils]: 63: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,548 INFO L290 TraceCheckUtils]: 62: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,548 INFO L290 TraceCheckUtils]: 61: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,548 INFO L272 TraceCheckUtils]: 60: Hoare triple {34618#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:11,549 INFO L290 TraceCheckUtils]: 59: Hoare triple {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {34618#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:48:11,549 INFO L290 TraceCheckUtils]: 58: Hoare triple {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:48:11,549 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {34114#true} {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #116#return; {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:48:11,549 INFO L290 TraceCheckUtils]: 56: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,549 INFO L290 TraceCheckUtils]: 55: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,550 INFO L290 TraceCheckUtils]: 54: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,550 INFO L272 TraceCheckUtils]: 53: Hoare triple {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:11,550 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {34114#true} {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #114#return; {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:48:11,550 INFO L290 TraceCheckUtils]: 51: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,550 INFO L290 TraceCheckUtils]: 50: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,550 INFO L290 TraceCheckUtils]: 49: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,550 INFO L272 TraceCheckUtils]: 48: Hoare triple {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:11,551 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34114#true} {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #112#return; {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:48:11,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,551 INFO L272 TraceCheckUtils]: 43: Hoare triple {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:11,551 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {34114#true} {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #110#return; {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:48:11,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,551 INFO L272 TraceCheckUtils]: 38: Hoare triple {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {34114#true} is VALID [2022-04-27 10:48:11,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume ~j~0 < ~r~0; {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:48:11,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume !!(~j~0 <= ~r~0); {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:48:11,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {34791#(< (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; {34718#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:48:11,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {34795#(< (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; {34791#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~l~0 2) 2))} is VALID [2022-04-27 10:48:11,553 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {34114#true} {34795#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} #132#return; {34795#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} is VALID [2022-04-27 10:48:11,554 INFO L290 TraceCheckUtils]: 32: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,554 INFO L272 TraceCheckUtils]: 29: Hoare triple {34795#(< (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)); {34114#true} is VALID [2022-04-27 10:48:11,566 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {34114#true} {34795#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} #130#return; {34795#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} is VALID [2022-04-27 10:48:11,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,566 INFO L272 TraceCheckUtils]: 24: Hoare triple {34795#(< (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)); {34114#true} is VALID [2022-04-27 10:48:11,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {34829#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume ~l~0 > 1; {34795#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} is VALID [2022-04-27 10:48:11,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {34829#(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; {34829#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-27 10:48:11,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {34829#(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; {34829#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-27 10:48:11,568 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {34114#true} {34829#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} #120#return; {34829#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-27 10:48:11,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,568 INFO L272 TraceCheckUtils]: 16: Hoare triple {34829#(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)); {34114#true} is VALID [2022-04-27 10:48:11,568 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34114#true} {34829#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} #118#return; {34829#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-27 10:48:11,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {34114#true} assume !(0 == ~cond); {34114#true} is VALID [2022-04-27 10:48:11,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {34114#true} ~cond := #in~cond; {34114#true} is VALID [2022-04-27 10:48:11,569 INFO L272 TraceCheckUtils]: 11: Hoare triple {34829#(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)); {34114#true} is VALID [2022-04-27 10:48:11,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {34869#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} assume !(~j~0 < ~r~0); {34829#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-27 10:48:11,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {34869#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} assume !!(~j~0 <= ~r~0); {34869#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} is VALID [2022-04-27 10:48:11,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {34114#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {34869#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} is VALID [2022-04-27 10:48:11,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {34114#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {34114#true} is VALID [2022-04-27 10:48:11,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {34114#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; {34114#true} is VALID [2022-04-27 10:48:11,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {34114#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; {34114#true} is VALID [2022-04-27 10:48:11,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {34114#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {34114#true} is VALID [2022-04-27 10:48:11,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34114#true} {34114#true} #138#return; {34114#true} is VALID [2022-04-27 10:48:11,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {34114#true} assume true; {34114#true} is VALID [2022-04-27 10:48:11,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {34114#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); {34114#true} is VALID [2022-04-27 10:48:11,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {34114#true} call ULTIMATE.init(); {34114#true} is VALID [2022-04-27 10:48:11,571 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-27 10:48:11,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92695375] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:48:11,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:48:11,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-04-27 10:48:11,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018347984] [2022-04-27 10:48:11,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:48:11,572 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 13 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (47), 13 states have call predecessors, (47), 13 states have call successors, (47) Word has length 116 [2022-04-27 10:48:11,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:48:11,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 13 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (47), 13 states have call predecessors, (47), 13 states have call successors, (47) [2022-04-27 10:48:11,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:48:11,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 10:48:11,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:48:11,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 10:48:11,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-04-27 10:48:11,692 INFO L87 Difference]: Start difference. First operand 317 states and 485 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 13 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (47), 13 states have call predecessors, (47), 13 states have call successors, (47) [2022-04-27 10:48:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:27,969 INFO L93 Difference]: Finished difference Result 1048 states and 1665 transitions. [2022-04-27 10:48:27,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-27 10:48:27,970 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 13 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (47), 13 states have call predecessors, (47), 13 states have call successors, (47) Word has length 116 [2022-04-27 10:48:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:48:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 13 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (47), 13 states have call predecessors, (47), 13 states have call successors, (47) [2022-04-27 10:48:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 822 transitions. [2022-04-27 10:48:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 13 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (47), 13 states have call predecessors, (47), 13 states have call successors, (47) [2022-04-27 10:48:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 822 transitions. [2022-04-27 10:48:28,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 822 transitions. [2022-04-27 10:48:28,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 822 edges. 822 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:48:28,889 INFO L225 Difference]: With dead ends: 1048 [2022-04-27 10:48:28,890 INFO L226 Difference]: Without dead ends: 602 [2022-04-27 10:48:28,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2071 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1625, Invalid=5181, Unknown=0, NotChecked=0, Total=6806 [2022-04-27 10:48:28,892 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 395 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 3290 mSolverCounterSat, 1547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 4837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1547 IncrementalHoareTripleChecker+Valid, 3290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:48:28,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 172 Invalid, 4837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1547 Valid, 3290 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-04-27 10:48:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-04-27 10:48:31,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 468. [2022-04-27 10:48:31,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:48:31,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 602 states. Second operand has 468 states, 208 states have (on average 1.2836538461538463) internal successors, (267), 229 states have internal predecessors, (267), 242 states have call successors, (242), 18 states have call predecessors, (242), 17 states have return successors, (241), 220 states have call predecessors, (241), 241 states have call successors, (241) [2022-04-27 10:48:31,224 INFO L74 IsIncluded]: Start isIncluded. First operand 602 states. Second operand has 468 states, 208 states have (on average 1.2836538461538463) internal successors, (267), 229 states have internal predecessors, (267), 242 states have call successors, (242), 18 states have call predecessors, (242), 17 states have return successors, (241), 220 states have call predecessors, (241), 241 states have call successors, (241) [2022-04-27 10:48:31,224 INFO L87 Difference]: Start difference. First operand 602 states. Second operand has 468 states, 208 states have (on average 1.2836538461538463) internal successors, (267), 229 states have internal predecessors, (267), 242 states have call successors, (242), 18 states have call predecessors, (242), 17 states have return successors, (241), 220 states have call predecessors, (241), 241 states have call successors, (241) [2022-04-27 10:48:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:31,244 INFO L93 Difference]: Finished difference Result 602 states and 949 transitions. [2022-04-27 10:48:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 949 transitions. [2022-04-27 10:48:31,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:31,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:31,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 468 states, 208 states have (on average 1.2836538461538463) internal successors, (267), 229 states have internal predecessors, (267), 242 states have call successors, (242), 18 states have call predecessors, (242), 17 states have return successors, (241), 220 states have call predecessors, (241), 241 states have call successors, (241) Second operand 602 states. [2022-04-27 10:48:31,247 INFO L87 Difference]: Start difference. First operand has 468 states, 208 states have (on average 1.2836538461538463) internal successors, (267), 229 states have internal predecessors, (267), 242 states have call successors, (242), 18 states have call predecessors, (242), 17 states have return successors, (241), 220 states have call predecessors, (241), 241 states have call successors, (241) Second operand 602 states. [2022-04-27 10:48:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:31,266 INFO L93 Difference]: Finished difference Result 602 states and 949 transitions. [2022-04-27 10:48:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 949 transitions. [2022-04-27 10:48:31,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:31,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:31,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:48:31,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:48:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 208 states have (on average 1.2836538461538463) internal successors, (267), 229 states have internal predecessors, (267), 242 states have call successors, (242), 18 states have call predecessors, (242), 17 states have return successors, (241), 220 states have call predecessors, (241), 241 states have call successors, (241) [2022-04-27 10:48:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 750 transitions. [2022-04-27 10:48:31,286 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 750 transitions. Word has length 116 [2022-04-27 10:48:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:48:31,286 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 750 transitions. [2022-04-27 10:48:31,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 13 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (47), 13 states have call predecessors, (47), 13 states have call successors, (47) [2022-04-27 10:48:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 750 transitions. [2022-04-27 10:48:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-27 10:48:31,287 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:48:31,287 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:48:31,304 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-27 10:48:31,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:48:31,505 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:48:31,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:48:31,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1934725046, now seen corresponding path program 1 times [2022-04-27 10:48:31,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:48:31,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726545285] [2022-04-27 10:48:31,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:31,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:48:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:48:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {38688#(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); {38607#true} is VALID [2022-04-27 10:48:31,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38607#true} {38607#true} #138#return; {38607#true} is VALID [2022-04-27 10:48:31,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:48:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38614#(<= (* main_~l~0 2) main_~n~0)} #118#return; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:48:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38614#(<= (* main_~l~0 2) main_~n~0)} #120#return; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 10:48:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38614#(<= (* main_~l~0 2) main_~n~0)} #130#return; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-27 10:48:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38614#(<= (* main_~l~0 2) main_~n~0)} #132#return; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 10:48:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #110#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-27 10:48:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #112#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 10:48:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #114#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-27 10:48:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #116#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-27 10:48:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #118#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-27 10:48:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #120#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-27 10:48:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #122#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-27 10:48:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #124#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-27 10:48:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #126#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-27 10:48:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #128#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-27 10:48:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38673#(<= (+ main_~i~0 2) main_~n~0)} #118#return; {38673#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-27 10:48:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38673#(<= (+ main_~i~0 2) main_~n~0)} #120#return; {38673#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-04-27 10:48:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38673#(<= (+ main_~i~0 2) main_~n~0)} #122#return; {38673#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {38607#true} call ULTIMATE.init(); {38688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:48:31,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {38688#(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); {38607#true} is VALID [2022-04-27 10:48:31,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38607#true} #138#return; {38607#true} is VALID [2022-04-27 10:48:31,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {38607#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {38607#true} is VALID [2022-04-27 10:48:31,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {38607#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; {38607#true} is VALID [2022-04-27 10:48:31,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {38607#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; {38612#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:48:31,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {38612#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {38612#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:48:31,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {38612#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {38613#(<= (+ (* main_~l~0 2) main_~r~0) (+ main_~n~0 main_~j~0))} is VALID [2022-04-27 10:48:31,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {38613#(<= (+ (* main_~l~0 2) main_~r~0) (+ main_~n~0 main_~j~0))} assume !!(~j~0 <= ~r~0); {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} assume !(~j~0 < ~r~0); {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,641 INFO L272 TraceCheckUtils]: 11: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,642 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38607#true} {38614#(<= (* main_~l~0 2) main_~n~0)} #118#return; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,642 INFO L272 TraceCheckUtils]: 16: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,642 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {38607#true} {38614#(<= (* main_~l~0 2) main_~n~0)} #120#return; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} assume ~l~0 > 1; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,643 INFO L272 TraceCheckUtils]: 24: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,644 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {38607#true} {38614#(<= (* main_~l~0 2) main_~n~0)} #130#return; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,644 INFO L272 TraceCheckUtils]: 29: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,647 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {38607#true} {38614#(<= (* main_~l~0 2) main_~n~0)} #132#return; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {38631#(<= (+ (* main_~l~0 2) 2) main_~n~0)} is VALID [2022-04-27 10:48:31,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {38631#(<= (+ (* main_~l~0 2) 2) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~r~0); {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} assume ~j~0 < ~r~0; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,649 INFO L272 TraceCheckUtils]: 38: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,652 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #110#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,652 INFO L272 TraceCheckUtils]: 43: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,652 INFO L290 TraceCheckUtils]: 44: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,652 INFO L290 TraceCheckUtils]: 45: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,652 INFO L290 TraceCheckUtils]: 46: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,652 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #112#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,652 INFO L272 TraceCheckUtils]: 48: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,652 INFO L290 TraceCheckUtils]: 49: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,652 INFO L290 TraceCheckUtils]: 50: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,653 INFO L290 TraceCheckUtils]: 51: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,653 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #114#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,653 INFO L272 TraceCheckUtils]: 53: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,653 INFO L290 TraceCheckUtils]: 55: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,653 INFO L290 TraceCheckUtils]: 56: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,653 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #116#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,654 INFO L290 TraceCheckUtils]: 58: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,654 INFO L290 TraceCheckUtils]: 59: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,654 INFO L272 TraceCheckUtils]: 60: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,654 INFO L290 TraceCheckUtils]: 61: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,654 INFO L290 TraceCheckUtils]: 62: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,654 INFO L290 TraceCheckUtils]: 63: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,655 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #118#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,655 INFO L272 TraceCheckUtils]: 65: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,655 INFO L290 TraceCheckUtils]: 66: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,655 INFO L290 TraceCheckUtils]: 67: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,655 INFO L290 TraceCheckUtils]: 68: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,655 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #120#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,656 INFO L290 TraceCheckUtils]: 70: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,656 INFO L290 TraceCheckUtils]: 71: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,656 INFO L272 TraceCheckUtils]: 72: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,656 INFO L290 TraceCheckUtils]: 73: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,656 INFO L290 TraceCheckUtils]: 74: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,656 INFO L290 TraceCheckUtils]: 75: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,656 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #122#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,656 INFO L272 TraceCheckUtils]: 77: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,657 INFO L290 TraceCheckUtils]: 78: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,657 INFO L290 TraceCheckUtils]: 79: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,657 INFO L290 TraceCheckUtils]: 80: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,657 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #124#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,657 INFO L272 TraceCheckUtils]: 82: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,657 INFO L290 TraceCheckUtils]: 83: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,657 INFO L290 TraceCheckUtils]: 84: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,657 INFO L290 TraceCheckUtils]: 85: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,658 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #126#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,658 INFO L272 TraceCheckUtils]: 87: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,658 INFO L290 TraceCheckUtils]: 88: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,658 INFO L290 TraceCheckUtils]: 89: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,658 INFO L290 TraceCheckUtils]: 90: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,658 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {38607#true} {38632#(<= (+ main_~j~0 2) main_~n~0)} #128#return; {38632#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,659 INFO L290 TraceCheckUtils]: 92: Hoare triple {38632#(<= (+ main_~j~0 2) main_~n~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {38673#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,659 INFO L290 TraceCheckUtils]: 93: Hoare triple {38673#(<= (+ main_~i~0 2) main_~n~0)} assume !!(~j~0 <= ~r~0); {38673#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,659 INFO L290 TraceCheckUtils]: 94: Hoare triple {38673#(<= (+ main_~i~0 2) main_~n~0)} assume !(~j~0 < ~r~0); {38673#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,659 INFO L272 TraceCheckUtils]: 95: Hoare triple {38673#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,659 INFO L290 TraceCheckUtils]: 96: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,659 INFO L290 TraceCheckUtils]: 97: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,659 INFO L290 TraceCheckUtils]: 98: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,660 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {38607#true} {38673#(<= (+ main_~i~0 2) main_~n~0)} #118#return; {38673#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,660 INFO L272 TraceCheckUtils]: 100: Hoare triple {38673#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,660 INFO L290 TraceCheckUtils]: 101: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,660 INFO L290 TraceCheckUtils]: 102: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,660 INFO L290 TraceCheckUtils]: 103: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,660 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {38607#true} {38673#(<= (+ main_~i~0 2) main_~n~0)} #120#return; {38673#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,661 INFO L290 TraceCheckUtils]: 105: Hoare triple {38673#(<= (+ main_~i~0 2) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38673#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,661 INFO L290 TraceCheckUtils]: 106: Hoare triple {38673#(<= (+ main_~i~0 2) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {38673#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,661 INFO L272 TraceCheckUtils]: 107: Hoare triple {38673#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:31,661 INFO L290 TraceCheckUtils]: 108: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:31,661 INFO L290 TraceCheckUtils]: 109: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:31,661 INFO L290 TraceCheckUtils]: 110: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:31,662 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {38607#true} {38673#(<= (+ main_~i~0 2) main_~n~0)} #122#return; {38673#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-27 10:48:31,662 INFO L272 TraceCheckUtils]: 112: Hoare triple {38673#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {38686#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:48:31,662 INFO L290 TraceCheckUtils]: 113: Hoare triple {38686#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {38687#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:48:31,663 INFO L290 TraceCheckUtils]: 114: Hoare triple {38687#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {38608#false} is VALID [2022-04-27 10:48:31,663 INFO L290 TraceCheckUtils]: 115: Hoare triple {38608#false} assume !false; {38608#false} is VALID [2022-04-27 10:48:31,663 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-27 10:48:31,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:48:31,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726545285] [2022-04-27 10:48:31,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726545285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:48:31,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728000311] [2022-04-27 10:48:31,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:31,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:48:31,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:48:31,664 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-27 10:48:31,665 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-27 10:48:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 10:48:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:31,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:48:34,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {38607#true} call ULTIMATE.init(); {38607#true} is VALID [2022-04-27 10:48:34,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#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); {38607#true} is VALID [2022-04-27 10:48:34,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38607#true} #138#return; {38607#true} is VALID [2022-04-27 10:48:34,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {38607#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {38607#true} is VALID [2022-04-27 10:48:34,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {38607#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; {38607#true} is VALID [2022-04-27 10:48:34,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {38607#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; {38612#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:48:34,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {38612#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {38612#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:48:34,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {38612#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {38716#(and (<= (* main_~l~0 2) main_~j~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-27 10:48:34,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {38716#(and (<= (* main_~l~0 2) main_~j~0) (<= main_~r~0 main_~n~0))} assume !!(~j~0 <= ~r~0); {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:34,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} assume !(~j~0 < ~r~0); {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:34,533 INFO L272 TraceCheckUtils]: 11: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,533 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38607#true} {38614#(<= (* main_~l~0 2) main_~n~0)} #118#return; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:34,534 INFO L272 TraceCheckUtils]: 16: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,534 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {38607#true} {38614#(<= (* main_~l~0 2) main_~n~0)} #120#return; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:34,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:34,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:34,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} assume ~l~0 > 1; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:34,535 INFO L272 TraceCheckUtils]: 24: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,536 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {38607#true} {38614#(<= (* main_~l~0 2) main_~n~0)} #130#return; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:34,536 INFO L272 TraceCheckUtils]: 29: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,536 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {38607#true} {38614#(<= (* main_~l~0 2) main_~n~0)} #132#return; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:34,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {38631#(<= (+ (* main_~l~0 2) 2) main_~n~0)} is VALID [2022-04-27 10:48:34,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {38631#(<= (+ (* main_~l~0 2) 2) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !!(~j~0 <= ~r~0); {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume ~j~0 < ~r~0; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,539 INFO L272 TraceCheckUtils]: 38: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,540 INFO L290 TraceCheckUtils]: 41: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,542 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {38607#true} {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #110#return; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,543 INFO L272 TraceCheckUtils]: 43: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,543 INFO L290 TraceCheckUtils]: 44: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,544 INFO L290 TraceCheckUtils]: 45: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,544 INFO L290 TraceCheckUtils]: 46: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,544 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {38607#true} {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #112#return; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,544 INFO L272 TraceCheckUtils]: 48: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,545 INFO L290 TraceCheckUtils]: 50: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,545 INFO L290 TraceCheckUtils]: 51: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,545 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {38607#true} {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #114#return; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,545 INFO L272 TraceCheckUtils]: 53: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,546 INFO L290 TraceCheckUtils]: 55: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,546 INFO L290 TraceCheckUtils]: 56: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,546 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {38607#true} {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #116#return; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,546 INFO L290 TraceCheckUtils]: 58: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,547 INFO L290 TraceCheckUtils]: 59: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !(0 != #t~nondet4);havoc #t~nondet4; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,547 INFO L272 TraceCheckUtils]: 60: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,547 INFO L290 TraceCheckUtils]: 61: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,547 INFO L290 TraceCheckUtils]: 62: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,547 INFO L290 TraceCheckUtils]: 63: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,548 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {38607#true} {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #118#return; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,548 INFO L272 TraceCheckUtils]: 65: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,548 INFO L290 TraceCheckUtils]: 66: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,548 INFO L290 TraceCheckUtils]: 67: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,548 INFO L290 TraceCheckUtils]: 68: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,548 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {38607#true} {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #120#return; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,549 INFO L290 TraceCheckUtils]: 70: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,549 INFO L290 TraceCheckUtils]: 71: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,549 INFO L272 TraceCheckUtils]: 72: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,549 INFO L290 TraceCheckUtils]: 73: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,549 INFO L290 TraceCheckUtils]: 74: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,549 INFO L290 TraceCheckUtils]: 75: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,550 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {38607#true} {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #122#return; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,550 INFO L272 TraceCheckUtils]: 77: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,550 INFO L290 TraceCheckUtils]: 78: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,550 INFO L290 TraceCheckUtils]: 79: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,550 INFO L290 TraceCheckUtils]: 80: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,550 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {38607#true} {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #124#return; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,550 INFO L272 TraceCheckUtils]: 82: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,550 INFO L290 TraceCheckUtils]: 83: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,550 INFO L290 TraceCheckUtils]: 84: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,550 INFO L290 TraceCheckUtils]: 85: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,551 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {38607#true} {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #126#return; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,551 INFO L272 TraceCheckUtils]: 87: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,551 INFO L290 TraceCheckUtils]: 88: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,551 INFO L290 TraceCheckUtils]: 89: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,551 INFO L290 TraceCheckUtils]: 90: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,551 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {38607#true} {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #128#return; {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,552 INFO L290 TraceCheckUtils]: 92: Hoare triple {38798#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,552 INFO L290 TraceCheckUtils]: 93: Hoare triple {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !!(~j~0 <= ~r~0); {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,552 INFO L290 TraceCheckUtils]: 94: Hoare triple {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !(~j~0 < ~r~0); {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,552 INFO L272 TraceCheckUtils]: 95: Hoare triple {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,552 INFO L290 TraceCheckUtils]: 96: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,552 INFO L290 TraceCheckUtils]: 97: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,553 INFO L290 TraceCheckUtils]: 98: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,553 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {38607#true} {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #118#return; {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,553 INFO L272 TraceCheckUtils]: 100: Hoare triple {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,553 INFO L290 TraceCheckUtils]: 101: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,553 INFO L290 TraceCheckUtils]: 102: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,553 INFO L290 TraceCheckUtils]: 103: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,553 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {38607#true} {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #120#return; {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,554 INFO L290 TraceCheckUtils]: 105: Hoare triple {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,554 INFO L290 TraceCheckUtils]: 106: Hoare triple {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,554 INFO L272 TraceCheckUtils]: 107: Hoare triple {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:34,554 INFO L290 TraceCheckUtils]: 108: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:34,554 INFO L290 TraceCheckUtils]: 109: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:34,554 INFO L290 TraceCheckUtils]: 110: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:34,580 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {38607#true} {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #122#return; {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-27 10:48:34,581 INFO L272 TraceCheckUtils]: 112: Hoare triple {38970#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {39031#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:48:34,582 INFO L290 TraceCheckUtils]: 113: Hoare triple {39031#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {39035#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:48:34,582 INFO L290 TraceCheckUtils]: 114: Hoare triple {39035#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {38608#false} is VALID [2022-04-27 10:48:34,582 INFO L290 TraceCheckUtils]: 115: Hoare triple {38608#false} assume !false; {38608#false} is VALID [2022-04-27 10:48:34,582 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-27 10:48:34,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:48:35,245 INFO L290 TraceCheckUtils]: 115: Hoare triple {38608#false} assume !false; {38608#false} is VALID [2022-04-27 10:48:35,245 INFO L290 TraceCheckUtils]: 114: Hoare triple {39035#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {38608#false} is VALID [2022-04-27 10:48:35,246 INFO L290 TraceCheckUtils]: 113: Hoare triple {39031#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {39035#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:48:35,246 INFO L272 TraceCheckUtils]: 112: Hoare triple {39051#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {39031#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:48:35,246 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {38607#true} {39051#(<= main_~i~0 main_~n~0)} #122#return; {39051#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:48:35,246 INFO L290 TraceCheckUtils]: 110: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,247 INFO L290 TraceCheckUtils]: 109: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,247 INFO L290 TraceCheckUtils]: 108: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,247 INFO L272 TraceCheckUtils]: 107: Hoare triple {39051#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,247 INFO L290 TraceCheckUtils]: 106: Hoare triple {39051#(<= main_~i~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {39051#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:48:35,247 INFO L290 TraceCheckUtils]: 105: Hoare triple {39051#(<= main_~i~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {39051#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:48:35,248 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {38607#true} {39051#(<= main_~i~0 main_~n~0)} #120#return; {39051#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:48:35,248 INFO L290 TraceCheckUtils]: 103: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,248 INFO L290 TraceCheckUtils]: 102: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,248 INFO L290 TraceCheckUtils]: 101: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,248 INFO L272 TraceCheckUtils]: 100: Hoare triple {39051#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,248 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {38607#true} {39051#(<= main_~i~0 main_~n~0)} #118#return; {39051#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:48:35,248 INFO L290 TraceCheckUtils]: 98: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,248 INFO L290 TraceCheckUtils]: 97: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,248 INFO L290 TraceCheckUtils]: 96: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,248 INFO L272 TraceCheckUtils]: 95: Hoare triple {39051#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,249 INFO L290 TraceCheckUtils]: 94: Hoare triple {39051#(<= main_~i~0 main_~n~0)} assume !(~j~0 < ~r~0); {39051#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:48:35,249 INFO L290 TraceCheckUtils]: 93: Hoare triple {39051#(<= main_~i~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {39051#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:48:35,249 INFO L290 TraceCheckUtils]: 92: Hoare triple {39112#(<= main_~j~0 main_~n~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {39051#(<= main_~i~0 main_~n~0)} is VALID [2022-04-27 10:48:35,250 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {38607#true} {39112#(<= main_~j~0 main_~n~0)} #128#return; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,250 INFO L290 TraceCheckUtils]: 90: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,250 INFO L290 TraceCheckUtils]: 89: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,250 INFO L290 TraceCheckUtils]: 88: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,250 INFO L272 TraceCheckUtils]: 87: Hoare triple {39112#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,250 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {38607#true} {39112#(<= main_~j~0 main_~n~0)} #126#return; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,250 INFO L290 TraceCheckUtils]: 85: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,250 INFO L290 TraceCheckUtils]: 84: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,250 INFO L290 TraceCheckUtils]: 83: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,250 INFO L272 TraceCheckUtils]: 82: Hoare triple {39112#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,251 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {38607#true} {39112#(<= main_~j~0 main_~n~0)} #124#return; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,251 INFO L290 TraceCheckUtils]: 80: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,251 INFO L290 TraceCheckUtils]: 79: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,251 INFO L290 TraceCheckUtils]: 78: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,251 INFO L272 TraceCheckUtils]: 77: Hoare triple {39112#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,251 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {38607#true} {39112#(<= main_~j~0 main_~n~0)} #122#return; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,252 INFO L290 TraceCheckUtils]: 75: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,252 INFO L290 TraceCheckUtils]: 74: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,252 INFO L290 TraceCheckUtils]: 73: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,252 INFO L272 TraceCheckUtils]: 72: Hoare triple {39112#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,252 INFO L290 TraceCheckUtils]: 71: Hoare triple {39112#(<= main_~j~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,252 INFO L290 TraceCheckUtils]: 70: Hoare triple {39112#(<= main_~j~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,253 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {38607#true} {39112#(<= main_~j~0 main_~n~0)} #120#return; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,253 INFO L290 TraceCheckUtils]: 68: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,253 INFO L290 TraceCheckUtils]: 67: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,253 INFO L290 TraceCheckUtils]: 66: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,253 INFO L272 TraceCheckUtils]: 65: Hoare triple {39112#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,253 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {38607#true} {39112#(<= main_~j~0 main_~n~0)} #118#return; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,253 INFO L290 TraceCheckUtils]: 63: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,253 INFO L290 TraceCheckUtils]: 62: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,253 INFO L290 TraceCheckUtils]: 61: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,253 INFO L272 TraceCheckUtils]: 60: Hoare triple {39112#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,255 INFO L290 TraceCheckUtils]: 59: Hoare triple {39112#(<= main_~j~0 main_~n~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {39112#(<= main_~j~0 main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,255 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {38607#true} {39112#(<= main_~j~0 main_~n~0)} #116#return; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,255 INFO L290 TraceCheckUtils]: 56: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,255 INFO L290 TraceCheckUtils]: 55: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,255 INFO L290 TraceCheckUtils]: 54: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,255 INFO L272 TraceCheckUtils]: 53: Hoare triple {39112#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,256 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {38607#true} {39112#(<= main_~j~0 main_~n~0)} #114#return; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,256 INFO L290 TraceCheckUtils]: 51: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,256 INFO L290 TraceCheckUtils]: 50: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,256 INFO L272 TraceCheckUtils]: 48: Hoare triple {39112#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,256 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {38607#true} {39112#(<= main_~j~0 main_~n~0)} #112#return; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,256 INFO L290 TraceCheckUtils]: 46: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,257 INFO L272 TraceCheckUtils]: 43: Hoare triple {39112#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,257 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {38607#true} {39112#(<= main_~j~0 main_~n~0)} #110#return; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,257 INFO L290 TraceCheckUtils]: 41: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,257 INFO L272 TraceCheckUtils]: 38: Hoare triple {39112#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {39112#(<= main_~j~0 main_~n~0)} assume ~j~0 < ~r~0; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {39112#(<= main_~j~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,258 INFO L290 TraceCheckUtils]: 35: Hoare triple {38614#(<= (* main_~l~0 2) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {39112#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:48:35,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {38614#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-27 10:48:35,259 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {38607#true} {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} #132#return; {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-27 10:48:35,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,259 INFO L272 TraceCheckUtils]: 29: Hoare triple {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,260 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {38607#true} {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} #130#return; {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-27 10:48:35,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,260 INFO L272 TraceCheckUtils]: 24: Hoare triple {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} assume ~l~0 > 1; {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-27 10:48:35,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} assume 0 != #t~nondet5;havoc #t~nondet5; {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-27 10:48:35,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-27 10:48:35,261 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {38607#true} {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} #120#return; {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-27 10:48:35,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,261 INFO L272 TraceCheckUtils]: 16: Hoare triple {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,262 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38607#true} {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} #118#return; {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-27 10:48:35,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {38607#true} assume !(0 == ~cond); {38607#true} is VALID [2022-04-27 10:48:35,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {38607#true} ~cond := #in~cond; {38607#true} is VALID [2022-04-27 10:48:35,262 INFO L272 TraceCheckUtils]: 11: Hoare triple {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {38607#true} is VALID [2022-04-27 10:48:35,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} assume !(~j~0 < ~r~0); {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-27 10:48:35,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {39363#(or (<= main_~l~0 (+ (div main_~n~0 2) 1)) (not (<= main_~j~0 main_~r~0)))} assume !!(~j~0 <= ~r~0); {39287#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-27 10:48:35,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {39367#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ 2 (div main_~n~0 2)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {39363#(or (<= main_~l~0 (+ (div main_~n~0 2) 1)) (not (<= main_~j~0 main_~r~0)))} is VALID [2022-04-27 10:48:35,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {39367#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ 2 (div main_~n~0 2)))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {39367#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ 2 (div main_~n~0 2)))} is VALID [2022-04-27 10:48:35,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {38607#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; {39367#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ 2 (div main_~n~0 2)))} is VALID [2022-04-27 10:48:35,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {38607#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; {38607#true} is VALID [2022-04-27 10:48:35,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {38607#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {38607#true} is VALID [2022-04-27 10:48:35,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38607#true} {38607#true} #138#return; {38607#true} is VALID [2022-04-27 10:48:35,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {38607#true} assume true; {38607#true} is VALID [2022-04-27 10:48:35,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {38607#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); {38607#true} is VALID [2022-04-27 10:48:35,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {38607#true} call ULTIMATE.init(); {38607#true} is VALID [2022-04-27 10:48:35,265 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-27 10:48:35,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728000311] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:48:35,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:48:35,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2022-04-27 10:48:35,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747510934] [2022-04-27 10:48:35,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:48:35,266 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 9 states have call successors, (53), 4 states have call predecessors, (53), 1 states have return successors, (48), 9 states have call predecessors, (48), 9 states have call successors, (48) Word has length 116 [2022-04-27 10:48:35,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:48:35,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 9 states have call successors, (53), 4 states have call predecessors, (53), 1 states have return successors, (48), 9 states have call predecessors, (48), 9 states have call successors, (48) [2022-04-27 10:48:35,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:48:35,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 10:48:35,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:48:35,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 10:48:35,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-04-27 10:48:35,399 INFO L87 Difference]: Start difference. First operand 468 states and 750 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 9 states have call successors, (53), 4 states have call predecessors, (53), 1 states have return successors, (48), 9 states have call predecessors, (48), 9 states have call successors, (48) [2022-04-27 10:48:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:49,879 INFO L93 Difference]: Finished difference Result 1025 states and 1641 transitions. [2022-04-27 10:48:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 10:48:49,879 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 9 states have call successors, (53), 4 states have call predecessors, (53), 1 states have return successors, (48), 9 states have call predecessors, (48), 9 states have call successors, (48) Word has length 116 [2022-04-27 10:48:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:48:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 9 states have call successors, (53), 4 states have call predecessors, (53), 1 states have return successors, (48), 9 states have call predecessors, (48), 9 states have call successors, (48) [2022-04-27 10:48:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 510 transitions. [2022-04-27 10:48:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 9 states have call successors, (53), 4 states have call predecessors, (53), 1 states have return successors, (48), 9 states have call predecessors, (48), 9 states have call successors, (48) [2022-04-27 10:48:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 510 transitions. [2022-04-27 10:48:49,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 510 transitions. [2022-04-27 10:48:50,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 510 edges. 510 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:48:50,459 INFO L225 Difference]: With dead ends: 1025 [2022-04-27 10:48:50,459 INFO L226 Difference]: Without dead ends: 902 [2022-04-27 10:48:50,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=509, Invalid=1653, Unknown=0, NotChecked=0, Total=2162 [2022-04-27 10:48:50,460 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 536 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 1719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 3715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1719 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:48:50,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 109 Invalid, 3715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1719 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-27 10:48:50,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2022-04-27 10:48:53,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 522. [2022-04-27 10:48:53,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:48:53,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 902 states. Second operand has 522 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 257 states have internal predecessors, (302), 270 states have call successors, (270), 21 states have call predecessors, (270), 20 states have return successors, (269), 243 states have call predecessors, (269), 269 states have call successors, (269) [2022-04-27 10:48:53,046 INFO L74 IsIncluded]: Start isIncluded. First operand 902 states. Second operand has 522 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 257 states have internal predecessors, (302), 270 states have call successors, (270), 21 states have call predecessors, (270), 20 states have return successors, (269), 243 states have call predecessors, (269), 269 states have call successors, (269) [2022-04-27 10:48:53,046 INFO L87 Difference]: Start difference. First operand 902 states. Second operand has 522 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 257 states have internal predecessors, (302), 270 states have call successors, (270), 21 states have call predecessors, (270), 20 states have return successors, (269), 243 states have call predecessors, (269), 269 states have call successors, (269) [2022-04-27 10:48:53,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:53,093 INFO L93 Difference]: Finished difference Result 902 states and 1436 transitions. [2022-04-27 10:48:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1436 transitions. [2022-04-27 10:48:53,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:53,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:53,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 522 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 257 states have internal predecessors, (302), 270 states have call successors, (270), 21 states have call predecessors, (270), 20 states have return successors, (269), 243 states have call predecessors, (269), 269 states have call successors, (269) Second operand 902 states. [2022-04-27 10:48:53,097 INFO L87 Difference]: Start difference. First operand has 522 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 257 states have internal predecessors, (302), 270 states have call successors, (270), 21 states have call predecessors, (270), 20 states have return successors, (269), 243 states have call predecessors, (269), 269 states have call successors, (269) Second operand 902 states. [2022-04-27 10:48:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:53,140 INFO L93 Difference]: Finished difference Result 902 states and 1436 transitions. [2022-04-27 10:48:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1436 transitions. [2022-04-27 10:48:53,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:53,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:53,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:48:53,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:48:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 257 states have internal predecessors, (302), 270 states have call successors, (270), 21 states have call predecessors, (270), 20 states have return successors, (269), 243 states have call predecessors, (269), 269 states have call successors, (269) [2022-04-27 10:48:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 841 transitions. [2022-04-27 10:48:53,173 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 841 transitions. Word has length 116 [2022-04-27 10:48:53,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:48:53,173 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 841 transitions. [2022-04-27 10:48:53,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 9 states have call successors, (53), 4 states have call predecessors, (53), 1 states have return successors, (48), 9 states have call predecessors, (48), 9 states have call successors, (48) [2022-04-27 10:48:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 841 transitions. [2022-04-27 10:48:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-04-27 10:48:53,175 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:48:53,175 INFO L195 NwaCegarLoop]: trace histogram [32, 31, 31, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-27 10:48:53,196 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-27 10:48:53,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:48:53,396 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:48:53,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:48:53,397 INFO L85 PathProgramCache]: Analyzing trace with hash 32148683, now seen corresponding path program 2 times [2022-04-27 10:48:53,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:48:53,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763985494] [2022-04-27 10:48:53,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:53,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:48:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:48:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {43817#(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); {43680#true} is VALID [2022-04-27 10:48:53,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43680#true} {43680#true} #138#return; {43680#true} is VALID [2022-04-27 10:48:53,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:48:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #110#return; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:48:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #112#return; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-27 10:48:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #114#return; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 10:48:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #116#return; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-27 10:48:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #118#return; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 10:48:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #120#return; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 10:48:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #130#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-27 10:48:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #132#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-27 10:48:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #110#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-27 10:48:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #112#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-27 10:48:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #114#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-04-27 10:48:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #116#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-27 10:48:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #118#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-27 10:48:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #120#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-27 10:48:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #122#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-04-27 10:48:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #124#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-27 10:48:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #126#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-04-27 10:48:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #128#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-27 10:48:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #110#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-27 10:48:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #112#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-04-27 10:48:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #114#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-04-27 10:48:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #116#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-04-27 10:48:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #118#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-27 10:48:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #120#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-04-27 10:48:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #122#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-04-27 10:48:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #124#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-04-27 10:48:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #126#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-04-27 10:48:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #128#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-04-27 10:48:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43802#(<= (+ main_~i~0 3) main_~n~0)} #118#return; {43802#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-27 10:48:53,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-04-27 10:48:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43802#(<= (+ main_~i~0 3) main_~n~0)} #120#return; {43802#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-27 10:48:53,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-04-27 10:48:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43802#(<= (+ main_~i~0 3) main_~n~0)} #122#return; {43802#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-27 10:48:53,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {43680#true} call ULTIMATE.init(); {43817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:48:53,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {43817#(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); {43680#true} is VALID [2022-04-27 10:48:53,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43680#true} #138#return; {43680#true} is VALID [2022-04-27 10:48:53,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {43680#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {43680#true} is VALID [2022-04-27 10:48:53,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {43680#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; {43680#true} is VALID [2022-04-27 10:48:53,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {43680#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; {43685#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:48:53,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {43685#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {43685#(<= main_~r~0 main_~n~0)} is VALID [2022-04-27 10:48:53,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {43685#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {43686#(<= (+ (* main_~l~0 2) (* main_~r~0 2)) (+ main_~j~0 (* main_~n~0 2)))} is VALID [2022-04-27 10:48:53,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {43686#(<= (+ (* main_~l~0 2) (* main_~r~0 2)) (+ main_~j~0 (* main_~n~0 2)))} assume !!(~j~0 <= ~r~0); {43686#(<= (+ (* main_~l~0 2) (* main_~r~0 2)) (+ main_~j~0 (* main_~n~0 2)))} is VALID [2022-04-27 10:48:53,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {43686#(<= (+ (* main_~l~0 2) (* main_~r~0 2)) (+ main_~j~0 (* main_~n~0 2)))} assume ~j~0 < ~r~0; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,615 INFO L272 TraceCheckUtils]: 11: Hoare triple {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,616 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43680#true} {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #110#return; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,616 INFO L272 TraceCheckUtils]: 16: Hoare triple {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,616 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {43680#true} {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #112#return; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,616 INFO L272 TraceCheckUtils]: 21: Hoare triple {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,617 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {43680#true} {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #114#return; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,617 INFO L272 TraceCheckUtils]: 26: Hoare triple {43687#(<= (+ (* 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)); {43680#true} is VALID [2022-04-27 10:48:53,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,618 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {43680#true} {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #116#return; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,618 INFO L272 TraceCheckUtils]: 33: Hoare triple {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,619 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {43680#true} {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #118#return; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,619 INFO L272 TraceCheckUtils]: 38: Hoare triple {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,619 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {43680#true} {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #120#return; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {43687#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} assume ~l~0 > 1; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,620 INFO L272 TraceCheckUtils]: 46: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,620 INFO L290 TraceCheckUtils]: 47: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,621 INFO L290 TraceCheckUtils]: 49: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,621 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #130#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,621 INFO L272 TraceCheckUtils]: 51: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,621 INFO L290 TraceCheckUtils]: 52: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,621 INFO L290 TraceCheckUtils]: 54: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,622 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #132#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,622 INFO L290 TraceCheckUtils]: 56: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,622 INFO L290 TraceCheckUtils]: 57: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,622 INFO L290 TraceCheckUtils]: 58: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume !!(~j~0 <= ~r~0); {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,623 INFO L290 TraceCheckUtils]: 59: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume ~j~0 < ~r~0; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,623 INFO L272 TraceCheckUtils]: 60: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,623 INFO L290 TraceCheckUtils]: 61: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,623 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #110#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,623 INFO L272 TraceCheckUtils]: 65: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,623 INFO L290 TraceCheckUtils]: 66: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,623 INFO L290 TraceCheckUtils]: 67: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,623 INFO L290 TraceCheckUtils]: 68: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,624 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #112#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,624 INFO L272 TraceCheckUtils]: 70: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,624 INFO L290 TraceCheckUtils]: 71: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,624 INFO L290 TraceCheckUtils]: 72: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,624 INFO L290 TraceCheckUtils]: 73: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,624 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #114#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,624 INFO L272 TraceCheckUtils]: 75: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,625 INFO L290 TraceCheckUtils]: 76: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,625 INFO L290 TraceCheckUtils]: 77: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,625 INFO L290 TraceCheckUtils]: 78: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,625 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #116#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,625 INFO L290 TraceCheckUtils]: 80: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,626 INFO L290 TraceCheckUtils]: 81: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,626 INFO L272 TraceCheckUtils]: 82: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,626 INFO L290 TraceCheckUtils]: 83: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,626 INFO L290 TraceCheckUtils]: 84: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,626 INFO L290 TraceCheckUtils]: 85: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,626 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #118#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,626 INFO L272 TraceCheckUtils]: 87: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,626 INFO L290 TraceCheckUtils]: 88: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,626 INFO L290 TraceCheckUtils]: 89: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,626 INFO L290 TraceCheckUtils]: 90: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,627 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #120#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,627 INFO L290 TraceCheckUtils]: 92: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,627 INFO L290 TraceCheckUtils]: 93: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,627 INFO L272 TraceCheckUtils]: 94: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,627 INFO L290 TraceCheckUtils]: 95: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,627 INFO L290 TraceCheckUtils]: 96: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,628 INFO L290 TraceCheckUtils]: 97: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,628 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #122#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,628 INFO L272 TraceCheckUtils]: 99: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,628 INFO L290 TraceCheckUtils]: 100: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,628 INFO L290 TraceCheckUtils]: 101: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,628 INFO L290 TraceCheckUtils]: 102: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,628 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #124#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,629 INFO L272 TraceCheckUtils]: 104: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,629 INFO L290 TraceCheckUtils]: 105: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,629 INFO L290 TraceCheckUtils]: 106: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,629 INFO L290 TraceCheckUtils]: 107: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,629 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #126#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,629 INFO L272 TraceCheckUtils]: 109: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,629 INFO L290 TraceCheckUtils]: 110: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,629 INFO L290 TraceCheckUtils]: 111: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,629 INFO L290 TraceCheckUtils]: 112: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,630 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #128#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,630 INFO L290 TraceCheckUtils]: 114: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,630 INFO L290 TraceCheckUtils]: 115: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume !!(~j~0 <= ~r~0); {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,630 INFO L290 TraceCheckUtils]: 116: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume ~j~0 < ~r~0; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,631 INFO L272 TraceCheckUtils]: 117: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,631 INFO L290 TraceCheckUtils]: 118: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,631 INFO L290 TraceCheckUtils]: 119: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,631 INFO L290 TraceCheckUtils]: 120: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,631 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #110#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,631 INFO L272 TraceCheckUtils]: 122: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,631 INFO L290 TraceCheckUtils]: 123: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,631 INFO L290 TraceCheckUtils]: 124: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,631 INFO L290 TraceCheckUtils]: 125: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,632 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #112#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,632 INFO L272 TraceCheckUtils]: 127: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,632 INFO L290 TraceCheckUtils]: 128: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,632 INFO L290 TraceCheckUtils]: 129: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,632 INFO L290 TraceCheckUtils]: 130: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,632 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #114#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,632 INFO L272 TraceCheckUtils]: 132: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,632 INFO L290 TraceCheckUtils]: 133: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,632 INFO L290 TraceCheckUtils]: 134: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,632 INFO L290 TraceCheckUtils]: 135: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,633 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #116#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,633 INFO L290 TraceCheckUtils]: 137: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,633 INFO L290 TraceCheckUtils]: 138: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,633 INFO L272 TraceCheckUtils]: 139: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,633 INFO L290 TraceCheckUtils]: 140: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,634 INFO L290 TraceCheckUtils]: 141: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,634 INFO L290 TraceCheckUtils]: 142: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,634 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #118#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,634 INFO L272 TraceCheckUtils]: 144: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,634 INFO L290 TraceCheckUtils]: 145: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,634 INFO L290 TraceCheckUtils]: 146: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,634 INFO L290 TraceCheckUtils]: 147: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,634 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #120#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,635 INFO L290 TraceCheckUtils]: 149: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,635 INFO L290 TraceCheckUtils]: 150: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,635 INFO L272 TraceCheckUtils]: 151: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,635 INFO L290 TraceCheckUtils]: 152: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,635 INFO L290 TraceCheckUtils]: 153: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,635 INFO L290 TraceCheckUtils]: 154: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,636 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #122#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,636 INFO L272 TraceCheckUtils]: 156: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,636 INFO L290 TraceCheckUtils]: 157: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,636 INFO L290 TraceCheckUtils]: 158: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,636 INFO L290 TraceCheckUtils]: 159: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,636 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #124#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,636 INFO L272 TraceCheckUtils]: 161: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,636 INFO L290 TraceCheckUtils]: 162: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,636 INFO L290 TraceCheckUtils]: 163: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,636 INFO L290 TraceCheckUtils]: 164: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,637 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #126#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,637 INFO L272 TraceCheckUtils]: 166: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,637 INFO L290 TraceCheckUtils]: 167: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,637 INFO L290 TraceCheckUtils]: 168: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,637 INFO L290 TraceCheckUtils]: 169: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,637 INFO L284 TraceCheckUtils]: 170: Hoare quadruple {43680#true} {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #128#return; {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-27 10:48:53,638 INFO L290 TraceCheckUtils]: 171: Hoare triple {43712#(<= (+ 5 main_~r~0) (* main_~n~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {43801#(<= (+ 5 main_~r~0 (* main_~i~0 2)) (+ main_~j~0 (* main_~n~0 2)))} is VALID [2022-04-27 10:48:53,638 INFO L290 TraceCheckUtils]: 172: Hoare triple {43801#(<= (+ 5 main_~r~0 (* main_~i~0 2)) (+ main_~j~0 (* main_~n~0 2)))} assume !!(~j~0 <= ~r~0); {43802#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-27 10:48:53,638 INFO L290 TraceCheckUtils]: 173: Hoare triple {43802#(<= (+ main_~i~0 3) main_~n~0)} assume !(~j~0 < ~r~0); {43802#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-27 10:48:53,639 INFO L272 TraceCheckUtils]: 174: Hoare triple {43802#(<= (+ main_~i~0 3) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,639 INFO L290 TraceCheckUtils]: 175: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,639 INFO L290 TraceCheckUtils]: 176: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,639 INFO L290 TraceCheckUtils]: 177: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,639 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {43680#true} {43802#(<= (+ main_~i~0 3) main_~n~0)} #118#return; {43802#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-27 10:48:53,639 INFO L272 TraceCheckUtils]: 179: Hoare triple {43802#(<= (+ main_~i~0 3) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,639 INFO L290 TraceCheckUtils]: 180: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,639 INFO L290 TraceCheckUtils]: 181: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,639 INFO L290 TraceCheckUtils]: 182: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,640 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {43680#true} {43802#(<= (+ main_~i~0 3) main_~n~0)} #120#return; {43802#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-27 10:48:53,640 INFO L290 TraceCheckUtils]: 184: Hoare triple {43802#(<= (+ main_~i~0 3) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {43802#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-27 10:48:53,640 INFO L290 TraceCheckUtils]: 185: Hoare triple {43802#(<= (+ main_~i~0 3) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {43802#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-27 10:48:53,640 INFO L272 TraceCheckUtils]: 186: Hoare triple {43802#(<= (+ main_~i~0 3) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:48:53,640 INFO L290 TraceCheckUtils]: 187: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:48:53,640 INFO L290 TraceCheckUtils]: 188: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:48:53,640 INFO L290 TraceCheckUtils]: 189: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:48:53,641 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {43680#true} {43802#(<= (+ main_~i~0 3) main_~n~0)} #122#return; {43802#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-27 10:48:53,641 INFO L272 TraceCheckUtils]: 191: Hoare triple {43802#(<= (+ main_~i~0 3) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {43815#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:48:53,641 INFO L290 TraceCheckUtils]: 192: Hoare triple {43815#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {43816#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:48:53,642 INFO L290 TraceCheckUtils]: 193: Hoare triple {43816#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {43681#false} is VALID [2022-04-27 10:48:53,642 INFO L290 TraceCheckUtils]: 194: Hoare triple {43681#false} assume !false; {43681#false} is VALID [2022-04-27 10:48:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 62 proven. 47 refuted. 0 times theorem prover too weak. 1877 trivial. 0 not checked. [2022-04-27 10:48:53,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:48:53,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763985494] [2022-04-27 10:48:53,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763985494] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:48:53,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472046970] [2022-04-27 10:48:53,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:48:53,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:48:53,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:48:53,656 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-27 10:48:53,659 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-27 10:48:53,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:48:53,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:48:53,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 10:48:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:53,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:49:07,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {43680#true} call ULTIMATE.init(); {43680#true} is VALID [2022-04-27 10:49:07,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#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); {43680#true} is VALID [2022-04-27 10:49:07,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43680#true} #138#return; {43680#true} is VALID [2022-04-27 10:49:07,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {43680#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {43680#true} is VALID [2022-04-27 10:49:07,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {43680#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; {43680#true} is VALID [2022-04-27 10:49:07,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {43680#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; {43839#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) main_~l~0))} is VALID [2022-04-27 10:49:07,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {43839#(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; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {43843#(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; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} assume !!(~j~0 <= ~r~0); {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} assume ~j~0 < ~r~0; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,913 INFO L272 TraceCheckUtils]: 11: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,914 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43680#true} {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} #110#return; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,914 INFO L272 TraceCheckUtils]: 16: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,915 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {43680#true} {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} #112#return; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,915 INFO L272 TraceCheckUtils]: 21: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,915 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {43680#true} {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} #114#return; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,915 INFO L272 TraceCheckUtils]: 26: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,916 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {43680#true} {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} #116#return; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,917 INFO L272 TraceCheckUtils]: 33: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,917 INFO L290 TraceCheckUtils]: 36: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,917 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {43680#true} {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} #118#return; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,917 INFO L272 TraceCheckUtils]: 38: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,918 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {43680#true} {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} #120#return; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,918 INFO L290 TraceCheckUtils]: 43: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,919 INFO L290 TraceCheckUtils]: 44: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} assume 0 != #t~nondet5;havoc #t~nondet5; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,919 INFO L290 TraceCheckUtils]: 45: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} assume ~l~0 > 1; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,919 INFO L272 TraceCheckUtils]: 46: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,919 INFO L290 TraceCheckUtils]: 47: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,919 INFO L290 TraceCheckUtils]: 48: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,919 INFO L290 TraceCheckUtils]: 49: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,920 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {43680#true} {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} #130#return; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,920 INFO L272 TraceCheckUtils]: 51: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,920 INFO L290 TraceCheckUtils]: 52: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,920 INFO L290 TraceCheckUtils]: 53: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,920 INFO L290 TraceCheckUtils]: 54: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,921 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {43680#true} {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} #132#return; {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-27 10:49:07,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {43843#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {43991#(and (< 0 (+ main_~l~0 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 2)))} is VALID [2022-04-27 10:49:07,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {43991#(and (< 0 (+ main_~l~0 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 2)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} is VALID [2022-04-27 10:49:07,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} assume !!(~j~0 <= ~r~0); {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} is VALID [2022-04-27 10:49:07,922 INFO L290 TraceCheckUtils]: 59: Hoare triple {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} assume ~j~0 < ~r~0; {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} is VALID [2022-04-27 10:49:07,923 INFO L272 TraceCheckUtils]: 60: Hoare triple {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,923 INFO L290 TraceCheckUtils]: 61: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,923 INFO L290 TraceCheckUtils]: 62: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,923 INFO L290 TraceCheckUtils]: 63: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,927 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {43680#true} {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} #110#return; {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} is VALID [2022-04-27 10:49:07,927 INFO L272 TraceCheckUtils]: 65: Hoare triple {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,928 INFO L290 TraceCheckUtils]: 66: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,928 INFO L290 TraceCheckUtils]: 67: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,928 INFO L290 TraceCheckUtils]: 68: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,928 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {43680#true} {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} #112#return; {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} is VALID [2022-04-27 10:49:07,928 INFO L272 TraceCheckUtils]: 70: Hoare triple {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,928 INFO L290 TraceCheckUtils]: 71: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,928 INFO L290 TraceCheckUtils]: 72: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,928 INFO L290 TraceCheckUtils]: 73: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,929 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {43680#true} {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} #114#return; {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} is VALID [2022-04-27 10:49:07,929 INFO L272 TraceCheckUtils]: 75: Hoare triple {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,929 INFO L290 TraceCheckUtils]: 76: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,929 INFO L290 TraceCheckUtils]: 77: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,930 INFO L290 TraceCheckUtils]: 78: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,930 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43680#true} {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} #116#return; {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} is VALID [2022-04-27 10:49:07,930 INFO L290 TraceCheckUtils]: 80: Hoare triple {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} is VALID [2022-04-27 10:49:07,931 INFO L290 TraceCheckUtils]: 81: Hoare triple {43995#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div main_~j~0 2))) (< 0 (+ (div main_~j~0 2) 1)))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} is VALID [2022-04-27 10:49:07,931 INFO L272 TraceCheckUtils]: 82: Hoare triple {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,931 INFO L290 TraceCheckUtils]: 83: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,931 INFO L290 TraceCheckUtils]: 84: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,931 INFO L290 TraceCheckUtils]: 85: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,932 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {43680#true} {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} #118#return; {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} is VALID [2022-04-27 10:49:07,932 INFO L272 TraceCheckUtils]: 87: Hoare triple {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,932 INFO L290 TraceCheckUtils]: 88: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,932 INFO L290 TraceCheckUtils]: 89: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,932 INFO L290 TraceCheckUtils]: 90: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,932 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {43680#true} {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} #120#return; {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} is VALID [2022-04-27 10:49:07,933 INFO L290 TraceCheckUtils]: 92: Hoare triple {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} is VALID [2022-04-27 10:49:07,933 INFO L290 TraceCheckUtils]: 93: Hoare triple {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} is VALID [2022-04-27 10:49:07,933 INFO L272 TraceCheckUtils]: 94: Hoare triple {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,933 INFO L290 TraceCheckUtils]: 95: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,933 INFO L290 TraceCheckUtils]: 96: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,933 INFO L290 TraceCheckUtils]: 97: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,934 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {43680#true} {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} #122#return; {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} is VALID [2022-04-27 10:49:07,934 INFO L272 TraceCheckUtils]: 99: Hoare triple {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,934 INFO L290 TraceCheckUtils]: 100: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,934 INFO L290 TraceCheckUtils]: 101: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,934 INFO L290 TraceCheckUtils]: 102: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,934 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {43680#true} {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} #124#return; {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} is VALID [2022-04-27 10:49:07,935 INFO L272 TraceCheckUtils]: 104: Hoare triple {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,935 INFO L290 TraceCheckUtils]: 105: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,935 INFO L290 TraceCheckUtils]: 106: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,935 INFO L290 TraceCheckUtils]: 107: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,935 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {43680#true} {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} #126#return; {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} is VALID [2022-04-27 10:49:07,935 INFO L272 TraceCheckUtils]: 109: Hoare triple {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,935 INFO L290 TraceCheckUtils]: 110: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,935 INFO L290 TraceCheckUtils]: 111: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,935 INFO L290 TraceCheckUtils]: 112: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,936 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {43680#true} {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} #128#return; {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} is VALID [2022-04-27 10:49:07,936 INFO L290 TraceCheckUtils]: 114: Hoare triple {44068#(and (< 0 (+ (div (+ (- 1) main_~j~0) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 2)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} is VALID [2022-04-27 10:49:07,937 INFO L290 TraceCheckUtils]: 115: Hoare triple {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} assume !!(~j~0 <= ~r~0); {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} is VALID [2022-04-27 10:49:07,937 INFO L290 TraceCheckUtils]: 116: Hoare triple {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} assume ~j~0 < ~r~0; {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} is VALID [2022-04-27 10:49:07,937 INFO L272 TraceCheckUtils]: 117: Hoare triple {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,937 INFO L290 TraceCheckUtils]: 118: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,937 INFO L290 TraceCheckUtils]: 119: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,938 INFO L290 TraceCheckUtils]: 120: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,938 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {43680#true} {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} #110#return; {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} is VALID [2022-04-27 10:49:07,938 INFO L272 TraceCheckUtils]: 122: Hoare triple {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,938 INFO L290 TraceCheckUtils]: 123: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,938 INFO L290 TraceCheckUtils]: 124: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,938 INFO L290 TraceCheckUtils]: 125: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,938 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {43680#true} {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} #112#return; {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} is VALID [2022-04-27 10:49:07,939 INFO L272 TraceCheckUtils]: 127: Hoare triple {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,939 INFO L290 TraceCheckUtils]: 128: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,939 INFO L290 TraceCheckUtils]: 129: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,939 INFO L290 TraceCheckUtils]: 130: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,940 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {43680#true} {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} #114#return; {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} is VALID [2022-04-27 10:49:07,940 INFO L272 TraceCheckUtils]: 132: Hoare triple {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,940 INFO L290 TraceCheckUtils]: 133: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,940 INFO L290 TraceCheckUtils]: 134: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,940 INFO L290 TraceCheckUtils]: 135: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,941 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {43680#true} {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} #116#return; {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} is VALID [2022-04-27 10:49:07,941 INFO L290 TraceCheckUtils]: 137: Hoare triple {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} is VALID [2022-04-27 10:49:07,942 INFO L290 TraceCheckUtils]: 138: Hoare triple {44168#(and (< 0 (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 2)))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} is VALID [2022-04-27 10:49:07,942 INFO L272 TraceCheckUtils]: 139: Hoare triple {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,942 INFO L290 TraceCheckUtils]: 140: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,942 INFO L290 TraceCheckUtils]: 141: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,942 INFO L290 TraceCheckUtils]: 142: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,942 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {43680#true} {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} #118#return; {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} is VALID [2022-04-27 10:49:07,942 INFO L272 TraceCheckUtils]: 144: Hoare triple {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,943 INFO L290 TraceCheckUtils]: 145: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,943 INFO L290 TraceCheckUtils]: 146: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,943 INFO L290 TraceCheckUtils]: 147: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,943 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {43680#true} {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} #120#return; {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} is VALID [2022-04-27 10:49:07,943 INFO L290 TraceCheckUtils]: 149: Hoare triple {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} is VALID [2022-04-27 10:49:07,944 INFO L290 TraceCheckUtils]: 150: Hoare triple {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} assume !(0 != #t~nondet5);havoc #t~nondet5; {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} is VALID [2022-04-27 10:49:07,944 INFO L272 TraceCheckUtils]: 151: Hoare triple {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,944 INFO L290 TraceCheckUtils]: 152: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,944 INFO L290 TraceCheckUtils]: 153: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,944 INFO L290 TraceCheckUtils]: 154: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,944 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {43680#true} {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} #122#return; {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} is VALID [2022-04-27 10:49:07,945 INFO L272 TraceCheckUtils]: 156: Hoare triple {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,945 INFO L290 TraceCheckUtils]: 157: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,945 INFO L290 TraceCheckUtils]: 158: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,945 INFO L290 TraceCheckUtils]: 159: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,945 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {43680#true} {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} #124#return; {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} is VALID [2022-04-27 10:49:07,945 INFO L272 TraceCheckUtils]: 161: Hoare triple {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,945 INFO L290 TraceCheckUtils]: 162: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,945 INFO L290 TraceCheckUtils]: 163: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,945 INFO L290 TraceCheckUtils]: 164: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,946 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {43680#true} {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} #126#return; {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} is VALID [2022-04-27 10:49:07,946 INFO L272 TraceCheckUtils]: 166: Hoare triple {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:07,946 INFO L290 TraceCheckUtils]: 167: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:07,946 INFO L290 TraceCheckUtils]: 168: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:07,946 INFO L290 TraceCheckUtils]: 169: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:07,946 INFO L284 TraceCheckUtils]: 170: Hoare quadruple {43680#true} {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} #128#return; {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} is VALID [2022-04-27 10:49:07,947 INFO L290 TraceCheckUtils]: 171: Hoare triple {44241#(and (< 0 (+ 1 (div (div (+ main_~j~0 (- 3)) 2) 2))) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (+ main_~j~0 (- 3)) 2) 2))))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {44341#(and (< 0 (+ (div (div (div (+ main_~j~0 (- 6)) 2) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (div (+ main_~j~0 (- 6)) 2) 2) 2))))} is VALID [2022-04-27 10:49:07,948 INFO L290 TraceCheckUtils]: 172: Hoare triple {44341#(and (< 0 (+ (div (div (div (+ main_~j~0 (- 6)) 2) 2) 2) 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ 2 (div (div (div (+ main_~j~0 (- 6)) 2) 2) 2))))} assume !!(~j~0 <= ~r~0); {43681#false} is VALID [2022-04-27 10:49:07,948 INFO L290 TraceCheckUtils]: 173: Hoare triple {43681#false} assume !(~j~0 < ~r~0); {43681#false} is VALID [2022-04-27 10:49:07,948 INFO L272 TraceCheckUtils]: 174: Hoare triple {43681#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43681#false} is VALID [2022-04-27 10:49:07,948 INFO L290 TraceCheckUtils]: 175: Hoare triple {43681#false} ~cond := #in~cond; {43681#false} is VALID [2022-04-27 10:49:07,948 INFO L290 TraceCheckUtils]: 176: Hoare triple {43681#false} assume !(0 == ~cond); {43681#false} is VALID [2022-04-27 10:49:07,948 INFO L290 TraceCheckUtils]: 177: Hoare triple {43681#false} assume true; {43681#false} is VALID [2022-04-27 10:49:07,948 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {43681#false} {43681#false} #118#return; {43681#false} is VALID [2022-04-27 10:49:07,948 INFO L272 TraceCheckUtils]: 179: Hoare triple {43681#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43681#false} is VALID [2022-04-27 10:49:07,948 INFO L290 TraceCheckUtils]: 180: Hoare triple {43681#false} ~cond := #in~cond; {43681#false} is VALID [2022-04-27 10:49:07,948 INFO L290 TraceCheckUtils]: 181: Hoare triple {43681#false} assume !(0 == ~cond); {43681#false} is VALID [2022-04-27 10:49:07,948 INFO L290 TraceCheckUtils]: 182: Hoare triple {43681#false} assume true; {43681#false} is VALID [2022-04-27 10:49:07,949 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {43681#false} {43681#false} #120#return; {43681#false} is VALID [2022-04-27 10:49:07,949 INFO L290 TraceCheckUtils]: 184: Hoare triple {43681#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {43681#false} is VALID [2022-04-27 10:49:07,949 INFO L290 TraceCheckUtils]: 185: Hoare triple {43681#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {43681#false} is VALID [2022-04-27 10:49:07,949 INFO L272 TraceCheckUtils]: 186: Hoare triple {43681#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {43681#false} is VALID [2022-04-27 10:49:07,949 INFO L290 TraceCheckUtils]: 187: Hoare triple {43681#false} ~cond := #in~cond; {43681#false} is VALID [2022-04-27 10:49:07,949 INFO L290 TraceCheckUtils]: 188: Hoare triple {43681#false} assume !(0 == ~cond); {43681#false} is VALID [2022-04-27 10:49:07,949 INFO L290 TraceCheckUtils]: 189: Hoare triple {43681#false} assume true; {43681#false} is VALID [2022-04-27 10:49:07,949 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {43681#false} {43681#false} #122#return; {43681#false} is VALID [2022-04-27 10:49:07,949 INFO L272 TraceCheckUtils]: 191: Hoare triple {43681#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {43681#false} is VALID [2022-04-27 10:49:07,949 INFO L290 TraceCheckUtils]: 192: Hoare triple {43681#false} ~cond := #in~cond; {43681#false} is VALID [2022-04-27 10:49:07,949 INFO L290 TraceCheckUtils]: 193: Hoare triple {43681#false} assume 0 == ~cond; {43681#false} is VALID [2022-04-27 10:49:07,949 INFO L290 TraceCheckUtils]: 194: Hoare triple {43681#false} assume !false; {43681#false} is VALID [2022-04-27 10:49:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 430 proven. 26 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2022-04-27 10:49:07,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:49:21,258 INFO L290 TraceCheckUtils]: 194: Hoare triple {43681#false} assume !false; {43681#false} is VALID [2022-04-27 10:49:21,258 INFO L290 TraceCheckUtils]: 193: Hoare triple {43681#false} assume 0 == ~cond; {43681#false} is VALID [2022-04-27 10:49:21,258 INFO L290 TraceCheckUtils]: 192: Hoare triple {43681#false} ~cond := #in~cond; {43681#false} is VALID [2022-04-27 10:49:21,258 INFO L272 TraceCheckUtils]: 191: Hoare triple {43681#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {43681#false} is VALID [2022-04-27 10:49:21,258 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {43680#true} {43681#false} #122#return; {43681#false} is VALID [2022-04-27 10:49:21,258 INFO L290 TraceCheckUtils]: 189: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,258 INFO L290 TraceCheckUtils]: 188: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,258 INFO L290 TraceCheckUtils]: 187: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,258 INFO L272 TraceCheckUtils]: 186: Hoare triple {43681#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,258 INFO L290 TraceCheckUtils]: 185: Hoare triple {43681#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {43681#false} is VALID [2022-04-27 10:49:21,259 INFO L290 TraceCheckUtils]: 184: Hoare triple {43681#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {43681#false} is VALID [2022-04-27 10:49:21,259 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {43680#true} {43681#false} #120#return; {43681#false} is VALID [2022-04-27 10:49:21,259 INFO L290 TraceCheckUtils]: 182: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,259 INFO L290 TraceCheckUtils]: 181: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,259 INFO L290 TraceCheckUtils]: 180: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,259 INFO L272 TraceCheckUtils]: 179: Hoare triple {43681#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,259 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {43680#true} {43681#false} #118#return; {43681#false} is VALID [2022-04-27 10:49:21,259 INFO L290 TraceCheckUtils]: 177: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,259 INFO L290 TraceCheckUtils]: 176: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,259 INFO L290 TraceCheckUtils]: 175: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,259 INFO L272 TraceCheckUtils]: 174: Hoare triple {43681#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,259 INFO L290 TraceCheckUtils]: 173: Hoare triple {43681#false} assume !(~j~0 < ~r~0); {43681#false} is VALID [2022-04-27 10:49:21,259 INFO L290 TraceCheckUtils]: 172: Hoare triple {44477#(not (<= main_~j~0 main_~r~0))} assume !!(~j~0 <= ~r~0); {43681#false} is VALID [2022-04-27 10:49:21,260 INFO L290 TraceCheckUtils]: 171: Hoare triple {44481#(< main_~r~0 (* main_~j~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {44477#(not (<= main_~j~0 main_~r~0))} is VALID [2022-04-27 10:49:21,261 INFO L284 TraceCheckUtils]: 170: Hoare quadruple {43680#true} {44481#(< main_~r~0 (* main_~j~0 2))} #128#return; {44481#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:49:21,261 INFO L290 TraceCheckUtils]: 169: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,261 INFO L290 TraceCheckUtils]: 168: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,261 INFO L290 TraceCheckUtils]: 167: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,261 INFO L272 TraceCheckUtils]: 166: Hoare triple {44481#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,261 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {43680#true} {44481#(< main_~r~0 (* main_~j~0 2))} #126#return; {44481#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:49:21,261 INFO L290 TraceCheckUtils]: 164: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,261 INFO L290 TraceCheckUtils]: 163: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,261 INFO L290 TraceCheckUtils]: 162: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,261 INFO L272 TraceCheckUtils]: 161: Hoare triple {44481#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,262 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {43680#true} {44481#(< main_~r~0 (* main_~j~0 2))} #124#return; {44481#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:49:21,262 INFO L290 TraceCheckUtils]: 159: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,262 INFO L290 TraceCheckUtils]: 158: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,262 INFO L290 TraceCheckUtils]: 157: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,262 INFO L272 TraceCheckUtils]: 156: Hoare triple {44481#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,262 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {43680#true} {44481#(< main_~r~0 (* main_~j~0 2))} #122#return; {44481#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:49:21,263 INFO L290 TraceCheckUtils]: 154: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,263 INFO L290 TraceCheckUtils]: 153: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,263 INFO L290 TraceCheckUtils]: 152: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,263 INFO L272 TraceCheckUtils]: 151: Hoare triple {44481#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,263 INFO L290 TraceCheckUtils]: 150: Hoare triple {44481#(< main_~r~0 (* main_~j~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {44481#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:49:21,263 INFO L290 TraceCheckUtils]: 149: Hoare triple {44481#(< main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44481#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:49:21,264 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {43680#true} {44481#(< main_~r~0 (* main_~j~0 2))} #120#return; {44481#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:49:21,264 INFO L290 TraceCheckUtils]: 147: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,264 INFO L290 TraceCheckUtils]: 146: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,264 INFO L290 TraceCheckUtils]: 145: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,264 INFO L272 TraceCheckUtils]: 144: Hoare triple {44481#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,264 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {43680#true} {44481#(< main_~r~0 (* main_~j~0 2))} #118#return; {44481#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:49:21,264 INFO L290 TraceCheckUtils]: 142: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,264 INFO L290 TraceCheckUtils]: 141: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,265 INFO L290 TraceCheckUtils]: 140: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,265 INFO L272 TraceCheckUtils]: 139: Hoare triple {44481#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,265 INFO L290 TraceCheckUtils]: 138: Hoare triple {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {44481#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-27 10:49:21,266 INFO L290 TraceCheckUtils]: 137: Hoare triple {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,266 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {43680#true} {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #116#return; {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,266 INFO L290 TraceCheckUtils]: 135: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,266 INFO L290 TraceCheckUtils]: 134: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,266 INFO L290 TraceCheckUtils]: 133: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,266 INFO L272 TraceCheckUtils]: 132: Hoare triple {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,267 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {43680#true} {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #114#return; {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,267 INFO L290 TraceCheckUtils]: 130: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,267 INFO L290 TraceCheckUtils]: 129: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,267 INFO L290 TraceCheckUtils]: 128: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,267 INFO L272 TraceCheckUtils]: 127: Hoare triple {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,267 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {43680#true} {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #112#return; {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,267 INFO L290 TraceCheckUtils]: 125: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,267 INFO L290 TraceCheckUtils]: 124: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,268 INFO L290 TraceCheckUtils]: 123: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,268 INFO L272 TraceCheckUtils]: 122: Hoare triple {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,268 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {43680#true} {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #110#return; {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,268 INFO L290 TraceCheckUtils]: 120: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,268 INFO L290 TraceCheckUtils]: 119: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,268 INFO L290 TraceCheckUtils]: 118: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,268 INFO L272 TraceCheckUtils]: 117: Hoare triple {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,269 INFO L290 TraceCheckUtils]: 116: Hoare triple {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume ~j~0 < ~r~0; {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,269 INFO L290 TraceCheckUtils]: 115: Hoare triple {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume !!(~j~0 <= ~r~0); {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,270 INFO L290 TraceCheckUtils]: 114: Hoare triple {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {44581#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,270 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {43680#true} {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} #128#return; {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} is VALID [2022-04-27 10:49:21,270 INFO L290 TraceCheckUtils]: 112: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,270 INFO L290 TraceCheckUtils]: 111: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,270 INFO L290 TraceCheckUtils]: 110: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,270 INFO L272 TraceCheckUtils]: 109: Hoare triple {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,271 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {43680#true} {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} #126#return; {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} is VALID [2022-04-27 10:49:21,271 INFO L290 TraceCheckUtils]: 107: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,271 INFO L290 TraceCheckUtils]: 106: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,271 INFO L290 TraceCheckUtils]: 105: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,271 INFO L272 TraceCheckUtils]: 104: Hoare triple {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,271 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {43680#true} {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} #124#return; {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} is VALID [2022-04-27 10:49:21,271 INFO L290 TraceCheckUtils]: 102: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,271 INFO L290 TraceCheckUtils]: 101: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,271 INFO L290 TraceCheckUtils]: 100: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,271 INFO L272 TraceCheckUtils]: 99: Hoare triple {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,272 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {43680#true} {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} #122#return; {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} is VALID [2022-04-27 10:49:21,272 INFO L290 TraceCheckUtils]: 97: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,272 INFO L290 TraceCheckUtils]: 96: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,272 INFO L290 TraceCheckUtils]: 95: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,272 INFO L272 TraceCheckUtils]: 94: Hoare triple {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,273 INFO L290 TraceCheckUtils]: 93: Hoare triple {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} is VALID [2022-04-27 10:49:21,273 INFO L290 TraceCheckUtils]: 92: Hoare triple {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} is VALID [2022-04-27 10:49:21,273 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {43680#true} {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} #120#return; {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} is VALID [2022-04-27 10:49:21,273 INFO L290 TraceCheckUtils]: 90: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,273 INFO L290 TraceCheckUtils]: 89: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,274 INFO L290 TraceCheckUtils]: 88: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,274 INFO L272 TraceCheckUtils]: 87: Hoare triple {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,274 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {43680#true} {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} #118#return; {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} is VALID [2022-04-27 10:49:21,274 INFO L290 TraceCheckUtils]: 85: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,274 INFO L290 TraceCheckUtils]: 84: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,274 INFO L290 TraceCheckUtils]: 83: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,274 INFO L272 TraceCheckUtils]: 82: Hoare triple {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,275 INFO L290 TraceCheckUtils]: 81: Hoare triple {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {44654#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~j~0 2) 2))} is VALID [2022-04-27 10:49:21,275 INFO L290 TraceCheckUtils]: 80: Hoare triple {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,276 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43680#true} {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} #116#return; {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,276 INFO L290 TraceCheckUtils]: 78: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,276 INFO L290 TraceCheckUtils]: 77: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,276 INFO L290 TraceCheckUtils]: 76: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,276 INFO L272 TraceCheckUtils]: 75: Hoare triple {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,276 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {43680#true} {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} #114#return; {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,276 INFO L290 TraceCheckUtils]: 73: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,276 INFO L290 TraceCheckUtils]: 72: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,277 INFO L290 TraceCheckUtils]: 71: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,277 INFO L272 TraceCheckUtils]: 70: Hoare triple {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,277 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {43680#true} {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} #112#return; {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,277 INFO L290 TraceCheckUtils]: 68: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,277 INFO L290 TraceCheckUtils]: 67: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,277 INFO L290 TraceCheckUtils]: 66: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,277 INFO L272 TraceCheckUtils]: 65: Hoare triple {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,278 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {43680#true} {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} #110#return; {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,278 INFO L290 TraceCheckUtils]: 63: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,278 INFO L290 TraceCheckUtils]: 62: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,278 INFO L290 TraceCheckUtils]: 61: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,278 INFO L272 TraceCheckUtils]: 60: Hoare triple {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,291 INFO L290 TraceCheckUtils]: 59: Hoare triple {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} assume ~j~0 < ~r~0; {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,292 INFO L290 TraceCheckUtils]: 58: Hoare triple {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} assume !!(~j~0 <= ~r~0); {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,293 INFO L290 TraceCheckUtils]: 57: Hoare triple {44827#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ (* main_~l~0 2) 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {44754#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-27 10:49:21,294 INFO L290 TraceCheckUtils]: 56: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {44827#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) (+ (* main_~l~0 2) 2))} is VALID [2022-04-27 10:49:21,295 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {43680#true} {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} #132#return; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,295 INFO L290 TraceCheckUtils]: 53: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,295 INFO L272 TraceCheckUtils]: 51: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,296 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {43680#true} {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} #130#return; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,296 INFO L290 TraceCheckUtils]: 49: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,296 INFO L290 TraceCheckUtils]: 48: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,296 INFO L290 TraceCheckUtils]: 47: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,296 INFO L272 TraceCheckUtils]: 46: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,296 INFO L290 TraceCheckUtils]: 45: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} assume ~l~0 > 1; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,298 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {43680#true} {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} #120#return; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,298 INFO L272 TraceCheckUtils]: 38: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,299 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {43680#true} {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} #118#return; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,299 INFO L272 TraceCheckUtils]: 33: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,300 INFO L290 TraceCheckUtils]: 32: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,301 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {43680#true} {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} #116#return; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,301 INFO L272 TraceCheckUtils]: 26: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,302 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {43680#true} {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} #114#return; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,302 INFO L272 TraceCheckUtils]: 21: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,302 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {43680#true} {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} #112#return; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,302 INFO L272 TraceCheckUtils]: 16: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,303 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43680#true} {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} #110#return; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {43680#true} assume !(0 == ~cond); {43680#true} is VALID [2022-04-27 10:49:21,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {43680#true} ~cond := #in~cond; {43680#true} is VALID [2022-04-27 10:49:21,303 INFO L272 TraceCheckUtils]: 11: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {43680#true} is VALID [2022-04-27 10:49:21,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} assume ~j~0 < ~r~0; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} assume !!(~j~0 <= ~r~0); {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {44979#(or (< (+ (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) 1) main_~l~0) (not (< 1 main_~l~0)))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {44831#(< (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) main_~l~0)} is VALID [2022-04-27 10:49:21,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {43680#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; {44979#(or (< (+ (div (+ (* (- 1) (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2))) 1) (- 2)) 1) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-27 10:49:21,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {43680#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; {43680#true} is VALID [2022-04-27 10:49:21,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {43680#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {43680#true} is VALID [2022-04-27 10:49:21,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43680#true} {43680#true} #138#return; {43680#true} is VALID [2022-04-27 10:49:21,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {43680#true} assume true; {43680#true} is VALID [2022-04-27 10:49:21,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {43680#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); {43680#true} is VALID [2022-04-27 10:49:21,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {43680#true} call ULTIMATE.init(); {43680#true} is VALID [2022-04-27 10:49:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 81 proven. 45 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2022-04-27 10:49:21,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472046970] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:49:21,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:49:21,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2022-04-27 10:49:21,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034620204] [2022-04-27 10:49:21,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:49:21,310 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 15 states have call successors, (88), 4 states have call predecessors, (88), 2 states have return successors, (84), 15 states have call predecessors, (84), 15 states have call successors, (84) Word has length 195 [2022-04-27 10:49:21,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:49:21,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 15 states have call successors, (88), 4 states have call predecessors, (88), 2 states have return successors, (84), 15 states have call predecessors, (84), 15 states have call successors, (84) [2022-04-27 10:49:21,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:49:21,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-27 10:49:21,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:49:21,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-27 10:49:21,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2022-04-27 10:49:21,550 INFO L87 Difference]: Start difference. First operand 522 states and 841 transitions. Second operand has 27 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 15 states have call successors, (88), 4 states have call predecessors, (88), 2 states have return successors, (84), 15 states have call predecessors, (84), 15 states have call successors, (84) [2022-04-27 10:51:09,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:51:09,406 INFO L93 Difference]: Finished difference Result 2171 states and 3594 transitions. [2022-04-27 10:51:09,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-04-27 10:51:09,406 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 15 states have call successors, (88), 4 states have call predecessors, (88), 2 states have return successors, (84), 15 states have call predecessors, (84), 15 states have call successors, (84) Word has length 195 [2022-04-27 10:51:09,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:51:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 15 states have call successors, (88), 4 states have call predecessors, (88), 2 states have return successors, (84), 15 states have call predecessors, (84), 15 states have call successors, (84) [2022-04-27 10:51:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 1277 transitions. [2022-04-27 10:51:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 15 states have call successors, (88), 4 states have call predecessors, (88), 2 states have return successors, (84), 15 states have call predecessors, (84), 15 states have call successors, (84) [2022-04-27 10:51:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 1277 transitions. [2022-04-27 10:51:09,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 1277 transitions. [2022-04-27 10:51:11,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1277 edges. 1277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:51:11,641 INFO L225 Difference]: With dead ends: 2171 [2022-04-27 10:51:11,641 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:51:11,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7007 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=3750, Invalid=16842, Unknown=0, NotChecked=0, Total=20592 [2022-04-27 10:51:11,650 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 615 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 7686 mSolverCounterSat, 3469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 11155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3469 IncrementalHoareTripleChecker+Valid, 7686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:51:11,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 250 Invalid, 11155 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3469 Valid, 7686 Invalid, 0 Unknown, 0 Unchecked, 37.2s Time] [2022-04-27 10:51:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:51:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:51:11,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:51:11,651 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-27 10:51:11,651 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-27 10:51:11,651 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-27 10:51:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:51:11,651 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:51:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:51:11,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:51:11,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:51:11,651 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-27 10:51:11,651 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-27 10:51:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:51:11,651 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:51:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:51:11,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:51:11,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:51:11,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:51:11,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:51:11,652 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-27 10:51:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:51:11,652 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 195 [2022-04-27 10:51:11,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:51:11,652 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:51:11,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 15 states have call successors, (88), 4 states have call predecessors, (88), 2 states have return successors, (84), 15 states have call predecessors, (84), 15 states have call successors, (84) [2022-04-27 10:51:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:51:11,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:51:11,655 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:51:11,673 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-27 10:51:11,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:51:11,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:51:26,241 WARN L232 SmtUtils]: Spent 12.76s on a formula simplification. DAG size of input: 509 DAG size of output: 499 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)