/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/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:47:50,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:47:50,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:47:50,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:47:50,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:47:50,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:47:50,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:47:50,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:47:50,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:47:50,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:47:50,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:47:50,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:47:50,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:47:50,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:47:50,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:47:50,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:47:50,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:47:50,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:47:50,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:47:50,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:47:50,510 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:47:50,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:47:50,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:47:50,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:47:50,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:47:50,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:47:50,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:47:50,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:47:50,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:47:50,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:47:50,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:47:50,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:47:50,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:47:50,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:47:50,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:47:50,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:47:50,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:47:50,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:47:50,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:47:50,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:47:50,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:47:50,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:47:50,525 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:47:50,547 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:47:50,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:47:50,547 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:47:50,547 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:47:50,548 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:47:50,548 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:47:50,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:47:50,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:47:50,549 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:47:50,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:47:50,550 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:47:50,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:47:50,550 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:47:50,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:47:50,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:47:50,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:47:50,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:47:50,551 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:47:50,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:47:50,551 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:47:50,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:47:50,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:47:50,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:47:50,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:47:50,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:47:50,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:47:50,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:47:50,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:47:50,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:47:50,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:47:50,553 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:47:50,553 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:47:50,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:47:50,553 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:47:50,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:47:50,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:47:50,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:47:50,745 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:47:50,745 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:47:50,746 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2022-04-27 10:47:50,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad52d5b2/fbb1d9d98a82420eb9cdab5558803812/FLAGad0461b42 [2022-04-27 10:47:51,137 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:47:51,137 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2022-04-27 10:47:51,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad52d5b2/fbb1d9d98a82420eb9cdab5558803812/FLAGad0461b42 [2022-04-27 10:47:51,157 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad52d5b2/fbb1d9d98a82420eb9cdab5558803812 [2022-04-27 10:47:51,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:47:51,161 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:47:51,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:47:51,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:47:51,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:47:51,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:47:51" (1/1) ... [2022-04-27 10:47:51,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b24859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:51, skipping insertion in model container [2022-04-27 10:47:51,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:47:51" (1/1) ... [2022-04-27 10:47:51,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:47:51,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:47:51,361 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/nested6.i[893,906] [2022-04-27 10:47:51,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:47:51,390 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:47:51,406 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/nested6.i[893,906] [2022-04-27 10:47:51,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:47:51,424 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:47:51,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:51 WrapperNode [2022-04-27 10:47:51,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:47:51,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:47:51,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:47:51,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:47:51,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:51" (1/1) ... [2022-04-27 10:47:51,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:51" (1/1) ... [2022-04-27 10:47:51,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:51" (1/1) ... [2022-04-27 10:47:51,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:51" (1/1) ... [2022-04-27 10:47:51,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:51" (1/1) ... [2022-04-27 10:47:51,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:51" (1/1) ... [2022-04-27 10:47:51,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:51" (1/1) ... [2022-04-27 10:47:51,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:47:51,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:47:51,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:47:51,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:47:51,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:51" (1/1) ... [2022-04-27 10:47:51,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:47:51,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:47:51,490 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:47:51,495 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:47:51,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:47:51,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:47:51,521 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:47:51,521 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:47:51,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:47:51,522 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:47:51,522 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:47:51,522 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:47:51,522 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:47:51,522 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:47:51,522 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:47:51,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:47:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:47:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:47:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:47:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:47:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:47:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:47:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:47:51,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:47:51,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:47:51,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:47:51,592 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:47:51,593 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:47:51,735 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:47:51,740 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:47:51,740 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 10:47:51,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:47:51 BoogieIcfgContainer [2022-04-27 10:47:51,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:47:51,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:47:51,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:47:51,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:47:51,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:47:51" (1/3) ... [2022-04-27 10:47:51,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a5d2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:47:51, skipping insertion in model container [2022-04-27 10:47:51,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:51" (2/3) ... [2022-04-27 10:47:51,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a5d2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:47:51, skipping insertion in model container [2022-04-27 10:47:51,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:47:51" (3/3) ... [2022-04-27 10:47:51,746 INFO L111 eAbstractionObserver]: Analyzing ICFG nested6.i [2022-04-27 10:47:51,755 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:47:51,755 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:47:51,788 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:47:51,792 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@d312878, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52d27a47 [2022-04-27 10:47:51,792 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:47:51,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 22 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:47:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:47:51,806 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:51,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:51,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash -380972064, now seen corresponding path program 1 times [2022-04-27 10:47:51,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:51,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206672179] [2022-04-27 10:47:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:52,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:52,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(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); {33#true} is VALID [2022-04-27 10:47:52,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 10:47:52,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #98#return; {33#true} is VALID [2022-04-27 10:47:52,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:52,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(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); {33#true} is VALID [2022-04-27 10:47:52,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 10:47:52,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #98#return; {33#true} is VALID [2022-04-27 10:47:52,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-27 10:47:52,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {33#true} is VALID [2022-04-27 10:47:52,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} assume !!(~n~0 < 1000000); {33#true} is VALID [2022-04-27 10:47:52,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} assume ~k~0 == ~n~0; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-27 10:47:52,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#(<= main_~n~0 main_~k~0)} ~i~0 := 0; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-27 10:47:52,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(<= main_~n~0 main_~k~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-27 10:47:52,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#(<= main_~n~0 main_~k~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-27 10:47:52,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(<= main_~n~0 main_~k~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-27 10:47:52,078 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#(<= main_~n~0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {39#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:52,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {40#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:52,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {34#false} is VALID [2022-04-27 10:47:52,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 10:47:52,079 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:52,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:52,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206672179] [2022-04-27 10:47:52,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206672179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:52,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:52,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:47:52,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076003587] [2022-04-27 10:47:52,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:52,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-04-27 10:47:52,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:52,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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:52,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:52,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:47:52,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:52,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:47:52,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:47:52,126 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 22 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:52,529 INFO L93 Difference]: Finished difference Result 58 states and 81 transitions. [2022-04-27 10:47:52,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:47:52,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-04-27 10:47:52,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-04-27 10:47:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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:52,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-04-27 10:47:52,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 81 transitions. [2022-04-27 10:47:52,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:52,630 INFO L225 Difference]: With dead ends: 58 [2022-04-27 10:47:52,630 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 10:47:52,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:47:52,634 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:52,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 52 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:47:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 10:47:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 10:47:52,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:52,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:52,657 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:52,658 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:52,660 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-27 10:47:52,660 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 10:47:52,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:52,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:52,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-27 10:47:52,661 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-27 10:47:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:52,663 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-27 10:47:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 10:47:52,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:52,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:52,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:52,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-27 10:47:52,667 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2022-04-27 10:47:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:52,667 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-27 10:47:52,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 10:47:52,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:47:52,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:52,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:52,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:47:52,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:52,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:52,669 INFO L85 PathProgramCache]: Analyzing trace with hash 580085489, now seen corresponding path program 1 times [2022-04-27 10:47:52,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:52,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818231217] [2022-04-27 10:47:52,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:52,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:52,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:52,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#(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); {231#true} is VALID [2022-04-27 10:47:52,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 10:47:52,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {231#true} {231#true} #98#return; {231#true} is VALID [2022-04-27 10:47:52,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:52,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#(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); {231#true} is VALID [2022-04-27 10:47:52,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 10:47:52,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #98#return; {231#true} is VALID [2022-04-27 10:47:52,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret7 := main(); {231#true} is VALID [2022-04-27 10:47:52,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {231#true} is VALID [2022-04-27 10:47:52,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#true} assume !!(~n~0 < 1000000); {231#true} is VALID [2022-04-27 10:47:52,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#true} assume ~k~0 == ~n~0; {231#true} is VALID [2022-04-27 10:47:52,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#true} ~i~0 := 0; {231#true} is VALID [2022-04-27 10:47:52,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {236#(<= (* main_~i~0 2) main_~j~0)} is VALID [2022-04-27 10:47:52,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {236#(<= (* main_~i~0 2) main_~j~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {236#(<= (* main_~i~0 2) main_~j~0)} is VALID [2022-04-27 10:47:52,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {236#(<= (* main_~i~0 2) main_~j~0)} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {237#(<= (* main_~i~0 2) main_~k~0)} is VALID [2022-04-27 10:47:52,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {237#(<= (* main_~i~0 2) main_~k~0)} assume !!(~k~0 < ~n~0); {237#(<= (* main_~i~0 2) main_~k~0)} is VALID [2022-04-27 10:47:52,773 INFO L272 TraceCheckUtils]: 13: Hoare triple {237#(<= (* main_~i~0 2) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {238#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:52,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {238#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {239#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:52,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {232#false} is VALID [2022-04-27 10:47:52,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-27 10:47:52,774 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:52,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:52,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818231217] [2022-04-27 10:47:52,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818231217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:52,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:52,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:47:52,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106225699] [2022-04-27 10:47:52,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:52,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-27 10:47:52,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:52,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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:52,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:52,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:47:52,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:52,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:47:52,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:47:52,792 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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:53,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:53,200 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 10:47:53,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:47:53,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-27 10:47:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-27 10:47:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-27 10:47:53,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-04-27 10:47:53,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:53,251 INFO L225 Difference]: With dead ends: 41 [2022-04-27 10:47:53,251 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 10:47:53,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:47:53,253 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:53,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 45 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:47:53,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 10:47:53,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-04-27 10:47:53,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:53,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:53,265 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:53,265 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:53,268 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 10:47:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 10:47:53,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:53,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:53,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 39 states. [2022-04-27 10:47:53,270 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 39 states. [2022-04-27 10:47:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:53,276 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 10:47:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 10:47:53,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:53,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:53,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:53,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-27 10:47:53,278 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2022-04-27 10:47:53,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:53,278 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-27 10:47:53,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 10:47:53,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 10:47:53,279 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:53,279 INFO L195 NwaCegarLoop]: trace histogram [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:53,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:47:53,279 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:53,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:53,279 INFO L85 PathProgramCache]: Analyzing trace with hash -132185391, now seen corresponding path program 1 times [2022-04-27 10:47:53,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:53,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604100760] [2022-04-27 10:47:53,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:53,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:53,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:53,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {446#(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); {434#true} is VALID [2022-04-27 10:47:53,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 10:47:53,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {434#true} {434#true} #98#return; {434#true} is VALID [2022-04-27 10:47:53,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 10:47:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:53,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 10:47:53,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 10:47:53,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 10:47:53,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {439#(<= main_~k~0 main_~n~0)} #94#return; {439#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 10:47:53,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:53,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {446#(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); {434#true} is VALID [2022-04-27 10:47:53,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 10:47:53,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #98#return; {434#true} is VALID [2022-04-27 10:47:53,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret7 := main(); {434#true} is VALID [2022-04-27 10:47:53,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {434#true} is VALID [2022-04-27 10:47:53,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {434#true} assume !!(~n~0 < 1000000); {434#true} is VALID [2022-04-27 10:47:53,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} assume ~k~0 == ~n~0; {439#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 10:47:53,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {439#(<= main_~k~0 main_~n~0)} ~i~0 := 0; {439#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 10:47:53,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {439#(<= main_~k~0 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {439#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 10:47:53,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {439#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {439#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 10:47:53,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {439#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {439#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 10:47:53,371 INFO L272 TraceCheckUtils]: 12: Hoare triple {439#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {434#true} is VALID [2022-04-27 10:47:53,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 10:47:53,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 10:47:53,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 10:47:53,372 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {434#true} {439#(<= main_~k~0 main_~n~0)} #94#return; {439#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 10:47:53,373 INFO L272 TraceCheckUtils]: 17: Hoare triple {439#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {444#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:53,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {444#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {445#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:53,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {445#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {435#false} is VALID [2022-04-27 10:47:53,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-27 10:47:53,374 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:53,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:53,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604100760] [2022-04-27 10:47:53,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604100760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:53,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:53,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:47:53,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792446267] [2022-04-27 10:47:53,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:53,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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 21 [2022-04-27 10:47:53,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:53,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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:53,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:53,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:47:53,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:53,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:47:53,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:47:53,391 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:53,657 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-04-27 10:47:53,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:47:53,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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 21 [2022-04-27 10:47:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-27 10:47:53,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-27 10:47:53,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-27 10:47:53,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:53,694 INFO L225 Difference]: With dead ends: 46 [2022-04-27 10:47:53,694 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 10:47:53,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 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:53,695 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:53,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 42 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:47:53,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 10:47:53,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-27 10:47:53,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:53,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:47:53,717 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:47:53,718 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:47:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:53,720 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-27 10:47:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-27 10:47:53,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:53,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:53,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-27 10:47:53,721 INFO L87 Difference]: Start difference. First operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-27 10:47:53,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:53,722 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-27 10:47:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-27 10:47:53,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:53,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:53,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:53,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:47:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-27 10:47:53,724 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2022-04-27 10:47:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:53,724 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-27 10:47:53,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-27 10:47:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 10:47:53,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:53,725 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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:53,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:47:53,726 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:53,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:53,726 INFO L85 PathProgramCache]: Analyzing trace with hash -512108736, now seen corresponding path program 1 times [2022-04-27 10:47:53,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:53,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874390708] [2022-04-27 10:47:53,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:53,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:53,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:53,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {685#(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); {671#true} is VALID [2022-04-27 10:47:53,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {671#true} assume true; {671#true} is VALID [2022-04-27 10:47:53,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {671#true} {671#true} #98#return; {671#true} is VALID [2022-04-27 10:47:53,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:47:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:53,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {671#true} ~cond := #in~cond; {671#true} is VALID [2022-04-27 10:47:53,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {671#true} assume !(0 == ~cond); {671#true} is VALID [2022-04-27 10:47:53,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {671#true} assume true; {671#true} is VALID [2022-04-27 10:47:53,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {671#true} {678#(<= (+ main_~k~0 1) main_~n~0)} #94#return; {678#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:47:53,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {671#true} call ULTIMATE.init(); {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:53,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#(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); {671#true} is VALID [2022-04-27 10:47:53,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {671#true} assume true; {671#true} is VALID [2022-04-27 10:47:53,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {671#true} {671#true} #98#return; {671#true} is VALID [2022-04-27 10:47:53,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {671#true} call #t~ret7 := main(); {671#true} is VALID [2022-04-27 10:47:53,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {671#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {671#true} is VALID [2022-04-27 10:47:53,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {671#true} assume !!(~n~0 < 1000000); {671#true} is VALID [2022-04-27 10:47:53,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {671#true} assume ~k~0 == ~n~0; {671#true} is VALID [2022-04-27 10:47:53,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {671#true} ~i~0 := 0; {676#(= main_~i~0 0)} is VALID [2022-04-27 10:47:53,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {676#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {677#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:53,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {677#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {677#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:47:53,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {677#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {678#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:47:53,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {678#(<= (+ main_~k~0 1) main_~n~0)} assume !(~k~0 < ~n~0); {678#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:47:53,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {678#(<= (+ main_~k~0 1) main_~n~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {678#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:47:53,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {678#(<= (+ main_~k~0 1) main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {678#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:47:53,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {678#(<= (+ main_~k~0 1) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {678#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:47:53,833 INFO L272 TraceCheckUtils]: 16: Hoare triple {678#(<= (+ main_~k~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {671#true} is VALID [2022-04-27 10:47:53,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {671#true} ~cond := #in~cond; {671#true} is VALID [2022-04-27 10:47:53,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {671#true} assume !(0 == ~cond); {671#true} is VALID [2022-04-27 10:47:53,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {671#true} assume true; {671#true} is VALID [2022-04-27 10:47:53,834 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {671#true} {678#(<= (+ main_~k~0 1) main_~n~0)} #94#return; {678#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:47:53,835 INFO L272 TraceCheckUtils]: 21: Hoare triple {678#(<= (+ main_~k~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {683#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:53,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {683#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {684#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:53,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {684#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {672#false} is VALID [2022-04-27 10:47:53,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {672#false} assume !false; {672#false} is VALID [2022-04-27 10:47:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:47:53,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:53,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874390708] [2022-04-27 10:47:53,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874390708] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:47:53,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692107764] [2022-04-27 10:47:53,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:53,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:53,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:47:53,845 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:53,850 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:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:53,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 10:47:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:53,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:47:54,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {671#true} call ULTIMATE.init(); {671#true} is VALID [2022-04-27 10:47:54,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {671#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); {671#true} is VALID [2022-04-27 10:47:54,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {671#true} assume true; {671#true} is VALID [2022-04-27 10:47:54,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {671#true} {671#true} #98#return; {671#true} is VALID [2022-04-27 10:47:54,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {671#true} call #t~ret7 := main(); {671#true} is VALID [2022-04-27 10:47:54,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {671#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {671#true} is VALID [2022-04-27 10:47:54,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {671#true} assume !!(~n~0 < 1000000); {671#true} is VALID [2022-04-27 10:47:54,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {671#true} assume ~k~0 == ~n~0; {671#true} is VALID [2022-04-27 10:47:54,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {671#true} ~i~0 := 0; {713#(<= main_~i~0 0)} is VALID [2022-04-27 10:47:54,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {713#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {717#(and (< (div (- main_~j~0) (- 2)) main_~n~0) (<= (div (- main_~j~0) (- 2)) 0))} is VALID [2022-04-27 10:47:54,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {717#(and (< (div (- main_~j~0) (- 2)) main_~n~0) (<= (div (- main_~j~0) (- 2)) 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {717#(and (< (div (- main_~j~0) (- 2)) main_~n~0) (<= (div (- main_~j~0) (- 2)) 0))} is VALID [2022-04-27 10:47:54,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {717#(and (< (div (- main_~j~0) (- 2)) main_~n~0) (<= (div (- main_~j~0) (- 2)) 0))} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {724#(and (<= (div (* (- 1) main_~k~0) (- 2)) 0) (< (div (* (- 1) main_~k~0) (- 2)) main_~n~0))} is VALID [2022-04-27 10:47:54,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#(and (<= (div (* (- 1) main_~k~0) (- 2)) 0) (< (div (* (- 1) main_~k~0) (- 2)) main_~n~0))} assume !(~k~0 < ~n~0); {672#false} is VALID [2022-04-27 10:47:54,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {672#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {672#false} is VALID [2022-04-27 10:47:54,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {672#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {672#false} is VALID [2022-04-27 10:47:54,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {672#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {672#false} is VALID [2022-04-27 10:47:54,643 INFO L272 TraceCheckUtils]: 16: Hoare triple {672#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {672#false} is VALID [2022-04-27 10:47:54,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {672#false} ~cond := #in~cond; {672#false} is VALID [2022-04-27 10:47:54,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {672#false} assume !(0 == ~cond); {672#false} is VALID [2022-04-27 10:47:54,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {672#false} assume true; {672#false} is VALID [2022-04-27 10:47:54,651 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {672#false} {672#false} #94#return; {672#false} is VALID [2022-04-27 10:47:54,652 INFO L272 TraceCheckUtils]: 21: Hoare triple {672#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {672#false} is VALID [2022-04-27 10:47:54,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {672#false} ~cond := #in~cond; {672#false} is VALID [2022-04-27 10:47:54,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {672#false} assume 0 == ~cond; {672#false} is VALID [2022-04-27 10:47:54,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {672#false} assume !false; {672#false} is VALID [2022-04-27 10:47:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:47:54,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:47:54,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692107764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:54,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:47:54,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-04-27 10:47:54,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824081665] [2022-04-27 10:47:54,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:54,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-27 10:47:54,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:54,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:47:54,668 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:54,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:47:54,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:54,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:47:54,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-27 10:47:54,672 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:47:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:54,872 INFO L93 Difference]: Finished difference Result 107 states and 137 transitions. [2022-04-27 10:47:54,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:47:54,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-27 10:47:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:54,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:47:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-27 10:47:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:47:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-27 10:47:54,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2022-04-27 10:47:54,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:54,932 INFO L225 Difference]: With dead ends: 107 [2022-04-27 10:47:54,932 INFO L226 Difference]: Without dead ends: 72 [2022-04-27 10:47:54,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:47:54,934 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:54,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 89 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:47:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-27 10:47:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 48. [2022-04-27 10:47:54,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:54,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:47:54,975 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:47:54,975 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:47:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:54,978 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-27 10:47:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2022-04-27 10:47:54,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:54,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:54,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 72 states. [2022-04-27 10:47:54,979 INFO L87 Difference]: Start difference. First operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 72 states. [2022-04-27 10:47:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:54,981 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-27 10:47:54,981 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2022-04-27 10:47:54,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:54,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:54,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:54,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:47:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-27 10:47:54,984 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2022-04-27 10:47:54,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:54,984 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-27 10:47:54,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:47:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 10:47:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 10:47:54,985 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:54,985 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, 1, 1, 1] [2022-04-27 10:47:55,004 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:55,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:55,200 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:55,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:55,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1758799342, now seen corresponding path program 1 times [2022-04-27 10:47:55,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:55,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774300153] [2022-04-27 10:47:55,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:55,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:55,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:55,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {1155#(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); {1135#true} is VALID [2022-04-27 10:47:55,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {1135#true} assume true; {1135#true} is VALID [2022-04-27 10:47:55,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1135#true} {1135#true} #98#return; {1135#true} is VALID [2022-04-27 10:47:55,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 10:47:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:55,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {1135#true} ~cond := #in~cond; {1135#true} is VALID [2022-04-27 10:47:55,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {1135#true} assume !(0 == ~cond); {1135#true} is VALID [2022-04-27 10:47:55,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {1135#true} assume true; {1135#true} is VALID [2022-04-27 10:47:55,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1135#true} {1142#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} #92#return; {1147#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:47:55,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 10:47:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:55,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {1135#true} ~cond := #in~cond; {1135#true} is VALID [2022-04-27 10:47:55,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {1135#true} assume !(0 == ~cond); {1135#true} is VALID [2022-04-27 10:47:55,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {1135#true} assume true; {1135#true} is VALID [2022-04-27 10:47:55,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1135#true} {1148#(<= main_~k~0 main_~n~0)} #94#return; {1148#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 10:47:55,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {1135#true} call ULTIMATE.init(); {1155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:55,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#(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); {1135#true} is VALID [2022-04-27 10:47:55,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {1135#true} assume true; {1135#true} is VALID [2022-04-27 10:47:55,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1135#true} {1135#true} #98#return; {1135#true} is VALID [2022-04-27 10:47:55,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {1135#true} call #t~ret7 := main(); {1135#true} is VALID [2022-04-27 10:47:55,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {1135#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {1135#true} is VALID [2022-04-27 10:47:55,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {1135#true} assume !!(~n~0 < 1000000); {1135#true} is VALID [2022-04-27 10:47:55,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {1135#true} assume ~k~0 == ~n~0; {1135#true} is VALID [2022-04-27 10:47:55,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {1135#true} ~i~0 := 0; {1140#(= main_~i~0 0)} is VALID [2022-04-27 10:47:55,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {1140#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1141#(and (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (= main_~i~0 0))} is VALID [2022-04-27 10:47:55,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {1141#(and (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (= main_~i~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1141#(and (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (= main_~i~0 0))} is VALID [2022-04-27 10:47:55,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {1141#(and (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (= main_~i~0 0))} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1142#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} is VALID [2022-04-27 10:47:55,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {1142#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} assume !!(~k~0 < ~n~0); {1142#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} is VALID [2022-04-27 10:47:55,331 INFO L272 TraceCheckUtils]: 13: Hoare triple {1142#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1135#true} is VALID [2022-04-27 10:47:55,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {1135#true} ~cond := #in~cond; {1135#true} is VALID [2022-04-27 10:47:55,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {1135#true} assume !(0 == ~cond); {1135#true} is VALID [2022-04-27 10:47:55,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {1135#true} assume true; {1135#true} is VALID [2022-04-27 10:47:55,332 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1135#true} {1142#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} #92#return; {1147#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:47:55,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {1147#(<= (+ main_~k~0 1) main_~n~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1148#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 10:47:55,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {1148#(<= main_~k~0 main_~n~0)} assume !(~k~0 < ~n~0); {1148#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 10:47:55,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {1148#(<= main_~k~0 main_~n~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1148#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 10:47:55,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {1148#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1148#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 10:47:55,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {1148#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {1148#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 10:47:55,333 INFO L272 TraceCheckUtils]: 23: Hoare triple {1148#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1135#true} is VALID [2022-04-27 10:47:55,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {1135#true} ~cond := #in~cond; {1135#true} is VALID [2022-04-27 10:47:55,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {1135#true} assume !(0 == ~cond); {1135#true} is VALID [2022-04-27 10:47:55,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {1135#true} assume true; {1135#true} is VALID [2022-04-27 10:47:55,334 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1135#true} {1148#(<= main_~k~0 main_~n~0)} #94#return; {1148#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 10:47:55,334 INFO L272 TraceCheckUtils]: 28: Hoare triple {1148#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1153#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:55,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {1153#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1154#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:55,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {1154#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1136#false} is VALID [2022-04-27 10:47:55,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {1136#false} assume !false; {1136#false} is VALID [2022-04-27 10:47:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:47:55,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:55,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774300153] [2022-04-27 10:47:55,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774300153] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:47:55,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501069997] [2022-04-27 10:47:55,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:55,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:55,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:47:55,337 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:55,338 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:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:55,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 10:47:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:55,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:47:55,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {1135#true} call ULTIMATE.init(); {1135#true} is VALID [2022-04-27 10:47:55,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {1135#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); {1135#true} is VALID [2022-04-27 10:47:55,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {1135#true} assume true; {1135#true} is VALID [2022-04-27 10:47:55,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1135#true} {1135#true} #98#return; {1135#true} is VALID [2022-04-27 10:47:55,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {1135#true} call #t~ret7 := main(); {1135#true} is VALID [2022-04-27 10:47:55,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {1135#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {1135#true} is VALID [2022-04-27 10:47:55,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {1135#true} assume !!(~n~0 < 1000000); {1135#true} is VALID [2022-04-27 10:47:55,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {1135#true} assume ~k~0 == ~n~0; {1135#true} is VALID [2022-04-27 10:47:55,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {1135#true} ~i~0 := 0; {1135#true} is VALID [2022-04-27 10:47:55,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {1135#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1135#true} is VALID [2022-04-27 10:47:55,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {1135#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1135#true} is VALID [2022-04-27 10:47:55,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {1135#true} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1192#(<= main_~k~0 main_~j~0)} is VALID [2022-04-27 10:47:55,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {1192#(<= main_~k~0 main_~j~0)} assume !!(~k~0 < ~n~0); {1192#(<= main_~k~0 main_~j~0)} is VALID [2022-04-27 10:47:55,482 INFO L272 TraceCheckUtils]: 13: Hoare triple {1192#(<= main_~k~0 main_~j~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1135#true} is VALID [2022-04-27 10:47:55,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {1135#true} ~cond := #in~cond; {1135#true} is VALID [2022-04-27 10:47:55,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {1135#true} assume !(0 == ~cond); {1135#true} is VALID [2022-04-27 10:47:55,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {1135#true} assume true; {1135#true} is VALID [2022-04-27 10:47:55,483 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1135#true} {1192#(<= main_~k~0 main_~j~0)} #92#return; {1192#(<= main_~k~0 main_~j~0)} is VALID [2022-04-27 10:47:55,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {1192#(<= main_~k~0 main_~j~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1214#(<= main_~k~0 (+ main_~j~0 1))} is VALID [2022-04-27 10:47:55,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {1214#(<= main_~k~0 (+ main_~j~0 1))} assume !(~k~0 < ~n~0); {1218#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2022-04-27 10:47:55,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {1218#(<= main_~n~0 (+ main_~j~0 1))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1222#(<= main_~n~0 main_~j~0)} is VALID [2022-04-27 10:47:55,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {1222#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1136#false} is VALID [2022-04-27 10:47:55,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {1136#false} is VALID [2022-04-27 10:47:55,487 INFO L272 TraceCheckUtils]: 23: Hoare triple {1136#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1136#false} is VALID [2022-04-27 10:47:55,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {1136#false} ~cond := #in~cond; {1136#false} is VALID [2022-04-27 10:47:55,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {1136#false} assume !(0 == ~cond); {1136#false} is VALID [2022-04-27 10:47:55,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {1136#false} assume true; {1136#false} is VALID [2022-04-27 10:47:55,488 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1136#false} {1136#false} #94#return; {1136#false} is VALID [2022-04-27 10:47:55,488 INFO L272 TraceCheckUtils]: 28: Hoare triple {1136#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1136#false} is VALID [2022-04-27 10:47:55,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {1136#false} ~cond := #in~cond; {1136#false} is VALID [2022-04-27 10:47:55,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {1136#false} assume 0 == ~cond; {1136#false} is VALID [2022-04-27 10:47:55,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {1136#false} assume !false; {1136#false} is VALID [2022-04-27 10:47:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:47:55,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:47:55,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {1136#false} assume !false; {1136#false} is VALID [2022-04-27 10:47:55,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {1136#false} assume 0 == ~cond; {1136#false} is VALID [2022-04-27 10:47:55,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {1136#false} ~cond := #in~cond; {1136#false} is VALID [2022-04-27 10:47:55,600 INFO L272 TraceCheckUtils]: 28: Hoare triple {1136#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1136#false} is VALID [2022-04-27 10:47:55,600 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1135#true} {1136#false} #94#return; {1136#false} is VALID [2022-04-27 10:47:55,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {1135#true} assume true; {1135#true} is VALID [2022-04-27 10:47:55,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {1135#true} assume !(0 == ~cond); {1135#true} is VALID [2022-04-27 10:47:55,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {1135#true} ~cond := #in~cond; {1135#true} is VALID [2022-04-27 10:47:55,601 INFO L272 TraceCheckUtils]: 23: Hoare triple {1136#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1135#true} is VALID [2022-04-27 10:47:55,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {1136#false} is VALID [2022-04-27 10:47:55,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {1222#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1136#false} is VALID [2022-04-27 10:47:55,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {1218#(<= main_~n~0 (+ main_~j~0 1))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1222#(<= main_~n~0 main_~j~0)} is VALID [2022-04-27 10:47:55,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {1214#(<= main_~k~0 (+ main_~j~0 1))} assume !(~k~0 < ~n~0); {1218#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2022-04-27 10:47:55,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {1192#(<= main_~k~0 main_~j~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1214#(<= main_~k~0 (+ main_~j~0 1))} is VALID [2022-04-27 10:47:55,603 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1135#true} {1192#(<= main_~k~0 main_~j~0)} #92#return; {1192#(<= main_~k~0 main_~j~0)} is VALID [2022-04-27 10:47:55,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {1135#true} assume true; {1135#true} is VALID [2022-04-27 10:47:55,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {1135#true} assume !(0 == ~cond); {1135#true} is VALID [2022-04-27 10:47:55,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {1135#true} ~cond := #in~cond; {1135#true} is VALID [2022-04-27 10:47:55,604 INFO L272 TraceCheckUtils]: 13: Hoare triple {1192#(<= main_~k~0 main_~j~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1135#true} is VALID [2022-04-27 10:47:55,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {1192#(<= main_~k~0 main_~j~0)} assume !!(~k~0 < ~n~0); {1192#(<= main_~k~0 main_~j~0)} is VALID [2022-04-27 10:47:55,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {1135#true} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1192#(<= main_~k~0 main_~j~0)} is VALID [2022-04-27 10:47:55,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {1135#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1135#true} is VALID [2022-04-27 10:47:55,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {1135#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1135#true} is VALID [2022-04-27 10:47:55,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {1135#true} ~i~0 := 0; {1135#true} is VALID [2022-04-27 10:47:55,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {1135#true} assume ~k~0 == ~n~0; {1135#true} is VALID [2022-04-27 10:47:55,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {1135#true} assume !!(~n~0 < 1000000); {1135#true} is VALID [2022-04-27 10:47:55,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {1135#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {1135#true} is VALID [2022-04-27 10:47:55,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {1135#true} call #t~ret7 := main(); {1135#true} is VALID [2022-04-27 10:47:55,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1135#true} {1135#true} #98#return; {1135#true} is VALID [2022-04-27 10:47:55,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {1135#true} assume true; {1135#true} is VALID [2022-04-27 10:47:55,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {1135#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); {1135#true} is VALID [2022-04-27 10:47:55,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {1135#true} call ULTIMATE.init(); {1135#true} is VALID [2022-04-27 10:47:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:47:55,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501069997] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:47:55,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:47:55,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2022-04-27 10:47:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989615732] [2022-04-27 10:47:55,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:47:55,609 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2022-04-27 10:47:55,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:55,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:47:55,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:55,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:47:55,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:55,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:47:55,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:47:55,642 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:47:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:56,679 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-27 10:47:56,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 10:47:56,679 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2022-04-27 10:47:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:56,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:47:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 114 transitions. [2022-04-27 10:47:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:47:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 114 transitions. [2022-04-27 10:47:56,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 114 transitions. [2022-04-27 10:47:56,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:56,765 INFO L225 Difference]: With dead ends: 118 [2022-04-27 10:47:56,766 INFO L226 Difference]: Without dead ends: 94 [2022-04-27 10:47:56,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 10:47:56,767 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 87 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:56,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 66 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:47:56,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-27 10:47:56,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 66. [2022-04-27 10:47:56,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:56,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 10:47:56,837 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 10:47:56,838 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 10:47:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:56,840 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2022-04-27 10:47:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2022-04-27 10:47:56,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:56,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:56,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 94 states. [2022-04-27 10:47:56,841 INFO L87 Difference]: Start difference. First operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 94 states. [2022-04-27 10:47:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:56,844 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2022-04-27 10:47:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2022-04-27 10:47:56,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:56,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:56,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:56,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 10:47:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2022-04-27 10:47:56,846 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 32 [2022-04-27 10:47:56,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:56,847 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2022-04-27 10:47:56,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:47:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2022-04-27 10:47:56,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 10:47:56,848 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:56,848 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-04-27 10:47:56,863 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:57,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:57,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:57,064 INFO L85 PathProgramCache]: Analyzing trace with hash 712456319, now seen corresponding path program 1 times [2022-04-27 10:47:57,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:57,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319876975] [2022-04-27 10:47:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:57,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:57,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:57,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {1875#(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); {1856#true} is VALID [2022-04-27 10:47:57,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 10:47:57,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1856#true} {1856#true} #98#return; {1856#true} is VALID [2022-04-27 10:47:57,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 10:47:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:57,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 10:47:57,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 10:47:57,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 10:47:57,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} #92#return; {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-27 10:47:57,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-27 10:47:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:57,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 10:47:57,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 10:47:57,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 10:47:57,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1857#false} #94#return; {1857#false} is VALID [2022-04-27 10:47:57,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {1856#true} call ULTIMATE.init(); {1875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:57,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {1875#(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); {1856#true} is VALID [2022-04-27 10:47:57,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 10:47:57,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1856#true} #98#return; {1856#true} is VALID [2022-04-27 10:47:57,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {1856#true} call #t~ret7 := main(); {1856#true} is VALID [2022-04-27 10:47:57,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {1856#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {1856#true} is VALID [2022-04-27 10:47:57,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {1856#true} assume !!(~n~0 < 1000000); {1856#true} is VALID [2022-04-27 10:47:57,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {1856#true} assume ~k~0 == ~n~0; {1856#true} is VALID [2022-04-27 10:47:57,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {1856#true} ~i~0 := 0; {1861#(= main_~i~0 0)} is VALID [2022-04-27 10:47:57,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {1861#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1862#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 10:47:57,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {1862#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1862#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 10:47:57,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {1862#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-27 10:47:57,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} assume !!(~k~0 < ~n~0); {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-27 10:47:57,190 INFO L272 TraceCheckUtils]: 13: Hoare triple {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1856#true} is VALID [2022-04-27 10:47:57,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 10:47:57,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 10:47:57,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 10:47:57,192 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1856#true} {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} #92#return; {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-27 10:47:57,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1868#(and (<= main_~k~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} is VALID [2022-04-27 10:47:57,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {1868#(and (<= main_~k~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} assume !(~k~0 < ~n~0); {1869#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 10:47:57,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {1869#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1869#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 10:47:57,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {1869#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} assume !(~j~0 < ~n~0); {1869#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 10:47:57,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {1869#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1870#(<= main_~n~0 main_~i~0)} is VALID [2022-04-27 10:47:57,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {1870#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1857#false} is VALID [2022-04-27 10:47:57,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {1857#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1857#false} is VALID [2022-04-27 10:47:57,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {1857#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1857#false} is VALID [2022-04-27 10:47:57,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {1857#false} assume !(~k~0 < ~n~0); {1857#false} is VALID [2022-04-27 10:47:57,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {1857#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1857#false} is VALID [2022-04-27 10:47:57,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {1857#false} assume !(~j~0 < ~n~0); {1857#false} is VALID [2022-04-27 10:47:57,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {1857#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1857#false} is VALID [2022-04-27 10:47:57,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {1857#false} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1857#false} is VALID [2022-04-27 10:47:57,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {1857#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1857#false} is VALID [2022-04-27 10:47:57,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {1857#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {1857#false} is VALID [2022-04-27 10:47:57,196 INFO L272 TraceCheckUtils]: 33: Hoare triple {1857#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1856#true} is VALID [2022-04-27 10:47:57,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 10:47:57,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 10:47:57,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 10:47:57,196 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1856#true} {1857#false} #94#return; {1857#false} is VALID [2022-04-27 10:47:57,196 INFO L272 TraceCheckUtils]: 38: Hoare triple {1857#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1857#false} is VALID [2022-04-27 10:47:57,196 INFO L290 TraceCheckUtils]: 39: Hoare triple {1857#false} ~cond := #in~cond; {1857#false} is VALID [2022-04-27 10:47:57,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {1857#false} assume 0 == ~cond; {1857#false} is VALID [2022-04-27 10:47:57,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {1857#false} assume !false; {1857#false} is VALID [2022-04-27 10:47:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 10:47:57,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:57,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319876975] [2022-04-27 10:47:57,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319876975] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:47:57,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007369669] [2022-04-27 10:47:57,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:57,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:57,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:47:57,199 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:57,203 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:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:57,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:47:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:57,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:47:57,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {1856#true} call ULTIMATE.init(); {1856#true} is VALID [2022-04-27 10:47:57,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#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); {1856#true} is VALID [2022-04-27 10:47:57,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 10:47:57,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1856#true} #98#return; {1856#true} is VALID [2022-04-27 10:47:57,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {1856#true} call #t~ret7 := main(); {1856#true} is VALID [2022-04-27 10:47:57,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {1856#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {1856#true} is VALID [2022-04-27 10:47:57,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {1856#true} assume !!(~n~0 < 1000000); {1856#true} is VALID [2022-04-27 10:47:57,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {1856#true} assume ~k~0 == ~n~0; {1856#true} is VALID [2022-04-27 10:47:57,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {1856#true} ~i~0 := 0; {1903#(<= main_~i~0 0)} is VALID [2022-04-27 10:47:57,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {1903#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1907#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-27 10:47:57,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {1907#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1907#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-27 10:47:57,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {1907#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1914#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-27 10:47:57,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {1914#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} assume !!(~k~0 < ~n~0); {1914#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-27 10:47:57,729 INFO L272 TraceCheckUtils]: 13: Hoare triple {1914#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1856#true} is VALID [2022-04-27 10:47:57,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 10:47:57,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 10:47:57,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 10:47:57,730 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1856#true} {1914#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} #92#return; {1914#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-27 10:47:57,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {1914#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1936#(and (<= main_~i~0 0) (<= main_~k~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 10:47:57,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {1936#(and (<= main_~i~0 0) (<= main_~k~0 (+ (* main_~i~0 2) 1)))} assume !(~k~0 < ~n~0); {1940#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 10:47:57,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {1940#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1940#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 10:47:57,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {1940#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} assume !(~j~0 < ~n~0); {1940#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 10:47:57,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {1940#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1950#(and (<= (+ (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1) main_~i~0) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) 0))} is VALID [2022-04-27 10:47:57,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {1950#(and (<= (+ (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1) main_~i~0) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) 0))} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1857#false} is VALID [2022-04-27 10:47:57,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {1857#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1857#false} is VALID [2022-04-27 10:47:57,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {1857#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1857#false} is VALID [2022-04-27 10:47:57,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {1857#false} assume !(~k~0 < ~n~0); {1857#false} is VALID [2022-04-27 10:47:57,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {1857#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1857#false} is VALID [2022-04-27 10:47:57,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {1857#false} assume !(~j~0 < ~n~0); {1857#false} is VALID [2022-04-27 10:47:57,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {1857#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1857#false} is VALID [2022-04-27 10:47:57,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {1857#false} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1857#false} is VALID [2022-04-27 10:47:57,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {1857#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1857#false} is VALID [2022-04-27 10:47:57,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {1857#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {1857#false} is VALID [2022-04-27 10:47:57,733 INFO L272 TraceCheckUtils]: 33: Hoare triple {1857#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1857#false} is VALID [2022-04-27 10:47:57,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {1857#false} ~cond := #in~cond; {1857#false} is VALID [2022-04-27 10:47:57,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {1857#false} assume !(0 == ~cond); {1857#false} is VALID [2022-04-27 10:47:57,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {1857#false} assume true; {1857#false} is VALID [2022-04-27 10:47:57,734 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1857#false} {1857#false} #94#return; {1857#false} is VALID [2022-04-27 10:47:57,734 INFO L272 TraceCheckUtils]: 38: Hoare triple {1857#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1857#false} is VALID [2022-04-27 10:47:57,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {1857#false} ~cond := #in~cond; {1857#false} is VALID [2022-04-27 10:47:57,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {1857#false} assume 0 == ~cond; {1857#false} is VALID [2022-04-27 10:47:57,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {1857#false} assume !false; {1857#false} is VALID [2022-04-27 10:47:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 10:47:57,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:47:57,927 INFO L290 TraceCheckUtils]: 41: Hoare triple {1857#false} assume !false; {1857#false} is VALID [2022-04-27 10:47:57,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {1857#false} assume 0 == ~cond; {1857#false} is VALID [2022-04-27 10:47:57,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {1857#false} ~cond := #in~cond; {1857#false} is VALID [2022-04-27 10:47:57,928 INFO L272 TraceCheckUtils]: 38: Hoare triple {1857#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1857#false} is VALID [2022-04-27 10:47:57,928 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1856#true} {1857#false} #94#return; {1857#false} is VALID [2022-04-27 10:47:57,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 10:47:57,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 10:47:57,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 10:47:57,928 INFO L272 TraceCheckUtils]: 33: Hoare triple {1857#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1856#true} is VALID [2022-04-27 10:47:57,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {1857#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {1857#false} is VALID [2022-04-27 10:47:57,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {1857#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1857#false} is VALID [2022-04-27 10:47:57,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {1857#false} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1857#false} is VALID [2022-04-27 10:47:57,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {1857#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1857#false} is VALID [2022-04-27 10:47:57,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {1857#false} assume !(~j~0 < ~n~0); {1857#false} is VALID [2022-04-27 10:47:57,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {1857#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1857#false} is VALID [2022-04-27 10:47:57,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {1857#false} assume !(~k~0 < ~n~0); {1857#false} is VALID [2022-04-27 10:47:57,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {1857#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1857#false} is VALID [2022-04-27 10:47:57,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {1857#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1857#false} is VALID [2022-04-27 10:47:57,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {1870#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1857#false} is VALID [2022-04-27 10:47:57,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {2065#(<= main_~n~0 (+ main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1870#(<= main_~n~0 main_~i~0)} is VALID [2022-04-27 10:47:57,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {2065#(<= main_~n~0 (+ main_~i~0 1))} assume !(~j~0 < ~n~0); {2065#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:47:57,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {2065#(<= main_~n~0 (+ main_~i~0 1))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2065#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:47:57,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {2075#(<= main_~k~0 (+ main_~i~0 1))} assume !(~k~0 < ~n~0); {2065#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:47:57,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {2079#(<= main_~k~0 main_~i~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2075#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:47:57,933 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1856#true} {2079#(<= main_~k~0 main_~i~0)} #92#return; {2079#(<= main_~k~0 main_~i~0)} is VALID [2022-04-27 10:47:57,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 10:47:57,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 10:47:57,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 10:47:57,933 INFO L272 TraceCheckUtils]: 13: Hoare triple {2079#(<= main_~k~0 main_~i~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1856#true} is VALID [2022-04-27 10:47:57,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {2079#(<= main_~k~0 main_~i~0)} assume !!(~k~0 < ~n~0); {2079#(<= main_~k~0 main_~i~0)} is VALID [2022-04-27 10:47:57,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {2101#(<= main_~j~0 main_~i~0)} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2079#(<= main_~k~0 main_~i~0)} is VALID [2022-04-27 10:47:57,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {2101#(<= main_~j~0 main_~i~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2101#(<= main_~j~0 main_~i~0)} is VALID [2022-04-27 10:47:57,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {1903#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2101#(<= main_~j~0 main_~i~0)} is VALID [2022-04-27 10:47:57,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {1856#true} ~i~0 := 0; {1903#(<= main_~i~0 0)} is VALID [2022-04-27 10:47:57,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {1856#true} assume ~k~0 == ~n~0; {1856#true} is VALID [2022-04-27 10:47:57,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {1856#true} assume !!(~n~0 < 1000000); {1856#true} is VALID [2022-04-27 10:47:57,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {1856#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {1856#true} is VALID [2022-04-27 10:47:57,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {1856#true} call #t~ret7 := main(); {1856#true} is VALID [2022-04-27 10:47:57,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1856#true} #98#return; {1856#true} is VALID [2022-04-27 10:47:57,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 10:47:57,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#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); {1856#true} is VALID [2022-04-27 10:47:57,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {1856#true} call ULTIMATE.init(); {1856#true} is VALID [2022-04-27 10:47:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 10:47:57,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007369669] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:47:57,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:47:57,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-04-27 10:47:57,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057313351] [2022-04-27 10:47:57,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:47:57,937 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-27 10:47:57,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:57,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:47:57,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:57,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 10:47:57,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:57,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 10:47:57,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-04-27 10:47:57,991 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:47:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:58,725 INFO L93 Difference]: Finished difference Result 129 states and 163 transitions. [2022-04-27 10:47:58,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:47:58,725 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-27 10:47:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:47:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-04-27 10:47:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:47:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-04-27 10:47:58,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 93 transitions. [2022-04-27 10:47:58,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:58,794 INFO L225 Difference]: With dead ends: 129 [2022-04-27 10:47:58,794 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 10:47:58,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2022-04-27 10:47:58,795 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 92 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:58,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 45 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:47:58,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 10:47:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2022-04-27 10:47:58,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:58,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 10:47:58,910 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 10:47:58,910 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 10:47:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:58,913 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-04-27 10:47:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-04-27 10:47:58,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:58,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:58,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 82 states. [2022-04-27 10:47:58,914 INFO L87 Difference]: Start difference. First operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 82 states. [2022-04-27 10:47:58,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:58,916 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-04-27 10:47:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-04-27 10:47:58,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:58,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:58,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:58,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 10:47:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-04-27 10:47:58,918 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 42 [2022-04-27 10:47:58,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:58,919 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-04-27 10:47:58,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:47:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-27 10:47:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 10:47:58,919 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:58,919 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-04-27 10:47:58,941 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:59,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:59,135 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:59,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:59,136 INFO L85 PathProgramCache]: Analyzing trace with hash -729588824, now seen corresponding path program 1 times [2022-04-27 10:47:59,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:59,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025903121] [2022-04-27 10:47:59,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:59,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:59,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:59,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {2636#(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); {2614#true} is VALID [2022-04-27 10:47:59,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {2614#true} assume true; {2614#true} is VALID [2022-04-27 10:47:59,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2614#true} {2614#true} #98#return; {2614#true} is VALID [2022-04-27 10:47:59,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 10:47:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:59,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {2614#true} ~cond := #in~cond; {2614#true} is VALID [2022-04-27 10:47:59,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {2614#true} assume !(0 == ~cond); {2614#true} is VALID [2022-04-27 10:47:59,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {2614#true} assume true; {2614#true} is VALID [2022-04-27 10:47:59,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2614#true} {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} #94#return; {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 10:47:59,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 10:47:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:59,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {2614#true} ~cond := #in~cond; {2614#true} is VALID [2022-04-27 10:47:59,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {2614#true} assume !(0 == ~cond); {2614#true} is VALID [2022-04-27 10:47:59,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {2614#true} assume true; {2614#true} is VALID [2022-04-27 10:47:59,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2614#true} {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} #96#return; {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 10:47:59,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-27 10:47:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:59,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {2614#true} ~cond := #in~cond; {2614#true} is VALID [2022-04-27 10:47:59,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {2614#true} assume !(0 == ~cond); {2614#true} is VALID [2022-04-27 10:47:59,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {2614#true} assume true; {2614#true} is VALID [2022-04-27 10:47:59,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2614#true} {2615#false} #94#return; {2615#false} is VALID [2022-04-27 10:47:59,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {2614#true} call ULTIMATE.init(); {2636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:59,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {2636#(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); {2614#true} is VALID [2022-04-27 10:47:59,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {2614#true} assume true; {2614#true} is VALID [2022-04-27 10:47:59,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2614#true} {2614#true} #98#return; {2614#true} is VALID [2022-04-27 10:47:59,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {2614#true} call #t~ret7 := main(); {2614#true} is VALID [2022-04-27 10:47:59,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {2614#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {2614#true} is VALID [2022-04-27 10:47:59,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {2614#true} assume !!(~n~0 < 1000000); {2614#true} is VALID [2022-04-27 10:47:59,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {2614#true} assume ~k~0 == ~n~0; {2614#true} is VALID [2022-04-27 10:47:59,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {2614#true} ~i~0 := 0; {2619#(= main_~i~0 0)} is VALID [2022-04-27 10:47:59,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {2619#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 10:47:59,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 10:47:59,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 10:47:59,215 INFO L272 TraceCheckUtils]: 12: Hoare triple {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {2614#true} is VALID [2022-04-27 10:47:59,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {2614#true} ~cond := #in~cond; {2614#true} is VALID [2022-04-27 10:47:59,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {2614#true} assume !(0 == ~cond); {2614#true} is VALID [2022-04-27 10:47:59,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {2614#true} assume true; {2614#true} is VALID [2022-04-27 10:47:59,215 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2614#true} {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} #94#return; {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 10:47:59,215 INFO L272 TraceCheckUtils]: 17: Hoare triple {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {2614#true} is VALID [2022-04-27 10:47:59,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {2614#true} ~cond := #in~cond; {2614#true} is VALID [2022-04-27 10:47:59,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {2614#true} assume !(0 == ~cond); {2614#true} is VALID [2022-04-27 10:47:59,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {2614#true} assume true; {2614#true} is VALID [2022-04-27 10:47:59,216 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2614#true} {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} #96#return; {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 10:47:59,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2629#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} is VALID [2022-04-27 10:47:59,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} assume !(~j~0 < ~n~0); {2630#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 10:47:59,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {2630#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2631#(<= main_~n~0 main_~i~0)} is VALID [2022-04-27 10:47:59,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {2631#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2615#false} is VALID [2022-04-27 10:47:59,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {2615#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2615#false} is VALID [2022-04-27 10:47:59,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {2615#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2615#false} is VALID [2022-04-27 10:47:59,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {2615#false} assume !(~k~0 < ~n~0); {2615#false} is VALID [2022-04-27 10:47:59,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {2615#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2615#false} is VALID [2022-04-27 10:47:59,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {2615#false} assume !(~j~0 < ~n~0); {2615#false} is VALID [2022-04-27 10:47:59,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {2615#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2615#false} is VALID [2022-04-27 10:47:59,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {2615#false} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2615#false} is VALID [2022-04-27 10:47:59,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {2615#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2615#false} is VALID [2022-04-27 10:47:59,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {2615#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {2615#false} is VALID [2022-04-27 10:47:59,218 INFO L272 TraceCheckUtils]: 35: Hoare triple {2615#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {2614#true} is VALID [2022-04-27 10:47:59,218 INFO L290 TraceCheckUtils]: 36: Hoare triple {2614#true} ~cond := #in~cond; {2614#true} is VALID [2022-04-27 10:47:59,218 INFO L290 TraceCheckUtils]: 37: Hoare triple {2614#true} assume !(0 == ~cond); {2614#true} is VALID [2022-04-27 10:47:59,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {2614#true} assume true; {2614#true} is VALID [2022-04-27 10:47:59,219 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2614#true} {2615#false} #94#return; {2615#false} is VALID [2022-04-27 10:47:59,219 INFO L272 TraceCheckUtils]: 40: Hoare triple {2615#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {2615#false} is VALID [2022-04-27 10:47:59,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {2615#false} ~cond := #in~cond; {2615#false} is VALID [2022-04-27 10:47:59,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {2615#false} assume 0 == ~cond; {2615#false} is VALID [2022-04-27 10:47:59,219 INFO L290 TraceCheckUtils]: 43: Hoare triple {2615#false} assume !false; {2615#false} is VALID [2022-04-27 10:47:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 10:47:59,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:59,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025903121] [2022-04-27 10:47:59,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025903121] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:47:59,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743906630] [2022-04-27 10:47:59,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:59,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:59,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:47:59,220 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:59,221 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:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:59,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:47:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:59,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:47:59,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {2614#true} call ULTIMATE.init(); {2614#true} is VALID [2022-04-27 10:47:59,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {2614#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); {2614#true} is VALID [2022-04-27 10:47:59,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {2614#true} assume true; {2614#true} is VALID [2022-04-27 10:47:59,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2614#true} {2614#true} #98#return; {2614#true} is VALID [2022-04-27 10:47:59,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {2614#true} call #t~ret7 := main(); {2614#true} is VALID [2022-04-27 10:47:59,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {2614#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {2614#true} is VALID [2022-04-27 10:47:59,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {2614#true} assume !!(~n~0 < 1000000); {2614#true} is VALID [2022-04-27 10:47:59,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {2614#true} assume ~k~0 == ~n~0; {2614#true} is VALID [2022-04-27 10:47:59,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {2614#true} ~i~0 := 0; {2664#(<= main_~i~0 0)} is VALID [2022-04-27 10:47:59,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {2664#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-27 10:47:59,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-27 10:47:59,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-27 10:47:59,716 INFO L272 TraceCheckUtils]: 12: Hoare triple {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {2614#true} is VALID [2022-04-27 10:47:59,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {2614#true} ~cond := #in~cond; {2614#true} is VALID [2022-04-27 10:47:59,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {2614#true} assume !(0 == ~cond); {2614#true} is VALID [2022-04-27 10:47:59,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {2614#true} assume true; {2614#true} is VALID [2022-04-27 10:47:59,718 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2614#true} {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} #94#return; {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-27 10:47:59,718 INFO L272 TraceCheckUtils]: 17: Hoare triple {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {2614#true} is VALID [2022-04-27 10:47:59,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {2614#true} ~cond := #in~cond; {2614#true} is VALID [2022-04-27 10:47:59,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {2614#true} assume !(0 == ~cond); {2614#true} is VALID [2022-04-27 10:47:59,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {2614#true} assume true; {2614#true} is VALID [2022-04-27 10:47:59,719 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2614#true} {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} #96#return; {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-27 10:47:59,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2708#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (<= main_~i~0 0))} is VALID [2022-04-27 10:47:59,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {2708#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {2712#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 10:47:59,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {2712#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2716#(and (<= (+ (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1) main_~i~0) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) 0))} is VALID [2022-04-27 10:47:59,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {2716#(and (<= (+ (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1) main_~i~0) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) 0))} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2615#false} is VALID [2022-04-27 10:47:59,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {2615#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2615#false} is VALID [2022-04-27 10:47:59,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {2615#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2615#false} is VALID [2022-04-27 10:47:59,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {2615#false} assume !(~k~0 < ~n~0); {2615#false} is VALID [2022-04-27 10:47:59,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {2615#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2615#false} is VALID [2022-04-27 10:47:59,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {2615#false} assume !(~j~0 < ~n~0); {2615#false} is VALID [2022-04-27 10:47:59,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {2615#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2615#false} is VALID [2022-04-27 10:47:59,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {2615#false} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2615#false} is VALID [2022-04-27 10:47:59,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {2615#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2615#false} is VALID [2022-04-27 10:47:59,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {2615#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {2615#false} is VALID [2022-04-27 10:47:59,722 INFO L272 TraceCheckUtils]: 35: Hoare triple {2615#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {2615#false} is VALID [2022-04-27 10:47:59,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {2615#false} ~cond := #in~cond; {2615#false} is VALID [2022-04-27 10:47:59,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {2615#false} assume !(0 == ~cond); {2615#false} is VALID [2022-04-27 10:47:59,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {2615#false} assume true; {2615#false} is VALID [2022-04-27 10:47:59,722 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2615#false} {2615#false} #94#return; {2615#false} is VALID [2022-04-27 10:47:59,722 INFO L272 TraceCheckUtils]: 40: Hoare triple {2615#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {2615#false} is VALID [2022-04-27 10:47:59,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {2615#false} ~cond := #in~cond; {2615#false} is VALID [2022-04-27 10:47:59,722 INFO L290 TraceCheckUtils]: 42: Hoare triple {2615#false} assume 0 == ~cond; {2615#false} is VALID [2022-04-27 10:47:59,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {2615#false} assume !false; {2615#false} is VALID [2022-04-27 10:47:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 10:47:59,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:47:59,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {2615#false} assume !false; {2615#false} is VALID [2022-04-27 10:47:59,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {2615#false} assume 0 == ~cond; {2615#false} is VALID [2022-04-27 10:47:59,896 INFO L290 TraceCheckUtils]: 41: Hoare triple {2615#false} ~cond := #in~cond; {2615#false} is VALID [2022-04-27 10:47:59,896 INFO L272 TraceCheckUtils]: 40: Hoare triple {2615#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {2615#false} is VALID [2022-04-27 10:47:59,896 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2614#true} {2615#false} #94#return; {2615#false} is VALID [2022-04-27 10:47:59,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {2614#true} assume true; {2614#true} is VALID [2022-04-27 10:47:59,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {2614#true} assume !(0 == ~cond); {2614#true} is VALID [2022-04-27 10:47:59,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {2614#true} ~cond := #in~cond; {2614#true} is VALID [2022-04-27 10:47:59,897 INFO L272 TraceCheckUtils]: 35: Hoare triple {2615#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {2614#true} is VALID [2022-04-27 10:47:59,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {2615#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {2615#false} is VALID [2022-04-27 10:47:59,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {2615#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2615#false} is VALID [2022-04-27 10:47:59,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {2615#false} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2615#false} is VALID [2022-04-27 10:47:59,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {2615#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2615#false} is VALID [2022-04-27 10:47:59,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {2615#false} assume !(~j~0 < ~n~0); {2615#false} is VALID [2022-04-27 10:47:59,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {2615#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2615#false} is VALID [2022-04-27 10:47:59,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {2615#false} assume !(~k~0 < ~n~0); {2615#false} is VALID [2022-04-27 10:47:59,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {2615#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2615#false} is VALID [2022-04-27 10:47:59,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {2615#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2615#false} is VALID [2022-04-27 10:47:59,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {2631#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2615#false} is VALID [2022-04-27 10:47:59,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {2831#(<= main_~n~0 (+ main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2631#(<= main_~n~0 main_~i~0)} is VALID [2022-04-27 10:47:59,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {2835#(<= main_~j~0 (+ main_~i~0 1))} assume !(~j~0 < ~n~0); {2831#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:47:59,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {2839#(<= main_~j~0 main_~i~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2835#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:47:59,906 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2614#true} {2839#(<= main_~j~0 main_~i~0)} #96#return; {2839#(<= main_~j~0 main_~i~0)} is VALID [2022-04-27 10:47:59,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {2614#true} assume true; {2614#true} is VALID [2022-04-27 10:47:59,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {2614#true} assume !(0 == ~cond); {2614#true} is VALID [2022-04-27 10:47:59,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {2614#true} ~cond := #in~cond; {2614#true} is VALID [2022-04-27 10:47:59,906 INFO L272 TraceCheckUtils]: 17: Hoare triple {2839#(<= main_~j~0 main_~i~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {2614#true} is VALID [2022-04-27 10:47:59,907 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2614#true} {2839#(<= main_~j~0 main_~i~0)} #94#return; {2839#(<= main_~j~0 main_~i~0)} is VALID [2022-04-27 10:47:59,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {2614#true} assume true; {2614#true} is VALID [2022-04-27 10:47:59,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {2614#true} assume !(0 == ~cond); {2614#true} is VALID [2022-04-27 10:47:59,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {2614#true} ~cond := #in~cond; {2614#true} is VALID [2022-04-27 10:47:59,907 INFO L272 TraceCheckUtils]: 12: Hoare triple {2839#(<= main_~j~0 main_~i~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {2614#true} is VALID [2022-04-27 10:47:59,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {2839#(<= main_~j~0 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {2839#(<= main_~j~0 main_~i~0)} is VALID [2022-04-27 10:47:59,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {2839#(<= main_~j~0 main_~i~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2839#(<= main_~j~0 main_~i~0)} is VALID [2022-04-27 10:47:59,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {2664#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2839#(<= main_~j~0 main_~i~0)} is VALID [2022-04-27 10:47:59,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {2614#true} ~i~0 := 0; {2664#(<= main_~i~0 0)} is VALID [2022-04-27 10:47:59,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {2614#true} assume ~k~0 == ~n~0; {2614#true} is VALID [2022-04-27 10:47:59,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {2614#true} assume !!(~n~0 < 1000000); {2614#true} is VALID [2022-04-27 10:47:59,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {2614#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {2614#true} is VALID [2022-04-27 10:47:59,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {2614#true} call #t~ret7 := main(); {2614#true} is VALID [2022-04-27 10:47:59,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2614#true} {2614#true} #98#return; {2614#true} is VALID [2022-04-27 10:47:59,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {2614#true} assume true; {2614#true} is VALID [2022-04-27 10:47:59,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {2614#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); {2614#true} is VALID [2022-04-27 10:47:59,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {2614#true} call ULTIMATE.init(); {2614#true} is VALID [2022-04-27 10:47:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 10:47:59,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743906630] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:47:59,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:47:59,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-04-27 10:47:59,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503793716] [2022-04-27 10:47:59,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:47:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 44 [2022-04-27 10:47:59,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:59,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 10:47:59,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:59,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 10:47:59,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:59,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 10:47:59,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:47:59,971 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 10:48:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:00,741 INFO L93 Difference]: Finished difference Result 138 states and 178 transitions. [2022-04-27 10:48:00,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:48:00,741 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 44 [2022-04-27 10:48:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:48:00,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 10:48:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-04-27 10:48:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 10:48:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-04-27 10:48:00,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2022-04-27 10:48:00,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:48:00,829 INFO L225 Difference]: With dead ends: 138 [2022-04-27 10:48:00,829 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 10:48:00,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-04-27 10:48:00,830 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 83 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:48:00,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 69 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:48:00,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 10:48:00,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2022-04-27 10:48:00,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:48:00,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 10:48:00,961 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 10:48:00,961 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 10:48:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:00,964 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-27 10:48:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-27 10:48:00,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:00,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:00,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 93 states. [2022-04-27 10:48:00,966 INFO L87 Difference]: Start difference. First operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 93 states. [2022-04-27 10:48:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:00,969 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-27 10:48:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-27 10:48:00,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:00,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:00,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:48:00,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:48:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 10:48:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2022-04-27 10:48:00,973 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 44 [2022-04-27 10:48:00,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:48:00,973 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2022-04-27 10:48:00,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 10:48:00,974 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2022-04-27 10:48:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 10:48:00,976 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:48:00,977 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:48:00,992 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:01,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:48:01,192 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:48:01,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:48:01,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1219400377, now seen corresponding path program 1 times [2022-04-27 10:48:01,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:48:01,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258792675] [2022-04-27 10:48:01,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:01,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:48:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:48:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:01,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {3455#(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); {3430#true} is VALID [2022-04-27 10:48:01,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:01,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3430#true} {3430#true} #98#return; {3430#true} is VALID [2022-04-27 10:48:01,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 10:48:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:01,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {3430#true} ~cond := #in~cond; {3430#true} is VALID [2022-04-27 10:48:01,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#true} assume !(0 == ~cond); {3430#true} is VALID [2022-04-27 10:48:01,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:01,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3430#true} {3430#true} #94#return; {3430#true} is VALID [2022-04-27 10:48:01,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 10:48:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:01,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {3430#true} ~cond := #in~cond; {3430#true} is VALID [2022-04-27 10:48:01,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#true} assume !(0 == ~cond); {3430#true} is VALID [2022-04-27 10:48:01,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:01,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3430#true} {3430#true} #96#return; {3430#true} is VALID [2022-04-27 10:48:01,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 10:48:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:01,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {3430#true} ~cond := #in~cond; {3430#true} is VALID [2022-04-27 10:48:01,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#true} assume !(0 == ~cond); {3430#true} is VALID [2022-04-27 10:48:01,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:01,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3430#true} {3430#true} #92#return; {3430#true} is VALID [2022-04-27 10:48:01,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 10:48:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:01,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {3430#true} ~cond := #in~cond; {3430#true} is VALID [2022-04-27 10:48:01,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#true} assume !(0 == ~cond); {3430#true} is VALID [2022-04-27 10:48:01,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:01,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3430#true} {3448#(<= (+ main_~k~0 1) main_~n~0)} #94#return; {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:48:01,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {3430#true} call ULTIMATE.init(); {3455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:48:01,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {3455#(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); {3430#true} is VALID [2022-04-27 10:48:01,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3430#true} {3430#true} #98#return; {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {3430#true} call #t~ret7 := main(); {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {3430#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {3430#true} assume !!(~n~0 < 1000000); {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {3430#true} assume ~k~0 == ~n~0; {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {3430#true} ~i~0 := 0; {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {3430#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {3430#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {3430#true} assume !(0 != #t~nondet5);havoc #t~nondet5; {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L272 TraceCheckUtils]: 12: Hoare triple {3430#true} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {3430#true} ~cond := #in~cond; {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {3430#true} assume !(0 == ~cond); {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3430#true} {3430#true} #94#return; {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L272 TraceCheckUtils]: 17: Hoare triple {3430#true} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3430#true} is VALID [2022-04-27 10:48:01,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {3430#true} ~cond := #in~cond; {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {3430#true} assume !(0 == ~cond); {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3430#true} {3430#true} #96#return; {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {3430#true} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {3430#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {3430#true} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {3430#true} assume !!(~k~0 < ~n~0); {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L272 TraceCheckUtils]: 26: Hoare triple {3430#true} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {3430#true} ~cond := #in~cond; {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {3430#true} assume !(0 == ~cond); {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3430#true} {3430#true} #92#return; {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {3430#true} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {3430#true} assume !(~k~0 < ~n~0); {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {3430#true} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {3430#true} assume !(~j~0 < ~n~0); {3430#true} is VALID [2022-04-27 10:48:01,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {3430#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3430#true} is VALID [2022-04-27 10:48:01,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {3430#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3430#true} is VALID [2022-04-27 10:48:01,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {3430#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3447#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:48:01,263 INFO L290 TraceCheckUtils]: 38: Hoare triple {3447#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:48:01,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} assume !(~k~0 < ~n~0); {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:48:01,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:48:01,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} assume !(~j~0 < ~n~0); {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:48:01,264 INFO L290 TraceCheckUtils]: 42: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:48:01,264 INFO L290 TraceCheckUtils]: 43: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:48:01,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:48:01,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:48:01,265 INFO L272 TraceCheckUtils]: 46: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3430#true} is VALID [2022-04-27 10:48:01,265 INFO L290 TraceCheckUtils]: 47: Hoare triple {3430#true} ~cond := #in~cond; {3430#true} is VALID [2022-04-27 10:48:01,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {3430#true} assume !(0 == ~cond); {3430#true} is VALID [2022-04-27 10:48:01,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:01,266 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3430#true} {3448#(<= (+ main_~k~0 1) main_~n~0)} #94#return; {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 10:48:01,266 INFO L272 TraceCheckUtils]: 51: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3453#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:48:01,266 INFO L290 TraceCheckUtils]: 52: Hoare triple {3453#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3454#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:48:01,267 INFO L290 TraceCheckUtils]: 53: Hoare triple {3454#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3431#false} is VALID [2022-04-27 10:48:01,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {3431#false} assume !false; {3431#false} is VALID [2022-04-27 10:48:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-27 10:48:01,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:48:01,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258792675] [2022-04-27 10:48:01,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258792675] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:48:01,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941647932] [2022-04-27 10:48:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:01,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:48:01,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:48:01,268 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:01,269 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:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:01,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:48:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:01,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:48:01,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {3430#true} call ULTIMATE.init(); {3430#true} is VALID [2022-04-27 10:48:01,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#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); {3430#true} is VALID [2022-04-27 10:48:01,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:01,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3430#true} {3430#true} #98#return; {3430#true} is VALID [2022-04-27 10:48:01,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {3430#true} call #t~ret7 := main(); {3430#true} is VALID [2022-04-27 10:48:01,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {3430#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {3430#true} is VALID [2022-04-27 10:48:01,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {3430#true} assume !!(~n~0 < 1000000); {3430#true} is VALID [2022-04-27 10:48:01,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {3430#true} assume ~k~0 == ~n~0; {3430#true} is VALID [2022-04-27 10:48:01,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {3430#true} ~i~0 := 0; {3430#true} is VALID [2022-04-27 10:48:01,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {3430#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 10:48:01,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 10:48:01,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 10:48:01,819 INFO L272 TraceCheckUtils]: 12: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3430#true} is VALID [2022-04-27 10:48:01,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {3430#true} ~cond := #in~cond; {3430#true} is VALID [2022-04-27 10:48:01,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {3430#true} assume !(0 == ~cond); {3430#true} is VALID [2022-04-27 10:48:01,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:01,820 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3430#true} {3486#(<= main_~j~0 (* main_~i~0 2))} #94#return; {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 10:48:01,820 INFO L272 TraceCheckUtils]: 17: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3430#true} is VALID [2022-04-27 10:48:01,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {3430#true} ~cond := #in~cond; {3430#true} is VALID [2022-04-27 10:48:01,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {3430#true} assume !(0 == ~cond); {3430#true} is VALID [2022-04-27 10:48:01,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:01,821 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3430#true} {3486#(<= main_~j~0 (* main_~i~0 2))} #96#return; {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 10:48:01,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 10:48:01,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 10:48:01,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 10:48:01,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} assume !!(~k~0 < ~n~0); {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 10:48:01,822 INFO L272 TraceCheckUtils]: 26: Hoare triple {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {3430#true} is VALID [2022-04-27 10:48:01,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {3430#true} ~cond := #in~cond; {3430#true} is VALID [2022-04-27 10:48:01,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {3430#true} assume !(0 == ~cond); {3430#true} is VALID [2022-04-27 10:48:01,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:01,823 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3430#true} {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} #92#return; {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 10:48:01,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3555#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 10:48:01,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {3555#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} assume !(~k~0 < ~n~0); {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 10:48:01,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 10:48:01,824 INFO L290 TraceCheckUtils]: 34: Hoare triple {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} assume !(~j~0 < ~n~0); {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 10:48:01,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3569#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} is VALID [2022-04-27 10:48:01,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {3569#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3573#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) (div main_~j~0 2))} is VALID [2022-04-27 10:48:01,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) (div main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3431#false} is VALID [2022-04-27 10:48:01,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {3431#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {3431#false} is VALID [2022-04-27 10:48:01,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {3431#false} assume !(~k~0 < ~n~0); {3431#false} is VALID [2022-04-27 10:48:01,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {3431#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3431#false} is VALID [2022-04-27 10:48:01,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {3431#false} assume !(~j~0 < ~n~0); {3431#false} is VALID [2022-04-27 10:48:01,826 INFO L290 TraceCheckUtils]: 42: Hoare triple {3431#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3431#false} is VALID [2022-04-27 10:48:01,826 INFO L290 TraceCheckUtils]: 43: Hoare triple {3431#false} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3431#false} is VALID [2022-04-27 10:48:01,826 INFO L290 TraceCheckUtils]: 44: Hoare triple {3431#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3431#false} is VALID [2022-04-27 10:48:01,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {3431#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {3431#false} is VALID [2022-04-27 10:48:01,826 INFO L272 TraceCheckUtils]: 46: Hoare triple {3431#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3431#false} is VALID [2022-04-27 10:48:01,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {3431#false} ~cond := #in~cond; {3431#false} is VALID [2022-04-27 10:48:01,826 INFO L290 TraceCheckUtils]: 48: Hoare triple {3431#false} assume !(0 == ~cond); {3431#false} is VALID [2022-04-27 10:48:01,826 INFO L290 TraceCheckUtils]: 49: Hoare triple {3431#false} assume true; {3431#false} is VALID [2022-04-27 10:48:01,826 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3431#false} {3431#false} #94#return; {3431#false} is VALID [2022-04-27 10:48:01,826 INFO L272 TraceCheckUtils]: 51: Hoare triple {3431#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3431#false} is VALID [2022-04-27 10:48:01,826 INFO L290 TraceCheckUtils]: 52: Hoare triple {3431#false} ~cond := #in~cond; {3431#false} is VALID [2022-04-27 10:48:01,826 INFO L290 TraceCheckUtils]: 53: Hoare triple {3431#false} assume 0 == ~cond; {3431#false} is VALID [2022-04-27 10:48:01,827 INFO L290 TraceCheckUtils]: 54: Hoare triple {3431#false} assume !false; {3431#false} is VALID [2022-04-27 10:48:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 10:48:01,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:48:02,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {3431#false} assume !false; {3431#false} is VALID [2022-04-27 10:48:02,034 INFO L290 TraceCheckUtils]: 53: Hoare triple {3431#false} assume 0 == ~cond; {3431#false} is VALID [2022-04-27 10:48:02,034 INFO L290 TraceCheckUtils]: 52: Hoare triple {3431#false} ~cond := #in~cond; {3431#false} is VALID [2022-04-27 10:48:02,034 INFO L272 TraceCheckUtils]: 51: Hoare triple {3431#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3431#false} is VALID [2022-04-27 10:48:02,034 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3430#true} {3431#false} #94#return; {3431#false} is VALID [2022-04-27 10:48:02,034 INFO L290 TraceCheckUtils]: 49: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:02,034 INFO L290 TraceCheckUtils]: 48: Hoare triple {3430#true} assume !(0 == ~cond); {3430#true} is VALID [2022-04-27 10:48:02,034 INFO L290 TraceCheckUtils]: 47: Hoare triple {3430#true} ~cond := #in~cond; {3430#true} is VALID [2022-04-27 10:48:02,034 INFO L272 TraceCheckUtils]: 46: Hoare triple {3431#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3430#true} is VALID [2022-04-27 10:48:02,034 INFO L290 TraceCheckUtils]: 45: Hoare triple {3431#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {3431#false} is VALID [2022-04-27 10:48:02,035 INFO L290 TraceCheckUtils]: 44: Hoare triple {3431#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3431#false} is VALID [2022-04-27 10:48:02,035 INFO L290 TraceCheckUtils]: 43: Hoare triple {3431#false} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3431#false} is VALID [2022-04-27 10:48:02,035 INFO L290 TraceCheckUtils]: 42: Hoare triple {3431#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3431#false} is VALID [2022-04-27 10:48:02,035 INFO L290 TraceCheckUtils]: 41: Hoare triple {3431#false} assume !(~j~0 < ~n~0); {3431#false} is VALID [2022-04-27 10:48:02,035 INFO L290 TraceCheckUtils]: 40: Hoare triple {3431#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3431#false} is VALID [2022-04-27 10:48:02,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {3431#false} assume !(~k~0 < ~n~0); {3431#false} is VALID [2022-04-27 10:48:02,035 INFO L290 TraceCheckUtils]: 38: Hoare triple {3431#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {3431#false} is VALID [2022-04-27 10:48:02,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {3679#(not (< main_~j~0 main_~n~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3431#false} is VALID [2022-04-27 10:48:02,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {3569#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3679#(not (< main_~j~0 main_~n~0))} is VALID [2022-04-27 10:48:02,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3569#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} is VALID [2022-04-27 10:48:02,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} assume !(~j~0 < ~n~0); {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 10:48:02,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 10:48:02,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {3555#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} assume !(~k~0 < ~n~0); {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 10:48:02,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3555#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 10:48:02,053 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3430#true} {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} #92#return; {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 10:48:02,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:02,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {3430#true} assume !(0 == ~cond); {3430#true} is VALID [2022-04-27 10:48:02,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {3430#true} ~cond := #in~cond; {3430#true} is VALID [2022-04-27 10:48:02,053 INFO L272 TraceCheckUtils]: 26: Hoare triple {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {3430#true} is VALID [2022-04-27 10:48:02,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} assume !!(~k~0 < ~n~0); {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 10:48:02,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 10:48:02,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 10:48:02,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 10:48:02,055 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3430#true} {3486#(<= main_~j~0 (* main_~i~0 2))} #96#return; {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 10:48:02,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:02,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {3430#true} assume !(0 == ~cond); {3430#true} is VALID [2022-04-27 10:48:02,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {3430#true} ~cond := #in~cond; {3430#true} is VALID [2022-04-27 10:48:02,055 INFO L272 TraceCheckUtils]: 17: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3430#true} is VALID [2022-04-27 10:48:02,056 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3430#true} {3486#(<= main_~j~0 (* main_~i~0 2))} #94#return; {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 10:48:02,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:02,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {3430#true} assume !(0 == ~cond); {3430#true} is VALID [2022-04-27 10:48:02,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {3430#true} ~cond := #in~cond; {3430#true} is VALID [2022-04-27 10:48:02,056 INFO L272 TraceCheckUtils]: 12: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3430#true} is VALID [2022-04-27 10:48:02,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 10:48:02,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 10:48:02,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {3430#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 10:48:02,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {3430#true} ~i~0 := 0; {3430#true} is VALID [2022-04-27 10:48:02,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {3430#true} assume ~k~0 == ~n~0; {3430#true} is VALID [2022-04-27 10:48:02,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {3430#true} assume !!(~n~0 < 1000000); {3430#true} is VALID [2022-04-27 10:48:02,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {3430#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {3430#true} is VALID [2022-04-27 10:48:02,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {3430#true} call #t~ret7 := main(); {3430#true} is VALID [2022-04-27 10:48:02,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3430#true} {3430#true} #98#return; {3430#true} is VALID [2022-04-27 10:48:02,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} assume true; {3430#true} is VALID [2022-04-27 10:48:02,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#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); {3430#true} is VALID [2022-04-27 10:48:02,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {3430#true} call ULTIMATE.init(); {3430#true} is VALID [2022-04-27 10:48:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 10:48:02,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941647932] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:48:02,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:48:02,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2022-04-27 10:48:02,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810126903] [2022-04-27 10:48:02,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:48:02,059 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 55 [2022-04-27 10:48:02,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:48:02,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 10:48:02,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:48:02,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 10:48:02,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:48:02,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 10:48:02,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-04-27 10:48:02,107 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 10:48:03,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:03,702 INFO L93 Difference]: Finished difference Result 166 states and 226 transitions. [2022-04-27 10:48:03,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 10:48:03,702 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 55 [2022-04-27 10:48:03,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:48:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 10:48:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 119 transitions. [2022-04-27 10:48:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 10:48:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 119 transitions. [2022-04-27 10:48:03,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 119 transitions. [2022-04-27 10:48:03,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:48:03,799 INFO L225 Difference]: With dead ends: 166 [2022-04-27 10:48:03,800 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:48:03,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=344, Invalid=1462, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 10:48:03,801 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 82 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:48:03,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 74 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 10:48:03,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:48:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:48:03,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:48:03,802 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:48:03,802 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:48:03,802 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:48:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:03,802 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:48:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:48:03,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:03,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:03,802 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:48:03,802 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:48:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:03,802 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:48:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:48:03,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:03,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:03,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:48:03,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:48:03,803 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:48:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:48:03,803 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2022-04-27 10:48:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:48:03,803 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:48:03,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 10:48:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:48:03,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:03,805 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:48:03,821 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:04,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:48:04,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:48:04,808 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:48:04,808 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:48:04,808 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:48:04,808 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:48:04,808 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:48:04,808 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:48:04,808 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:48:04,808 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 48) no Hoare annotation was computed. [2022-04-27 10:48:04,809 INFO L895 garLoopResultBuilder]: At program point L36-2(lines 36 38) the Hoare annotation is: (let ((.cse0 (* main_~i~0 2))) (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0))) [2022-04-27 10:48:04,809 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 10:48:04,809 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= (* main_~i~0 2) main_~j~0) (<= main_~n~0 main_~k~0)) [2022-04-27 10:48:04,809 INFO L895 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= (* main_~i~0 2) main_~j~0) (<= main_~n~0 main_~k~0)) [2022-04-27 10:48:04,809 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (* main_~i~0 2))) (and (<= (+ main_~j~0 1) main_~n~0) (<= (+ main_~k~0 1) main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0))) [2022-04-27 10:48:04,809 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 36 38) no Hoare annotation was computed. [2022-04-27 10:48:04,809 INFO L899 garLoopResultBuilder]: For program point L33-2(lines 33 45) no Hoare annotation was computed. [2022-04-27 10:48:04,809 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 45) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 main_~n~0)) (.cse1 (<= main_~n~0 main_~k~0))) (or (and .cse0 (<= main_~n~0 main_~j~0) .cse1) (and (= main_~i~0 0) .cse0 .cse1))) [2022-04-27 10:48:04,809 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 32) no Hoare annotation was computed. [2022-04-27 10:48:04,809 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 29 32) no Hoare annotation was computed. [2022-04-27 10:48:04,809 INFO L902 garLoopResultBuilder]: At program point L46(lines 24 48) the Hoare annotation is: true [2022-04-27 10:48:04,809 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 48) no Hoare annotation was computed. [2022-04-27 10:48:04,809 INFO L899 garLoopResultBuilder]: For program point L42(lines 34 44) no Hoare annotation was computed. [2022-04-27 10:48:04,809 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 44) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= (* main_~i~0 2) main_~j~0) (<= main_~n~0 main_~k~0)) [2022-04-27 10:48:04,809 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 48) the Hoare annotation is: true [2022-04-27 10:48:04,809 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 43) no Hoare annotation was computed. [2022-04-27 10:48:04,810 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:48:04,810 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:48:04,810 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:48:04,810 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:48:04,810 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:48:04,810 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:48:04,810 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:48:04,810 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:48:04,810 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:48:04,810 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:48:04,810 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:48:04,810 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:48:04,810 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:48:04,812 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:48:04,813 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:48:04,815 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:48:04,815 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:48:04,815 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:48:04,816 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:48:04,817 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:48:04,817 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:48:04,817 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:48:04,817 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:48:04,817 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 10:48:04,817 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:48:04,817 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:48:04,817 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:48:04,817 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:48:04,818 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 10:48:04,818 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 10:48:04,818 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 10:48:04,818 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-04-27 10:48:04,818 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-04-27 10:48:04,818 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:48:04,818 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 10:48:04,818 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 10:48:04,819 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-04-27 10:48:04,819 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:48:04,820 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:48:04,820 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 10:48:04,820 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:48:04,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:48:04 BoogieIcfgContainer [2022-04-27 10:48:04,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:48:04,826 INFO L158 Benchmark]: Toolchain (without parser) took 13665.39ms. Allocated memory was 188.7MB in the beginning and 285.2MB in the end (delta: 96.5MB). Free memory was 137.6MB in the beginning and 197.6MB in the end (delta: -59.9MB). Peak memory consumption was 138.5MB. Max. memory is 8.0GB. [2022-04-27 10:48:04,827 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 188.7MB. Free memory was 154.1MB in the beginning and 154.0MB in the end (delta: 73.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:48:04,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.34ms. Allocated memory is still 188.7MB. Free memory was 137.4MB in the beginning and 163.2MB in the end (delta: -25.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 10:48:04,827 INFO L158 Benchmark]: Boogie Preprocessor took 43.47ms. Allocated memory is still 188.7MB. Free memory was 163.2MB in the beginning and 161.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:48:04,827 INFO L158 Benchmark]: RCFGBuilder took 271.67ms. Allocated memory is still 188.7MB. Free memory was 161.6MB in the beginning and 149.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 10:48:04,827 INFO L158 Benchmark]: TraceAbstraction took 13083.14ms. Allocated memory was 188.7MB in the beginning and 285.2MB in the end (delta: 96.5MB). Free memory was 148.5MB in the beginning and 197.6MB in the end (delta: -49.1MB). Peak memory consumption was 150.6MB. Max. memory is 8.0GB. [2022-04-27 10:48:04,828 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 188.7MB. Free memory was 154.1MB in the beginning and 154.0MB in the end (delta: 73.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.34ms. Allocated memory is still 188.7MB. Free memory was 137.4MB in the beginning and 163.2MB in the end (delta: -25.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.47ms. Allocated memory is still 188.7MB. Free memory was 163.2MB in the beginning and 161.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 271.67ms. Allocated memory is still 188.7MB. Free memory was 161.6MB in the beginning and 149.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13083.14ms. Allocated memory was 188.7MB in the beginning and 285.2MB in the end (delta: 96.5MB). Free memory was 148.5MB in the beginning and 197.6MB in the end (delta: -49.1MB). Peak memory consumption was 150.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 479 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 465 mSDsluCounter, 482 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 298 mSDsCounter, 411 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1661 IncrementalHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 411 mSolverCounterUnsat, 184 mSDtfsCounter, 1661 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 383 SyntacticMatches, 5 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=7, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 84 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 68 PreInvPairs, 137 NumberOfFragments, 119 HoareAnnotationTreeSize, 68 FomulaSimplifications, -276 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 12 FomulaSimplificationsInter, 19230 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 450 NumberOfCodeBlocks, 450 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 606 ConstructedInterpolants, 0 QuantifiedInterpolants, 1499 SizeOfPredicates, 21 NumberOfNonLiveVariables, 555 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 398/439 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((k <= n && n <= j) && n <= k) || ((i == 0 && k <= n) && n <= k) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((j + 1 <= n && k <= n) && i * 2 <= j) && i * 2 <= k - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (k <= n && i * 2 <= j) && n <= k RESULT: Ultimate proved your program to be correct! [2022-04-27 10:48:04,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...