/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:29:14,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:29:14,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:29:14,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:29:14,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:29:14,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:29:14,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:29:14,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:29:14,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:29:14,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:29:14,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:29:14,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:29:14,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:29:14,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:29:14,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:29:14,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:29:14,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:29:14,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:29:14,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:29:14,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:29:14,093 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:29:14,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:29:14,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:29:14,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:29:14,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:29:14,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:29:14,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:29:14,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:29:14,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:29:14,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:29:14,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:29:14,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:29:14,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:29:14,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:29:14,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:29:14,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:29:14,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:29:14,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:29:14,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:29:14,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:29:14,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:29:14,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:29:14,103 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:29:14,110 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:29:14,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:29:14,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:29:14,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:29:14,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:29:14,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:29:14,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:29:14,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:29:14,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:29:14,111 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:29:14,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:29:14,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:29:14,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:29:14,112 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:29:14,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:29:14,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:29:14,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:29:14,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:29:14,112 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:29:14,112 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:29:14,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:29:14,112 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:29:14,112 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:29:14,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:29:14,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:29:14,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:29:14,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:29:14,300 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:29:14,300 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-08 09:29:14,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3ae4103/86e67ce47ed94bc38493fb970d9b5996/FLAG8844f70dc [2022-04-08 09:29:14,738 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:29:14,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2022-04-08 09:29:14,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3ae4103/86e67ce47ed94bc38493fb970d9b5996/FLAG8844f70dc [2022-04-08 09:29:15,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3ae4103/86e67ce47ed94bc38493fb970d9b5996 [2022-04-08 09:29:15,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:29:15,156 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:29:15,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:29:15,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:29:15,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:29:15,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd58300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15, skipping insertion in model container [2022-04-08 09:29:15,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:29:15,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:29:15,401 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-08 09:29:15,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:29:15,441 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:29:15,455 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-08 09:29:15,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:29:15,475 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:29:15,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15 WrapperNode [2022-04-08 09:29:15,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:29:15,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:29:15,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:29:15,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:29:15,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:29:15,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:29:15,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:29:15,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:29:15,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:29:15,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:15,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:29:15,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:29:15,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:29:15,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:29:15,583 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:29:15,583 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:29:15,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:29:15,583 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:29:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:29:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:29:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:29:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:29:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:29:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:29:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:29:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:29:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:29:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:29:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:29:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:29:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:29:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:29:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:29:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:29:15,645 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:29:15,646 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:29:15,834 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:29:15,839 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:29:15,839 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 09:29:15,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:29:15 BoogieIcfgContainer [2022-04-08 09:29:15,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:29:15,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:29:15,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:29:15,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:29:15,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:29:15" (1/3) ... [2022-04-08 09:29:15,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b600d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:29:15, skipping insertion in model container [2022-04-08 09:29:15,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (2/3) ... [2022-04-08 09:29:15,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b600d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:29:15, skipping insertion in model container [2022-04-08 09:29:15,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:29:15" (3/3) ... [2022-04-08 09:29:15,850 INFO L111 eAbstractionObserver]: Analyzing ICFG nested6.i [2022-04-08 09:29:15,853 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:29:15,853 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:29:15,884 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:29:15,888 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:29:15,888 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:29:15,900 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-08 09:29:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:29:15,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:15,905 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:15,906 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:15,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:15,909 INFO L85 PathProgramCache]: Analyzing trace with hash -380972064, now seen corresponding path program 1 times [2022-04-08 09:29:15,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:15,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1359110051] [2022-04-08 09:29:15,922 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:29:15,922 INFO L85 PathProgramCache]: Analyzing trace with hash -380972064, now seen corresponding path program 2 times [2022-04-08 09:29:15,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:15,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047071831] [2022-04-08 09:29:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:15,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,090 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-08 09:29:16,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 09:29:16,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #98#return; {33#true} is VALID [2022-04-08 09:29:16,092 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-08 09:29:16,092 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-08 09:29:16,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 09:29:16,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #98#return; {33#true} is VALID [2022-04-08 09:29:16,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-08 09:29:16,093 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-08 09:29:16,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} assume !!(~n~0 < 1000000); {33#true} is VALID [2022-04-08 09:29:16,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} assume ~k~0 == ~n~0; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-08 09:29:16,094 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-08 09:29:16,095 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-08 09:29:16,095 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-08 09:29:16,096 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-08 09:29:16,097 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-08 09:29:16,097 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-08 09:29:16,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {34#false} is VALID [2022-04-08 09:29:16,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-08 09:29:16,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:29:16,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:16,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047071831] [2022-04-08 09:29:16,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047071831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:16,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:16,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:29:16,102 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:16,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1359110051] [2022-04-08 09:29:16,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1359110051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:16,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:16,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:29:16,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964484105] [2022-04-08 09:29:16,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:16,106 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-08 09:29:16,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:16,110 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-08 09:29:16,124 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-08 09:29:16,125 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:29:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:16,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:29:16,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:29:16,141 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-08 09:29:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:16,425 INFO L93 Difference]: Finished difference Result 58 states and 81 transitions. [2022-04-08 09:29:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:29:16,425 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-08 09:29:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:16,426 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-08 09:29:16,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-04-08 09:29:16,433 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-08 09:29:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-04-08 09:29:16,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 81 transitions. [2022-04-08 09:29:16,510 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-08 09:29:16,515 INFO L225 Difference]: With dead ends: 58 [2022-04-08 09:29:16,515 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 09:29:16,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:29:16,519 INFO L913 BasicCegarLoop]: 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-08 09:29:16,520 INFO L914 BasicCegarLoop]: 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-08 09:29:16,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 09:29:16,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 09:29:16,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:16,545 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-08 09:29:16,546 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-08 09:29:16,546 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-08 09:29:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:16,549 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-08 09:29:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-08 09:29:16,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:16,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:16,550 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-08 09:29:16,550 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-08 09:29:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:16,552 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-08 09:29:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-08 09:29:16,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:16,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:16,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:16,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:16,553 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-08 09:29:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-08 09:29:16,555 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2022-04-08 09:29:16,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:16,555 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-08 09:29:16,555 INFO L479 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-08 09:29:16,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 33 transitions. [2022-04-08 09:29:16,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:16,583 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-08 09:29:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:29:16,583 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:16,584 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:16,584 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:29:16,584 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:16,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash 580085489, now seen corresponding path program 1 times [2022-04-08 09:29:16,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:16,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [95884366] [2022-04-08 09:29:16,585 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:29:16,586 INFO L85 PathProgramCache]: Analyzing trace with hash 580085489, now seen corresponding path program 2 times [2022-04-08 09:29:16,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:16,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774885931] [2022-04-08 09:29:16,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:16,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {293#(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); {284#true} is VALID [2022-04-08 09:29:16,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#true} assume true; {284#true} is VALID [2022-04-08 09:29:16,649 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {284#true} {284#true} #98#return; {284#true} is VALID [2022-04-08 09:29:16,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:16,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#(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); {284#true} is VALID [2022-04-08 09:29:16,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2022-04-08 09:29:16,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #98#return; {284#true} is VALID [2022-04-08 09:29:16,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret7 := main(); {284#true} is VALID [2022-04-08 09:29:16,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {284#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; {284#true} is VALID [2022-04-08 09:29:16,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {284#true} assume !!(~n~0 < 1000000); {284#true} is VALID [2022-04-08 09:29:16,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#true} assume ~k~0 == ~n~0; {284#true} is VALID [2022-04-08 09:29:16,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#true} ~i~0 := 0; {284#true} is VALID [2022-04-08 09:29:16,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {289#(<= (* main_~i~0 2) main_~j~0)} is VALID [2022-04-08 09:29:16,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {289#(<= (* main_~i~0 2) main_~j~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {289#(<= (* main_~i~0 2) main_~j~0)} is VALID [2022-04-08 09:29:16,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#(<= (* main_~i~0 2) main_~j~0)} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {290#(<= (* main_~i~0 2) main_~k~0)} is VALID [2022-04-08 09:29:16,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {290#(<= (* main_~i~0 2) main_~k~0)} assume !!(~k~0 < ~n~0); {290#(<= (* main_~i~0 2) main_~k~0)} is VALID [2022-04-08 09:29:16,653 INFO L272 TraceCheckUtils]: 13: Hoare triple {290#(<= (* main_~i~0 2) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {291#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:29:16,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {291#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {292#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:29:16,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {285#false} is VALID [2022-04-08 09:29:16,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {285#false} assume !false; {285#false} is VALID [2022-04-08 09:29:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:29:16,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:16,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774885931] [2022-04-08 09:29:16,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774885931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:16,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:16,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:29:16,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:16,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [95884366] [2022-04-08 09:29:16,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [95884366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:16,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:16,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:29:16,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974126544] [2022-04-08 09:29:16,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:16,656 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-08 09:29:16,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:16,657 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-08 09:29:16,668 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-08 09:29:16,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:29:16,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:16,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:29:16,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:29:16,669 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-08 09:29:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:17,051 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 09:29:17,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:29:17,052 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-08 09:29:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:17,052 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-08 09:29:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-08 09:29:17,058 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-08 09:29:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-08 09:29:17,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-04-08 09:29:17,098 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-08 09:29:17,101 INFO L225 Difference]: With dead ends: 41 [2022-04-08 09:29:17,101 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 09:29:17,102 INFO L912 BasicCegarLoop]: 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-08 09:29:17,105 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:17,106 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 45 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:29:17,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 09:29:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-04-08 09:29:17,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:17,142 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-08 09:29:17,142 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-08 09:29:17,143 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-08 09:29:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:17,144 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-08 09:29:17,145 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 09:29:17,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:17,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:17,145 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-08 09:29:17,146 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-08 09:29:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:17,147 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-08 09:29:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 09:29:17,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:17,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:17,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:17,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:17,148 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-08 09:29:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-08 09:29:17,149 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2022-04-08 09:29:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:17,149 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-08 09:29:17,149 INFO L479 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-08 09:29:17,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 36 transitions. [2022-04-08 09:29:17,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-08 09:29:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 09:29:17,180 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:17,180 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:17,180 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:29:17,180 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:17,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:17,181 INFO L85 PathProgramCache]: Analyzing trace with hash -132185391, now seen corresponding path program 1 times [2022-04-08 09:29:17,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:17,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704540746] [2022-04-08 09:29:17,182 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:29:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash -132185391, now seen corresponding path program 2 times [2022-04-08 09:29:17,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:17,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687467374] [2022-04-08 09:29:17,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:17,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:17,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:17,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {544#(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); {532#true} is VALID [2022-04-08 09:29:17,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-08 09:29:17,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {532#true} {532#true} #98#return; {532#true} is VALID [2022-04-08 09:29:17,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 09:29:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:17,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {532#true} ~cond := #in~cond; {532#true} is VALID [2022-04-08 09:29:17,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} assume !(0 == ~cond); {532#true} is VALID [2022-04-08 09:29:17,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-08 09:29:17,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {537#(<= main_~k~0 main_~n~0)} #94#return; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-08 09:29:17,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {532#true} call ULTIMATE.init(); {544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:17,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {544#(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); {532#true} is VALID [2022-04-08 09:29:17,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-08 09:29:17,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {532#true} #98#return; {532#true} is VALID [2022-04-08 09:29:17,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {532#true} call #t~ret7 := main(); {532#true} is VALID [2022-04-08 09:29:17,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#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; {532#true} is VALID [2022-04-08 09:29:17,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {532#true} assume !!(~n~0 < 1000000); {532#true} is VALID [2022-04-08 09:29:17,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {532#true} assume ~k~0 == ~n~0; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-08 09:29:17,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {537#(<= main_~k~0 main_~n~0)} ~i~0 := 0; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-08 09:29:17,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {537#(<= main_~k~0 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-08 09:29:17,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {537#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-08 09:29:17,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {537#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-08 09:29:17,267 INFO L272 TraceCheckUtils]: 12: Hoare triple {537#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {532#true} is VALID [2022-04-08 09:29:17,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {532#true} ~cond := #in~cond; {532#true} is VALID [2022-04-08 09:29:17,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {532#true} assume !(0 == ~cond); {532#true} is VALID [2022-04-08 09:29:17,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-08 09:29:17,269 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {532#true} {537#(<= main_~k~0 main_~n~0)} #94#return; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-08 09:29:17,270 INFO L272 TraceCheckUtils]: 17: Hoare triple {537#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {542#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:29:17,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {542#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {543#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:29:17,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {543#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {533#false} is VALID [2022-04-08 09:29:17,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {533#false} assume !false; {533#false} is VALID [2022-04-08 09:29:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:29:17,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:17,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687467374] [2022-04-08 09:29:17,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687467374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:17,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:17,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:29:17,272 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:17,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704540746] [2022-04-08 09:29:17,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704540746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:17,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:17,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:29:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14629413] [2022-04-08 09:29:17,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:17,273 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-08 09:29:17,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:17,273 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-08 09:29:17,287 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-08 09:29:17,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:29:17,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:17,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:29:17,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:29:17,289 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-08 09:29:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:17,530 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-04-08 09:29:17,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:29:17,531 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-08 09:29:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:17,531 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-08 09:29:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-08 09:29:17,532 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-08 09:29:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-08 09:29:17,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-08 09:29:17,573 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-08 09:29:17,575 INFO L225 Difference]: With dead ends: 46 [2022-04-08 09:29:17,575 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 09:29:17,576 INFO L912 BasicCegarLoop]: 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-08 09:29:17,576 INFO L913 BasicCegarLoop]: 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-08 09:29:17,576 INFO L914 BasicCegarLoop]: 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-08 09:29:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 09:29:17,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 09:29:17,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:17,607 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-08 09:29:17,607 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-08 09:29:17,609 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-08 09:29:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:17,617 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-08 09:29:17,617 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-08 09:29:17,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:17,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:17,621 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-08 09:29:17,621 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-08 09:29:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:17,624 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-08 09:29:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-08 09:29:17,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:17,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:17,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:17,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:17,625 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-08 09:29:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-08 09:29:17,627 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2022-04-08 09:29:17,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:17,627 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-08 09:29:17,627 INFO L479 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-08 09:29:17,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 50 transitions. [2022-04-08 09:29:17,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:17,673 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-08 09:29:17,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 09:29:17,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:17,674 INFO L499 BasicCegarLoop]: 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-08 09:29:17,674 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 09:29:17,674 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:17,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:17,674 INFO L85 PathProgramCache]: Analyzing trace with hash -512108736, now seen corresponding path program 1 times [2022-04-08 09:29:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:17,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [14534000] [2022-04-08 09:29:17,689 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:17,689 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:17,689 INFO L85 PathProgramCache]: Analyzing trace with hash -512108736, now seen corresponding path program 2 times [2022-04-08 09:29:17,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:17,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299880208] [2022-04-08 09:29:17,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:17,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:17,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:17,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {837#(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); {823#true} is VALID [2022-04-08 09:29:17,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {823#true} assume true; {823#true} is VALID [2022-04-08 09:29:17,751 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {823#true} {823#true} #98#return; {823#true} is VALID [2022-04-08 09:29:17,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 09:29:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:17,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {823#true} ~cond := #in~cond; {823#true} is VALID [2022-04-08 09:29:17,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {823#true} assume !(0 == ~cond); {823#true} is VALID [2022-04-08 09:29:17,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {823#true} assume true; {823#true} is VALID [2022-04-08 09:29:17,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {823#true} {830#(<= (+ main_~k~0 1) main_~n~0)} #94#return; {830#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:17,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {823#true} call ULTIMATE.init(); {837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:17,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {837#(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); {823#true} is VALID [2022-04-08 09:29:17,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {823#true} assume true; {823#true} is VALID [2022-04-08 09:29:17,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {823#true} {823#true} #98#return; {823#true} is VALID [2022-04-08 09:29:17,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {823#true} call #t~ret7 := main(); {823#true} is VALID [2022-04-08 09:29:17,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {823#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; {823#true} is VALID [2022-04-08 09:29:17,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {823#true} assume !!(~n~0 < 1000000); {823#true} is VALID [2022-04-08 09:29:17,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {823#true} assume ~k~0 == ~n~0; {823#true} is VALID [2022-04-08 09:29:17,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {823#true} ~i~0 := 0; {828#(= main_~i~0 0)} is VALID [2022-04-08 09:29:17,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {828#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {829#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 09:29:17,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {829#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {829#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 09:29:17,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {829#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {830#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:17,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {830#(<= (+ main_~k~0 1) main_~n~0)} assume !(~k~0 < ~n~0); {830#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:17,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(<= (+ main_~k~0 1) main_~n~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {830#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:17,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {830#(<= (+ main_~k~0 1) main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {830#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:17,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {830#(<= (+ main_~k~0 1) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {830#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:17,766 INFO L272 TraceCheckUtils]: 16: Hoare triple {830#(<= (+ main_~k~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {823#true} is VALID [2022-04-08 09:29:17,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {823#true} ~cond := #in~cond; {823#true} is VALID [2022-04-08 09:29:17,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {823#true} assume !(0 == ~cond); {823#true} is VALID [2022-04-08 09:29:17,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {823#true} assume true; {823#true} is VALID [2022-04-08 09:29:17,767 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {823#true} {830#(<= (+ main_~k~0 1) main_~n~0)} #94#return; {830#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:17,767 INFO L272 TraceCheckUtils]: 21: Hoare triple {830#(<= (+ main_~k~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:29:17,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {835#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {836#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:29:17,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {836#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {824#false} is VALID [2022-04-08 09:29:17,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {824#false} assume !false; {824#false} is VALID [2022-04-08 09:29:17,768 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-08 09:29:17,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:17,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299880208] [2022-04-08 09:29:17,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299880208] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:17,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400928073] [2022-04-08 09:29:17,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:29:17,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:17,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:17,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:29:17,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 09:29:17,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:29:17,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:17,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 09:29:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:17,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:18,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {823#true} call ULTIMATE.init(); {823#true} is VALID [2022-04-08 09:29:18,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {823#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); {823#true} is VALID [2022-04-08 09:29:18,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {823#true} assume true; {823#true} is VALID [2022-04-08 09:29:18,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {823#true} {823#true} #98#return; {823#true} is VALID [2022-04-08 09:29:18,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {823#true} call #t~ret7 := main(); {823#true} is VALID [2022-04-08 09:29:18,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {823#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; {823#true} is VALID [2022-04-08 09:29:18,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {823#true} assume !!(~n~0 < 1000000); {823#true} is VALID [2022-04-08 09:29:18,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {823#true} assume ~k~0 == ~n~0; {823#true} is VALID [2022-04-08 09:29:18,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {823#true} ~i~0 := 0; {865#(<= main_~i~0 0)} is VALID [2022-04-08 09:29:18,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {865#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {869#(and (< (div (- main_~j~0) (- 2)) main_~n~0) (<= (div (- main_~j~0) (- 2)) 0))} is VALID [2022-04-08 09:29:18,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {869#(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; {869#(and (< (div (- main_~j~0) (- 2)) main_~n~0) (<= (div (- main_~j~0) (- 2)) 0))} is VALID [2022-04-08 09:29:18,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {869#(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; {876#(and (<= (div (* (- 1) main_~k~0) (- 2)) 0) (< (div (* (- 1) main_~k~0) (- 2)) main_~n~0))} is VALID [2022-04-08 09:29:18,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {876#(and (<= (div (* (- 1) main_~k~0) (- 2)) 0) (< (div (* (- 1) main_~k~0) (- 2)) main_~n~0))} assume !(~k~0 < ~n~0); {824#false} is VALID [2022-04-08 09:29:18,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {824#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {824#false} is VALID [2022-04-08 09:29:18,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {824#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {824#false} is VALID [2022-04-08 09:29:18,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {824#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {824#false} is VALID [2022-04-08 09:29:18,561 INFO L272 TraceCheckUtils]: 16: Hoare triple {824#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {824#false} is VALID [2022-04-08 09:29:18,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {824#false} ~cond := #in~cond; {824#false} is VALID [2022-04-08 09:29:18,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {824#false} assume !(0 == ~cond); {824#false} is VALID [2022-04-08 09:29:18,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {824#false} assume true; {824#false} is VALID [2022-04-08 09:29:18,562 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {824#false} {824#false} #94#return; {824#false} is VALID [2022-04-08 09:29:18,563 INFO L272 TraceCheckUtils]: 21: Hoare triple {824#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {824#false} is VALID [2022-04-08 09:29:18,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {824#false} ~cond := #in~cond; {824#false} is VALID [2022-04-08 09:29:18,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {824#false} assume 0 == ~cond; {824#false} is VALID [2022-04-08 09:29:18,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {824#false} assume !false; {824#false} is VALID [2022-04-08 09:29:18,572 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-08 09:29:18,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 09:29:18,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400928073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:18,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 09:29:18,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-04-08 09:29:18,573 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:18,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [14534000] [2022-04-08 09:29:18,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [14534000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:18,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:18,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:29:18,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624845150] [2022-04-08 09:29:18,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:18,574 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-08 09:29:18,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:18,574 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-08 09:29:18,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:18,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:29:18,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:29:18,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:29:18,593 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-08 09:29:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:18,902 INFO L93 Difference]: Finished difference Result 107 states and 137 transitions. [2022-04-08 09:29:18,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:29:18,902 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-08 09:29:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:18,902 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-08 09:29:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-08 09:29:18,904 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-08 09:29:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-08 09:29:18,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2022-04-08 09:29:18,968 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-08 09:29:18,970 INFO L225 Difference]: With dead ends: 107 [2022-04-08 09:29:18,970 INFO L226 Difference]: Without dead ends: 72 [2022-04-08 09:29:18,971 INFO L912 BasicCegarLoop]: 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-08 09:29:18,971 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 90 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:18,972 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 90 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:29:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-08 09:29:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 48. [2022-04-08 09:29:19,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:19,024 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-08 09:29:19,024 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-08 09:29:19,024 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-08 09:29:19,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:19,027 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-08 09:29:19,027 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2022-04-08 09:29:19,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:19,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:19,028 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-08 09:29:19,028 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-08 09:29:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:19,030 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-08 09:29:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2022-04-08 09:29:19,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:19,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:19,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:19,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:19,031 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-08 09:29:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-08 09:29:19,033 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2022-04-08 09:29:19,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:19,033 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-08 09:29:19,033 INFO L479 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-08 09:29:19,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 55 transitions. [2022-04-08 09:29:19,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 09:29:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 09:29:19,087 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:19,087 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:19,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 09:29:19,303 WARN L460 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-08 09:29:19,304 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:19,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:19,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1758799342, now seen corresponding path program 1 times [2022-04-08 09:29:19,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:19,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1966250176] [2022-04-08 09:29:19,348 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:19,393 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:19,393 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:19,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1758799342, now seen corresponding path program 2 times [2022-04-08 09:29:19,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:19,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689181330] [2022-04-08 09:29:19,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:19,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:19,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:19,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {1393#(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); {1373#true} is VALID [2022-04-08 09:29:19,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {1373#true} assume true; {1373#true} is VALID [2022-04-08 09:29:19,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1373#true} {1373#true} #98#return; {1373#true} is VALID [2022-04-08 09:29:19,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-08 09:29:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:19,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {1373#true} ~cond := #in~cond; {1373#true} is VALID [2022-04-08 09:29:19,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {1373#true} assume !(0 == ~cond); {1373#true} is VALID [2022-04-08 09:29:19,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {1373#true} assume true; {1373#true} is VALID [2022-04-08 09:29:19,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1373#true} {1380#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} #92#return; {1385#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:19,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-08 09:29:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:19,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {1373#true} ~cond := #in~cond; {1373#true} is VALID [2022-04-08 09:29:19,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {1373#true} assume !(0 == ~cond); {1373#true} is VALID [2022-04-08 09:29:19,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {1373#true} assume true; {1373#true} is VALID [2022-04-08 09:29:19,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1373#true} {1386#(<= main_~k~0 main_~n~0)} #94#return; {1386#(<= main_~k~0 main_~n~0)} is VALID [2022-04-08 09:29:19,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {1373#true} call ULTIMATE.init(); {1393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:19,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {1393#(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); {1373#true} is VALID [2022-04-08 09:29:19,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {1373#true} assume true; {1373#true} is VALID [2022-04-08 09:29:19,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1373#true} {1373#true} #98#return; {1373#true} is VALID [2022-04-08 09:29:19,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {1373#true} call #t~ret7 := main(); {1373#true} is VALID [2022-04-08 09:29:19,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {1373#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; {1373#true} is VALID [2022-04-08 09:29:19,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {1373#true} assume !!(~n~0 < 1000000); {1373#true} is VALID [2022-04-08 09:29:19,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {1373#true} assume ~k~0 == ~n~0; {1373#true} is VALID [2022-04-08 09:29:19,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {1373#true} ~i~0 := 0; {1378#(= main_~i~0 0)} is VALID [2022-04-08 09:29:19,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {1378#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1379#(and (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (= main_~i~0 0))} is VALID [2022-04-08 09:29:19,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {1379#(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; {1379#(and (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (= main_~i~0 0))} is VALID [2022-04-08 09:29:19,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {1379#(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; {1380#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} is VALID [2022-04-08 09:29:19,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {1380#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} assume !!(~k~0 < ~n~0); {1380#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} is VALID [2022-04-08 09:29:19,526 INFO L272 TraceCheckUtils]: 13: Hoare triple {1380#(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)); {1373#true} is VALID [2022-04-08 09:29:19,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {1373#true} ~cond := #in~cond; {1373#true} is VALID [2022-04-08 09:29:19,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {1373#true} assume !(0 == ~cond); {1373#true} is VALID [2022-04-08 09:29:19,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {1373#true} assume true; {1373#true} is VALID [2022-04-08 09:29:19,527 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1373#true} {1380#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} #92#return; {1385#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:19,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {1385#(<= (+ main_~k~0 1) main_~n~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1386#(<= main_~k~0 main_~n~0)} is VALID [2022-04-08 09:29:19,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {1386#(<= main_~k~0 main_~n~0)} assume !(~k~0 < ~n~0); {1386#(<= main_~k~0 main_~n~0)} is VALID [2022-04-08 09:29:19,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {1386#(<= main_~k~0 main_~n~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1386#(<= main_~k~0 main_~n~0)} is VALID [2022-04-08 09:29:19,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {1386#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1386#(<= main_~k~0 main_~n~0)} is VALID [2022-04-08 09:29:19,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {1386#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {1386#(<= main_~k~0 main_~n~0)} is VALID [2022-04-08 09:29:19,528 INFO L272 TraceCheckUtils]: 23: Hoare triple {1386#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1373#true} is VALID [2022-04-08 09:29:19,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {1373#true} ~cond := #in~cond; {1373#true} is VALID [2022-04-08 09:29:19,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {1373#true} assume !(0 == ~cond); {1373#true} is VALID [2022-04-08 09:29:19,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {1373#true} assume true; {1373#true} is VALID [2022-04-08 09:29:19,529 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1373#true} {1386#(<= main_~k~0 main_~n~0)} #94#return; {1386#(<= main_~k~0 main_~n~0)} is VALID [2022-04-08 09:29:19,530 INFO L272 TraceCheckUtils]: 28: Hoare triple {1386#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1391#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:29:19,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {1391#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1392#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:29:19,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {1392#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1374#false} is VALID [2022-04-08 09:29:19,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {1374#false} assume !false; {1374#false} is VALID [2022-04-08 09:29:19,531 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-08 09:29:19,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:19,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689181330] [2022-04-08 09:29:19,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689181330] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:19,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695802161] [2022-04-08 09:29:19,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:29:19,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:19,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:19,538 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:29:19,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 09:29:19,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:29:19,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:19,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 09:29:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:19,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:19,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {1373#true} call ULTIMATE.init(); {1373#true} is VALID [2022-04-08 09:29:19,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {1373#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); {1373#true} is VALID [2022-04-08 09:29:19,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {1373#true} assume true; {1373#true} is VALID [2022-04-08 09:29:19,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1373#true} {1373#true} #98#return; {1373#true} is VALID [2022-04-08 09:29:19,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {1373#true} call #t~ret7 := main(); {1373#true} is VALID [2022-04-08 09:29:19,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {1373#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; {1373#true} is VALID [2022-04-08 09:29:19,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {1373#true} assume !!(~n~0 < 1000000); {1373#true} is VALID [2022-04-08 09:29:19,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {1373#true} assume ~k~0 == ~n~0; {1373#true} is VALID [2022-04-08 09:29:19,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {1373#true} ~i~0 := 0; {1373#true} is VALID [2022-04-08 09:29:19,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {1373#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1373#true} is VALID [2022-04-08 09:29:19,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {1373#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1373#true} is VALID [2022-04-08 09:29:19,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {1373#true} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1430#(<= main_~k~0 main_~j~0)} is VALID [2022-04-08 09:29:19,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {1430#(<= main_~k~0 main_~j~0)} assume !!(~k~0 < ~n~0); {1430#(<= main_~k~0 main_~j~0)} is VALID [2022-04-08 09:29:19,704 INFO L272 TraceCheckUtils]: 13: Hoare triple {1430#(<= main_~k~0 main_~j~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1373#true} is VALID [2022-04-08 09:29:19,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {1373#true} ~cond := #in~cond; {1373#true} is VALID [2022-04-08 09:29:19,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {1373#true} assume !(0 == ~cond); {1373#true} is VALID [2022-04-08 09:29:19,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {1373#true} assume true; {1373#true} is VALID [2022-04-08 09:29:19,705 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1373#true} {1430#(<= main_~k~0 main_~j~0)} #92#return; {1430#(<= main_~k~0 main_~j~0)} is VALID [2022-04-08 09:29:19,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {1430#(<= main_~k~0 main_~j~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1452#(<= main_~k~0 (+ main_~j~0 1))} is VALID [2022-04-08 09:29:19,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {1452#(<= main_~k~0 (+ main_~j~0 1))} assume !(~k~0 < ~n~0); {1456#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2022-04-08 09:29:19,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {1456#(<= main_~n~0 (+ main_~j~0 1))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1460#(<= main_~n~0 main_~j~0)} is VALID [2022-04-08 09:29:19,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {1460#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1374#false} is VALID [2022-04-08 09:29:19,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {1374#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {1374#false} is VALID [2022-04-08 09:29:19,707 INFO L272 TraceCheckUtils]: 23: Hoare triple {1374#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1374#false} is VALID [2022-04-08 09:29:19,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {1374#false} ~cond := #in~cond; {1374#false} is VALID [2022-04-08 09:29:19,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {1374#false} assume !(0 == ~cond); {1374#false} is VALID [2022-04-08 09:29:19,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {1374#false} assume true; {1374#false} is VALID [2022-04-08 09:29:19,707 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1374#false} {1374#false} #94#return; {1374#false} is VALID [2022-04-08 09:29:19,708 INFO L272 TraceCheckUtils]: 28: Hoare triple {1374#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1374#false} is VALID [2022-04-08 09:29:19,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {1374#false} ~cond := #in~cond; {1374#false} is VALID [2022-04-08 09:29:19,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {1374#false} assume 0 == ~cond; {1374#false} is VALID [2022-04-08 09:29:19,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {1374#false} assume !false; {1374#false} is VALID [2022-04-08 09:29:19,708 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-08 09:29:19,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:29:19,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {1374#false} assume !false; {1374#false} is VALID [2022-04-08 09:29:19,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {1374#false} assume 0 == ~cond; {1374#false} is VALID [2022-04-08 09:29:19,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {1374#false} ~cond := #in~cond; {1374#false} is VALID [2022-04-08 09:29:19,822 INFO L272 TraceCheckUtils]: 28: Hoare triple {1374#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1374#false} is VALID [2022-04-08 09:29:19,822 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1373#true} {1374#false} #94#return; {1374#false} is VALID [2022-04-08 09:29:19,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {1373#true} assume true; {1373#true} is VALID [2022-04-08 09:29:19,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {1373#true} assume !(0 == ~cond); {1373#true} is VALID [2022-04-08 09:29:19,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {1373#true} ~cond := #in~cond; {1373#true} is VALID [2022-04-08 09:29:19,823 INFO L272 TraceCheckUtils]: 23: Hoare triple {1374#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1373#true} is VALID [2022-04-08 09:29:19,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {1374#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {1374#false} is VALID [2022-04-08 09:29:19,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {1460#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1374#false} is VALID [2022-04-08 09:29:19,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {1456#(<= main_~n~0 (+ main_~j~0 1))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1460#(<= main_~n~0 main_~j~0)} is VALID [2022-04-08 09:29:19,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {1452#(<= main_~k~0 (+ main_~j~0 1))} assume !(~k~0 < ~n~0); {1456#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2022-04-08 09:29:19,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {1430#(<= main_~k~0 main_~j~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1452#(<= main_~k~0 (+ main_~j~0 1))} is VALID [2022-04-08 09:29:19,825 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1373#true} {1430#(<= main_~k~0 main_~j~0)} #92#return; {1430#(<= main_~k~0 main_~j~0)} is VALID [2022-04-08 09:29:19,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {1373#true} assume true; {1373#true} is VALID [2022-04-08 09:29:19,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {1373#true} assume !(0 == ~cond); {1373#true} is VALID [2022-04-08 09:29:19,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {1373#true} ~cond := #in~cond; {1373#true} is VALID [2022-04-08 09:29:19,826 INFO L272 TraceCheckUtils]: 13: Hoare triple {1430#(<= main_~k~0 main_~j~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1373#true} is VALID [2022-04-08 09:29:19,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {1430#(<= main_~k~0 main_~j~0)} assume !!(~k~0 < ~n~0); {1430#(<= main_~k~0 main_~j~0)} is VALID [2022-04-08 09:29:19,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {1373#true} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1430#(<= main_~k~0 main_~j~0)} is VALID [2022-04-08 09:29:19,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {1373#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1373#true} is VALID [2022-04-08 09:29:19,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {1373#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1373#true} is VALID [2022-04-08 09:29:19,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {1373#true} ~i~0 := 0; {1373#true} is VALID [2022-04-08 09:29:19,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {1373#true} assume ~k~0 == ~n~0; {1373#true} is VALID [2022-04-08 09:29:19,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {1373#true} assume !!(~n~0 < 1000000); {1373#true} is VALID [2022-04-08 09:29:19,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {1373#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; {1373#true} is VALID [2022-04-08 09:29:19,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {1373#true} call #t~ret7 := main(); {1373#true} is VALID [2022-04-08 09:29:19,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1373#true} {1373#true} #98#return; {1373#true} is VALID [2022-04-08 09:29:19,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {1373#true} assume true; {1373#true} is VALID [2022-04-08 09:29:19,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {1373#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); {1373#true} is VALID [2022-04-08 09:29:19,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {1373#true} call ULTIMATE.init(); {1373#true} is VALID [2022-04-08 09:29:19,827 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-08 09:29:19,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695802161] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:29:19,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:29:19,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2022-04-08 09:29:19,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:19,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1966250176] [2022-04-08 09:29:19,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1966250176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:19,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:19,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:29:19,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386310008] [2022-04-08 09:29:19,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:19,829 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-04-08 09:29:19,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:19,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:19,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:19,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:29:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:19,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:29:19,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:29:19,849 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:20,467 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2022-04-08 09:29:20,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:29:20,467 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-04-08 09:29:20,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2022-04-08 09:29:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2022-04-08 09:29:20,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 87 transitions. [2022-04-08 09:29:20,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:20,537 INFO L225 Difference]: With dead ends: 100 [2022-04-08 09:29:20,538 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 09:29:20,538 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:29:20,538 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 52 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:20,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 46 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:29:20,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 09:29:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2022-04-08 09:29:20,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:20,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 56 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 09:29:20,627 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 56 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 09:29:20,627 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 56 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 09:29:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:20,630 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2022-04-08 09:29:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-04-08 09:29:20,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:20,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:20,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 76 states. [2022-04-08 09:29:20,630 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 76 states. [2022-04-08 09:29:20,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:20,632 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2022-04-08 09:29:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-04-08 09:29:20,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:20,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:20,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:20,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 09:29:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2022-04-08 09:29:20,634 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 32 [2022-04-08 09:29:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:20,635 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2022-04-08 09:29:20,635 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:20,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 69 transitions. [2022-04-08 09:29:20,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-04-08 09:29:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 09:29:20,710 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:20,711 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:20,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 09:29:20,919 WARN L460 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-08 09:29:20,919 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:20,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:20,920 INFO L85 PathProgramCache]: Analyzing trace with hash 747584238, now seen corresponding path program 1 times [2022-04-08 09:29:20,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:20,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1078191518] [2022-04-08 09:29:20,975 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:20,975 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:20,975 INFO L85 PathProgramCache]: Analyzing trace with hash 747584238, now seen corresponding path program 2 times [2022-04-08 09:29:20,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:20,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569147434] [2022-04-08 09:29:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:20,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:21,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:21,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {2089#(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); {2070#true} is VALID [2022-04-08 09:29:21,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-08 09:29:21,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2070#true} {2070#true} #98#return; {2070#true} is VALID [2022-04-08 09:29:21,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-08 09:29:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:21,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {2070#true} ~cond := #in~cond; {2070#true} is VALID [2022-04-08 09:29:21,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {2070#true} assume !(0 == ~cond); {2070#true} is VALID [2022-04-08 09:29:21,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-08 09:29:21,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2070#true} {2077#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} #92#return; {2077#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:21,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-08 09:29:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:21,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {2070#true} ~cond := #in~cond; {2070#true} is VALID [2022-04-08 09:29:21,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {2070#true} assume !(0 == ~cond); {2070#true} is VALID [2022-04-08 09:29:21,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-08 09:29:21,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2070#true} {2071#false} #94#return; {2071#false} is VALID [2022-04-08 09:29:21,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {2070#true} call ULTIMATE.init(); {2089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:21,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {2089#(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); {2070#true} is VALID [2022-04-08 09:29:21,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-08 09:29:21,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2070#true} {2070#true} #98#return; {2070#true} is VALID [2022-04-08 09:29:21,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {2070#true} call #t~ret7 := main(); {2070#true} is VALID [2022-04-08 09:29:21,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {2070#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; {2070#true} is VALID [2022-04-08 09:29:21,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {2070#true} assume !!(~n~0 < 1000000); {2070#true} is VALID [2022-04-08 09:29:21,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {2070#true} assume ~k~0 == ~n~0; {2070#true} is VALID [2022-04-08 09:29:21,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {2070#true} ~i~0 := 0; {2075#(= main_~i~0 0)} is VALID [2022-04-08 09:29:21,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {2075#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2076#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-08 09:29:21,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {2076#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2076#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-08 09:29:21,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {2076#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2077#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:21,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {2077#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} assume !!(~k~0 < ~n~0); {2077#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:21,071 INFO L272 TraceCheckUtils]: 13: Hoare triple {2077#(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)); {2070#true} is VALID [2022-04-08 09:29:21,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {2070#true} ~cond := #in~cond; {2070#true} is VALID [2022-04-08 09:29:21,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {2070#true} assume !(0 == ~cond); {2070#true} is VALID [2022-04-08 09:29:21,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-08 09:29:21,071 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2070#true} {2077#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} #92#return; {2077#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:21,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {2077#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2082#(and (<= main_~k~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} is VALID [2022-04-08 09:29:21,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {2082#(and (<= main_~k~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} assume !(~k~0 < ~n~0); {2083#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-08 09:29:21,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {2083#(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; {2083#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-08 09:29:21,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {2083#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} assume !(~j~0 < ~n~0); {2083#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-08 09:29:21,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {2083#(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; {2084#(<= main_~n~0 main_~i~0)} is VALID [2022-04-08 09:29:21,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {2084#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2071#false} is VALID [2022-04-08 09:29:21,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {2071#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2071#false} is VALID [2022-04-08 09:29:21,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {2071#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2071#false} is VALID [2022-04-08 09:29:21,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {2071#false} assume !(~k~0 < ~n~0); {2071#false} is VALID [2022-04-08 09:29:21,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {2071#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2071#false} is VALID [2022-04-08 09:29:21,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {2071#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2071#false} is VALID [2022-04-08 09:29:21,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {2071#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {2071#false} is VALID [2022-04-08 09:29:21,074 INFO L272 TraceCheckUtils]: 30: Hoare triple {2071#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {2070#true} is VALID [2022-04-08 09:29:21,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {2070#true} ~cond := #in~cond; {2070#true} is VALID [2022-04-08 09:29:21,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {2070#true} assume !(0 == ~cond); {2070#true} is VALID [2022-04-08 09:29:21,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-08 09:29:21,075 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2070#true} {2071#false} #94#return; {2071#false} is VALID [2022-04-08 09:29:21,075 INFO L272 TraceCheckUtils]: 35: Hoare triple {2071#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {2071#false} is VALID [2022-04-08 09:29:21,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {2071#false} ~cond := #in~cond; {2071#false} is VALID [2022-04-08 09:29:21,075 INFO L290 TraceCheckUtils]: 37: Hoare triple {2071#false} assume 0 == ~cond; {2071#false} is VALID [2022-04-08 09:29:21,075 INFO L290 TraceCheckUtils]: 38: Hoare triple {2071#false} assume !false; {2071#false} is VALID [2022-04-08 09:29:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 09:29:21,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:21,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569147434] [2022-04-08 09:29:21,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569147434] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:21,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434274488] [2022-04-08 09:29:21,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:29:21,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:21,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:21,080 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:29:21,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 09:29:21,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:29:21,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:21,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 09:29:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:21,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:21,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {2070#true} call ULTIMATE.init(); {2070#true} is VALID [2022-04-08 09:29:21,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {2070#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); {2070#true} is VALID [2022-04-08 09:29:21,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-08 09:29:21,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2070#true} {2070#true} #98#return; {2070#true} is VALID [2022-04-08 09:29:21,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {2070#true} call #t~ret7 := main(); {2070#true} is VALID [2022-04-08 09:29:21,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {2070#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; {2070#true} is VALID [2022-04-08 09:29:21,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {2070#true} assume !!(~n~0 < 1000000); {2070#true} is VALID [2022-04-08 09:29:21,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {2070#true} assume ~k~0 == ~n~0; {2070#true} is VALID [2022-04-08 09:29:21,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {2070#true} ~i~0 := 0; {2117#(<= main_~i~0 0)} is VALID [2022-04-08 09:29:21,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {2117#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2121#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:21,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {2121#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2121#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:21,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {2121#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2128#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:21,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {2128#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} assume !!(~k~0 < ~n~0); {2128#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:21,574 INFO L272 TraceCheckUtils]: 13: Hoare triple {2128#(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)); {2070#true} is VALID [2022-04-08 09:29:21,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {2070#true} ~cond := #in~cond; {2070#true} is VALID [2022-04-08 09:29:21,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {2070#true} assume !(0 == ~cond); {2070#true} is VALID [2022-04-08 09:29:21,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-08 09:29:21,574 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2070#true} {2128#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} #92#return; {2128#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:21,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {2128#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2150#(and (<= main_~i~0 0) (<= main_~k~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-08 09:29:21,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {2150#(and (<= main_~i~0 0) (<= main_~k~0 (+ (* main_~i~0 2) 1)))} assume !(~k~0 < ~n~0); {2154#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-08 09:29:21,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {2154#(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; {2154#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-08 09:29:21,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {2154#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} assume !(~j~0 < ~n~0); {2154#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-08 09:29:21,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {2154#(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; {2164#(and (<= (+ (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1) main_~i~0) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) 0))} is VALID [2022-04-08 09:29:21,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {2164#(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; {2071#false} is VALID [2022-04-08 09:29:21,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {2071#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2071#false} is VALID [2022-04-08 09:29:21,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {2071#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2071#false} is VALID [2022-04-08 09:29:21,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {2071#false} assume !(~k~0 < ~n~0); {2071#false} is VALID [2022-04-08 09:29:21,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {2071#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2071#false} is VALID [2022-04-08 09:29:21,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {2071#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2071#false} is VALID [2022-04-08 09:29:21,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {2071#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {2071#false} is VALID [2022-04-08 09:29:21,578 INFO L272 TraceCheckUtils]: 30: Hoare triple {2071#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {2071#false} is VALID [2022-04-08 09:29:21,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {2071#false} ~cond := #in~cond; {2071#false} is VALID [2022-04-08 09:29:21,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {2071#false} assume !(0 == ~cond); {2071#false} is VALID [2022-04-08 09:29:21,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {2071#false} assume true; {2071#false} is VALID [2022-04-08 09:29:21,578 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2071#false} {2071#false} #94#return; {2071#false} is VALID [2022-04-08 09:29:21,578 INFO L272 TraceCheckUtils]: 35: Hoare triple {2071#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {2071#false} is VALID [2022-04-08 09:29:21,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {2071#false} ~cond := #in~cond; {2071#false} is VALID [2022-04-08 09:29:21,578 INFO L290 TraceCheckUtils]: 37: Hoare triple {2071#false} assume 0 == ~cond; {2071#false} is VALID [2022-04-08 09:29:21,578 INFO L290 TraceCheckUtils]: 38: Hoare triple {2071#false} assume !false; {2071#false} is VALID [2022-04-08 09:29:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 09:29:21,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:29:21,747 INFO L290 TraceCheckUtils]: 38: Hoare triple {2071#false} assume !false; {2071#false} is VALID [2022-04-08 09:29:21,747 INFO L290 TraceCheckUtils]: 37: Hoare triple {2071#false} assume 0 == ~cond; {2071#false} is VALID [2022-04-08 09:29:21,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {2071#false} ~cond := #in~cond; {2071#false} is VALID [2022-04-08 09:29:21,747 INFO L272 TraceCheckUtils]: 35: Hoare triple {2071#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {2071#false} is VALID [2022-04-08 09:29:21,747 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2070#true} {2071#false} #94#return; {2071#false} is VALID [2022-04-08 09:29:21,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-08 09:29:21,747 INFO L290 TraceCheckUtils]: 32: Hoare triple {2070#true} assume !(0 == ~cond); {2070#true} is VALID [2022-04-08 09:29:21,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {2070#true} ~cond := #in~cond; {2070#true} is VALID [2022-04-08 09:29:21,748 INFO L272 TraceCheckUtils]: 30: Hoare triple {2071#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {2070#true} is VALID [2022-04-08 09:29:21,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {2071#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {2071#false} is VALID [2022-04-08 09:29:21,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {2071#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2071#false} is VALID [2022-04-08 09:29:21,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {2071#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2071#false} is VALID [2022-04-08 09:29:21,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {2071#false} assume !(~k~0 < ~n~0); {2071#false} is VALID [2022-04-08 09:29:21,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {2071#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2071#false} is VALID [2022-04-08 09:29:21,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {2071#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2071#false} is VALID [2022-04-08 09:29:21,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {2084#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2071#false} is VALID [2022-04-08 09:29:21,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {2261#(<= main_~n~0 (+ main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2084#(<= main_~n~0 main_~i~0)} is VALID [2022-04-08 09:29:21,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {2261#(<= main_~n~0 (+ main_~i~0 1))} assume !(~j~0 < ~n~0); {2261#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-08 09:29:21,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {2261#(<= main_~n~0 (+ main_~i~0 1))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2261#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-08 09:29:21,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {2271#(<= main_~k~0 (+ main_~i~0 1))} assume !(~k~0 < ~n~0); {2261#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-08 09:29:21,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {2275#(<= main_~k~0 main_~i~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2271#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2022-04-08 09:29:21,753 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2070#true} {2275#(<= main_~k~0 main_~i~0)} #92#return; {2275#(<= main_~k~0 main_~i~0)} is VALID [2022-04-08 09:29:21,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-08 09:29:21,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {2070#true} assume !(0 == ~cond); {2070#true} is VALID [2022-04-08 09:29:21,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {2070#true} ~cond := #in~cond; {2070#true} is VALID [2022-04-08 09:29:21,753 INFO L272 TraceCheckUtils]: 13: Hoare triple {2275#(<= main_~k~0 main_~i~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {2070#true} is VALID [2022-04-08 09:29:21,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {2275#(<= main_~k~0 main_~i~0)} assume !!(~k~0 < ~n~0); {2275#(<= main_~k~0 main_~i~0)} is VALID [2022-04-08 09:29:21,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {2297#(<= main_~j~0 main_~i~0)} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2275#(<= main_~k~0 main_~i~0)} is VALID [2022-04-08 09:29:21,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {2297#(<= main_~j~0 main_~i~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2297#(<= main_~j~0 main_~i~0)} is VALID [2022-04-08 09:29:21,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {2117#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2297#(<= main_~j~0 main_~i~0)} is VALID [2022-04-08 09:29:21,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {2070#true} ~i~0 := 0; {2117#(<= main_~i~0 0)} is VALID [2022-04-08 09:29:21,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {2070#true} assume ~k~0 == ~n~0; {2070#true} is VALID [2022-04-08 09:29:21,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {2070#true} assume !!(~n~0 < 1000000); {2070#true} is VALID [2022-04-08 09:29:21,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {2070#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; {2070#true} is VALID [2022-04-08 09:29:21,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {2070#true} call #t~ret7 := main(); {2070#true} is VALID [2022-04-08 09:29:21,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2070#true} {2070#true} #98#return; {2070#true} is VALID [2022-04-08 09:29:21,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-08 09:29:21,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {2070#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); {2070#true} is VALID [2022-04-08 09:29:21,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {2070#true} call ULTIMATE.init(); {2070#true} is VALID [2022-04-08 09:29:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 09:29:21,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434274488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:29:21,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:29:21,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-04-08 09:29:21,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:21,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1078191518] [2022-04-08 09:29:21,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1078191518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:21,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:21,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:29:21,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683811939] [2022-04-08 09:29:21,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:21,757 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2022-04-08 09:29:21,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:21,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:21,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:21,778 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:29:21,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:21,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:29:21,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-04-08 09:29:21,779 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:22,518 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2022-04-08 09:29:22,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:29:22,519 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2022-04-08 09:29:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2022-04-08 09:29:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2022-04-08 09:29:22,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 106 transitions. [2022-04-08 09:29:22,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:22,605 INFO L225 Difference]: With dead ends: 117 [2022-04-08 09:29:22,605 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 09:29:22,605 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2022-04-08 09:29:22,606 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 62 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:22,606 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 39 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:29:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 09:29:22,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2022-04-08 09:29:22,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:22,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 60 states, 43 states have (on average 1.255813953488372) internal successors, (54), 46 states have internal predecessors, (54), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 09:29:22,716 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 60 states, 43 states have (on average 1.255813953488372) internal successors, (54), 46 states have internal predecessors, (54), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 09:29:22,717 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 60 states, 43 states have (on average 1.255813953488372) internal successors, (54), 46 states have internal predecessors, (54), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 09:29:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:22,719 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2022-04-08 09:29:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2022-04-08 09:29:22,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:22,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:22,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 43 states have (on average 1.255813953488372) internal successors, (54), 46 states have internal predecessors, (54), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-08 09:29:22,719 INFO L87 Difference]: Start difference. First operand has 60 states, 43 states have (on average 1.255813953488372) internal successors, (54), 46 states have internal predecessors, (54), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-08 09:29:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:22,721 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2022-04-08 09:29:22,721 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2022-04-08 09:29:22,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:22,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:22,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:22,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.255813953488372) internal successors, (54), 46 states have internal predecessors, (54), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 09:29:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2022-04-08 09:29:22,723 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 39 [2022-04-08 09:29:22,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:22,724 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2022-04-08 09:29:22,724 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:22,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 75 transitions. [2022-04-08 09:29:22,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-04-08 09:29:22,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 09:29:22,804 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:22,804 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:22,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 09:29:23,004 WARN L460 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-08 09:29:23,005 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:23,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:23,005 INFO L85 PathProgramCache]: Analyzing trace with hash 980226149, now seen corresponding path program 1 times [2022-04-08 09:29:23,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:23,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [129715103] [2022-04-08 09:29:23,095 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:23,096 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:23,096 INFO L85 PathProgramCache]: Analyzing trace with hash 980226149, now seen corresponding path program 2 times [2022-04-08 09:29:23,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:23,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628046638] [2022-04-08 09:29:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:23,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:23,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {2865#(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); {2843#true} is VALID [2022-04-08 09:29:23,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-08 09:29:23,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2843#true} {2843#true} #98#return; {2843#true} is VALID [2022-04-08 09:29:23,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 09:29:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:23,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {2843#true} ~cond := #in~cond; {2843#true} is VALID [2022-04-08 09:29:23,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {2843#true} assume !(0 == ~cond); {2843#true} is VALID [2022-04-08 09:29:23,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-08 09:29:23,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2843#true} {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} #94#return; {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-08 09:29:23,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 09:29:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:23,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {2843#true} ~cond := #in~cond; {2843#true} is VALID [2022-04-08 09:29:23,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {2843#true} assume !(0 == ~cond); {2843#true} is VALID [2022-04-08 09:29:23,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-08 09:29:23,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2843#true} {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} #96#return; {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-08 09:29:23,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-08 09:29:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:23,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {2843#true} ~cond := #in~cond; {2843#true} is VALID [2022-04-08 09:29:23,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {2843#true} assume !(0 == ~cond); {2843#true} is VALID [2022-04-08 09:29:23,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-08 09:29:23,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2843#true} {2844#false} #94#return; {2844#false} is VALID [2022-04-08 09:29:23,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {2843#true} call ULTIMATE.init(); {2865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:23,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {2865#(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); {2843#true} is VALID [2022-04-08 09:29:23,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-08 09:29:23,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2843#true} {2843#true} #98#return; {2843#true} is VALID [2022-04-08 09:29:23,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {2843#true} call #t~ret7 := main(); {2843#true} is VALID [2022-04-08 09:29:23,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {2843#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; {2843#true} is VALID [2022-04-08 09:29:23,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {2843#true} assume !!(~n~0 < 1000000); {2843#true} is VALID [2022-04-08 09:29:23,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {2843#true} assume ~k~0 == ~n~0; {2843#true} is VALID [2022-04-08 09:29:23,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {2843#true} ~i~0 := 0; {2848#(= main_~i~0 0)} is VALID [2022-04-08 09:29:23,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {2848#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-08 09:29:23,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-08 09:29:23,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-08 09:29:23,184 INFO L272 TraceCheckUtils]: 12: Hoare triple {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {2843#true} is VALID [2022-04-08 09:29:23,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {2843#true} ~cond := #in~cond; {2843#true} is VALID [2022-04-08 09:29:23,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {2843#true} assume !(0 == ~cond); {2843#true} is VALID [2022-04-08 09:29:23,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-08 09:29:23,185 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2843#true} {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} #94#return; {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-08 09:29:23,185 INFO L272 TraceCheckUtils]: 17: Hoare triple {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {2843#true} is VALID [2022-04-08 09:29:23,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {2843#true} ~cond := #in~cond; {2843#true} is VALID [2022-04-08 09:29:23,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {2843#true} assume !(0 == ~cond); {2843#true} is VALID [2022-04-08 09:29:23,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-08 09:29:23,186 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2843#true} {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} #96#return; {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-08 09:29:23,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {2849#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2858#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} is VALID [2022-04-08 09:29:23,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {2858#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} assume !(~j~0 < ~n~0); {2859#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-08 09:29:23,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {2859#(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; {2860#(<= main_~n~0 main_~i~0)} is VALID [2022-04-08 09:29:23,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {2860#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2844#false} is VALID [2022-04-08 09:29:23,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {2844#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2844#false} is VALID [2022-04-08 09:29:23,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {2844#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2844#false} is VALID [2022-04-08 09:29:23,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {2844#false} assume !(~k~0 < ~n~0); {2844#false} is VALID [2022-04-08 09:29:23,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {2844#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2844#false} is VALID [2022-04-08 09:29:23,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {2844#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2844#false} is VALID [2022-04-08 09:29:23,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {2844#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {2844#false} is VALID [2022-04-08 09:29:23,188 INFO L272 TraceCheckUtils]: 32: Hoare triple {2844#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {2843#true} is VALID [2022-04-08 09:29:23,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {2843#true} ~cond := #in~cond; {2843#true} is VALID [2022-04-08 09:29:23,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {2843#true} assume !(0 == ~cond); {2843#true} is VALID [2022-04-08 09:29:23,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-08 09:29:23,188 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2843#true} {2844#false} #94#return; {2844#false} is VALID [2022-04-08 09:29:23,188 INFO L272 TraceCheckUtils]: 37: Hoare triple {2844#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {2844#false} is VALID [2022-04-08 09:29:23,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {2844#false} ~cond := #in~cond; {2844#false} is VALID [2022-04-08 09:29:23,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {2844#false} assume 0 == ~cond; {2844#false} is VALID [2022-04-08 09:29:23,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {2844#false} assume !false; {2844#false} is VALID [2022-04-08 09:29:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 09:29:23,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:23,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628046638] [2022-04-08 09:29:23,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628046638] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:23,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693750293] [2022-04-08 09:29:23,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:29:23,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:23,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:23,216 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:29:23,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 09:29:23,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:29:23,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:23,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 09:29:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:23,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:23,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {2843#true} call ULTIMATE.init(); {2843#true} is VALID [2022-04-08 09:29:23,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {2843#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); {2843#true} is VALID [2022-04-08 09:29:23,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-08 09:29:23,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2843#true} {2843#true} #98#return; {2843#true} is VALID [2022-04-08 09:29:23,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {2843#true} call #t~ret7 := main(); {2843#true} is VALID [2022-04-08 09:29:23,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {2843#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; {2843#true} is VALID [2022-04-08 09:29:23,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {2843#true} assume !!(~n~0 < 1000000); {2843#true} is VALID [2022-04-08 09:29:23,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {2843#true} assume ~k~0 == ~n~0; {2843#true} is VALID [2022-04-08 09:29:23,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {2843#true} ~i~0 := 0; {2893#(<= main_~i~0 0)} is VALID [2022-04-08 09:29:23,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {2893#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2897#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:23,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {2897#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2897#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:23,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {2897#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {2897#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:23,670 INFO L272 TraceCheckUtils]: 12: Hoare triple {2897#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {2843#true} is VALID [2022-04-08 09:29:23,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {2843#true} ~cond := #in~cond; {2843#true} is VALID [2022-04-08 09:29:23,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {2843#true} assume !(0 == ~cond); {2843#true} is VALID [2022-04-08 09:29:23,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-08 09:29:23,671 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2843#true} {2897#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} #94#return; {2897#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:23,671 INFO L272 TraceCheckUtils]: 17: Hoare triple {2897#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {2843#true} is VALID [2022-04-08 09:29:23,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {2843#true} ~cond := #in~cond; {2843#true} is VALID [2022-04-08 09:29:23,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {2843#true} assume !(0 == ~cond); {2843#true} is VALID [2022-04-08 09:29:23,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-08 09:29:23,672 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2843#true} {2897#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} #96#return; {2897#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:23,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {2897#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2937#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (<= main_~i~0 0))} is VALID [2022-04-08 09:29:23,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {2937#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {2941#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-08 09:29:23,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {2941#(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; {2945#(and (<= (+ (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1) main_~i~0) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) 0))} is VALID [2022-04-08 09:29:23,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {2945#(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; {2844#false} is VALID [2022-04-08 09:29:23,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {2844#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2844#false} is VALID [2022-04-08 09:29:23,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {2844#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2844#false} is VALID [2022-04-08 09:29:23,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {2844#false} assume !(~k~0 < ~n~0); {2844#false} is VALID [2022-04-08 09:29:23,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {2844#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2844#false} is VALID [2022-04-08 09:29:23,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {2844#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2844#false} is VALID [2022-04-08 09:29:23,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {2844#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {2844#false} is VALID [2022-04-08 09:29:23,674 INFO L272 TraceCheckUtils]: 32: Hoare triple {2844#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {2844#false} is VALID [2022-04-08 09:29:23,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {2844#false} ~cond := #in~cond; {2844#false} is VALID [2022-04-08 09:29:23,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {2844#false} assume !(0 == ~cond); {2844#false} is VALID [2022-04-08 09:29:23,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {2844#false} assume true; {2844#false} is VALID [2022-04-08 09:29:23,675 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2844#false} {2844#false} #94#return; {2844#false} is VALID [2022-04-08 09:29:23,675 INFO L272 TraceCheckUtils]: 37: Hoare triple {2844#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {2844#false} is VALID [2022-04-08 09:29:23,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {2844#false} ~cond := #in~cond; {2844#false} is VALID [2022-04-08 09:29:23,675 INFO L290 TraceCheckUtils]: 39: Hoare triple {2844#false} assume 0 == ~cond; {2844#false} is VALID [2022-04-08 09:29:23,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {2844#false} assume !false; {2844#false} is VALID [2022-04-08 09:29:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 09:29:23,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:29:23,831 INFO L290 TraceCheckUtils]: 40: Hoare triple {2844#false} assume !false; {2844#false} is VALID [2022-04-08 09:29:23,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {2844#false} assume 0 == ~cond; {2844#false} is VALID [2022-04-08 09:29:23,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {2844#false} ~cond := #in~cond; {2844#false} is VALID [2022-04-08 09:29:23,832 INFO L272 TraceCheckUtils]: 37: Hoare triple {2844#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {2844#false} is VALID [2022-04-08 09:29:23,832 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2843#true} {2844#false} #94#return; {2844#false} is VALID [2022-04-08 09:29:23,832 INFO L290 TraceCheckUtils]: 35: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-08 09:29:23,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {2843#true} assume !(0 == ~cond); {2843#true} is VALID [2022-04-08 09:29:23,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {2843#true} ~cond := #in~cond; {2843#true} is VALID [2022-04-08 09:29:23,832 INFO L272 TraceCheckUtils]: 32: Hoare triple {2844#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {2843#true} is VALID [2022-04-08 09:29:23,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {2844#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {2844#false} is VALID [2022-04-08 09:29:23,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {2844#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2844#false} is VALID [2022-04-08 09:29:23,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {2844#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2844#false} is VALID [2022-04-08 09:29:23,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {2844#false} assume !(~k~0 < ~n~0); {2844#false} is VALID [2022-04-08 09:29:23,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {2844#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2844#false} is VALID [2022-04-08 09:29:23,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {2844#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2844#false} is VALID [2022-04-08 09:29:23,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {2860#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2844#false} is VALID [2022-04-08 09:29:23,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {3042#(<= main_~n~0 (+ main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2860#(<= main_~n~0 main_~i~0)} is VALID [2022-04-08 09:29:23,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {3046#(<= main_~j~0 (+ main_~i~0 1))} assume !(~j~0 < ~n~0); {3042#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-08 09:29:23,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {3050#(<= main_~j~0 main_~i~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3046#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2022-04-08 09:29:23,835 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2843#true} {3050#(<= main_~j~0 main_~i~0)} #96#return; {3050#(<= main_~j~0 main_~i~0)} is VALID [2022-04-08 09:29:23,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-08 09:29:23,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {2843#true} assume !(0 == ~cond); {2843#true} is VALID [2022-04-08 09:29:23,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {2843#true} ~cond := #in~cond; {2843#true} is VALID [2022-04-08 09:29:23,835 INFO L272 TraceCheckUtils]: 17: Hoare triple {3050#(<= main_~j~0 main_~i~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {2843#true} is VALID [2022-04-08 09:29:23,836 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2843#true} {3050#(<= main_~j~0 main_~i~0)} #94#return; {3050#(<= main_~j~0 main_~i~0)} is VALID [2022-04-08 09:29:23,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-08 09:29:23,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {2843#true} assume !(0 == ~cond); {2843#true} is VALID [2022-04-08 09:29:23,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {2843#true} ~cond := #in~cond; {2843#true} is VALID [2022-04-08 09:29:23,836 INFO L272 TraceCheckUtils]: 12: Hoare triple {3050#(<= main_~j~0 main_~i~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {2843#true} is VALID [2022-04-08 09:29:23,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {3050#(<= main_~j~0 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {3050#(<= main_~j~0 main_~i~0)} is VALID [2022-04-08 09:29:23,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {3050#(<= main_~j~0 main_~i~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3050#(<= main_~j~0 main_~i~0)} is VALID [2022-04-08 09:29:23,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {2893#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3050#(<= main_~j~0 main_~i~0)} is VALID [2022-04-08 09:29:23,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {2843#true} ~i~0 := 0; {2893#(<= main_~i~0 0)} is VALID [2022-04-08 09:29:23,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {2843#true} assume ~k~0 == ~n~0; {2843#true} is VALID [2022-04-08 09:29:23,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {2843#true} assume !!(~n~0 < 1000000); {2843#true} is VALID [2022-04-08 09:29:23,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {2843#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; {2843#true} is VALID [2022-04-08 09:29:23,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {2843#true} call #t~ret7 := main(); {2843#true} is VALID [2022-04-08 09:29:23,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2843#true} {2843#true} #98#return; {2843#true} is VALID [2022-04-08 09:29:23,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-08 09:29:23,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {2843#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); {2843#true} is VALID [2022-04-08 09:29:23,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {2843#true} call ULTIMATE.init(); {2843#true} is VALID [2022-04-08 09:29:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 09:29:23,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693750293] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:29:23,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:29:23,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-04-08 09:29:23,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:23,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [129715103] [2022-04-08 09:29:23,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [129715103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:23,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:23,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:29:23,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567397742] [2022-04-08 09:29:23,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:23,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2022-04-08 09:29:23,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:23,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 09:29:23,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:23,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:29:23,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:23,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:29:23,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:29:23,861 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 09:29:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:24,409 INFO L93 Difference]: Finished difference Result 115 states and 147 transitions. [2022-04-08 09:29:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:29:24,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2022-04-08 09:29:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 09:29:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-04-08 09:29:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 09:29:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-04-08 09:29:24,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2022-04-08 09:29:24,477 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-08 09:29:24,479 INFO L225 Difference]: With dead ends: 115 [2022-04-08 09:29:24,479 INFO L226 Difference]: Without dead ends: 77 [2022-04-08 09:29:24,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2022-04-08 09:29:24,480 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 60 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:24,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 48 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:29:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-08 09:29:24,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2022-04-08 09:29:24,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:24,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 68 states, 48 states have (on average 1.25) internal successors, (60), 52 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 09:29:24,608 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 68 states, 48 states have (on average 1.25) internal successors, (60), 52 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 09:29:24,609 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 68 states, 48 states have (on average 1.25) internal successors, (60), 52 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 09:29:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:24,611 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2022-04-08 09:29:24,611 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2022-04-08 09:29:24,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:24,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:24,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.25) internal successors, (60), 52 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 77 states. [2022-04-08 09:29:24,612 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.25) internal successors, (60), 52 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 77 states. [2022-04-08 09:29:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:24,615 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2022-04-08 09:29:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2022-04-08 09:29:24,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:24,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:24,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:24,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.25) internal successors, (60), 52 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 09:29:24,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2022-04-08 09:29:24,617 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 41 [2022-04-08 09:29:24,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:24,617 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2022-04-08 09:29:24,617 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 09:29:24,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 87 transitions. [2022-04-08 09:29:24,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2022-04-08 09:29:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 09:29:24,713 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:24,713 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:24,731 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-08 09:29:24,921 WARN L460 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-08 09:29:24,921 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:24,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:24,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1415669004, now seen corresponding path program 1 times [2022-04-08 09:29:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:24,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2033159542] [2022-04-08 09:29:25,058 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:25,058 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:25,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1415669004, now seen corresponding path program 2 times [2022-04-08 09:29:25,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:25,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789244413] [2022-04-08 09:29:25,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:25,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:25,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:25,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {3674#(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); {3649#true} is VALID [2022-04-08 09:29:25,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3649#true} {3649#true} #98#return; {3649#true} is VALID [2022-04-08 09:29:25,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 09:29:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:25,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {3649#true} ~cond := #in~cond; {3649#true} is VALID [2022-04-08 09:29:25,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {3649#true} assume !(0 == ~cond); {3649#true} is VALID [2022-04-08 09:29:25,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3649#true} {3649#true} #94#return; {3649#true} is VALID [2022-04-08 09:29:25,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 09:29:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:25,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {3649#true} ~cond := #in~cond; {3649#true} is VALID [2022-04-08 09:29:25,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {3649#true} assume !(0 == ~cond); {3649#true} is VALID [2022-04-08 09:29:25,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3649#true} {3649#true} #96#return; {3649#true} is VALID [2022-04-08 09:29:25,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 09:29:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:25,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {3649#true} ~cond := #in~cond; {3649#true} is VALID [2022-04-08 09:29:25,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {3649#true} assume !(0 == ~cond); {3649#true} is VALID [2022-04-08 09:29:25,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3649#true} {3649#true} #92#return; {3649#true} is VALID [2022-04-08 09:29:25,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-08 09:29:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:25,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {3649#true} ~cond := #in~cond; {3649#true} is VALID [2022-04-08 09:29:25,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {3649#true} assume !(0 == ~cond); {3649#true} is VALID [2022-04-08 09:29:25,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3649#true} {3667#(<= (+ main_~k~0 1) main_~n~0)} #94#return; {3667#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:25,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {3649#true} call ULTIMATE.init(); {3674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:25,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {3674#(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); {3649#true} is VALID [2022-04-08 09:29:25,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3649#true} {3649#true} #98#return; {3649#true} is VALID [2022-04-08 09:29:25,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {3649#true} call #t~ret7 := main(); {3649#true} is VALID [2022-04-08 09:29:25,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {3649#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; {3649#true} is VALID [2022-04-08 09:29:25,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {3649#true} assume !!(~n~0 < 1000000); {3649#true} is VALID [2022-04-08 09:29:25,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {3649#true} assume ~k~0 == ~n~0; {3649#true} is VALID [2022-04-08 09:29:25,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {3649#true} ~i~0 := 0; {3649#true} is VALID [2022-04-08 09:29:25,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {3649#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3649#true} is VALID [2022-04-08 09:29:25,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {3649#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {3649#true} assume !(0 != #t~nondet5);havoc #t~nondet5; {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L272 TraceCheckUtils]: 12: Hoare triple {3649#true} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {3649#true} ~cond := #in~cond; {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {3649#true} assume !(0 == ~cond); {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3649#true} {3649#true} #94#return; {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L272 TraceCheckUtils]: 17: Hoare triple {3649#true} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {3649#true} ~cond := #in~cond; {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {3649#true} assume !(0 == ~cond); {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3649#true} {3649#true} #96#return; {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {3649#true} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {3649#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {3649#true} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {3649#true} assume !!(~k~0 < ~n~0); {3649#true} is VALID [2022-04-08 09:29:25,177 INFO L272 TraceCheckUtils]: 26: Hoare triple {3649#true} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {3649#true} is VALID [2022-04-08 09:29:25,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {3649#true} ~cond := #in~cond; {3649#true} is VALID [2022-04-08 09:29:25,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {3649#true} assume !(0 == ~cond); {3649#true} is VALID [2022-04-08 09:29:25,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,178 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3649#true} {3649#true} #92#return; {3649#true} is VALID [2022-04-08 09:29:25,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {3649#true} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3649#true} is VALID [2022-04-08 09:29:25,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {3649#true} assume !(~k~0 < ~n~0); {3649#true} is VALID [2022-04-08 09:29:25,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {3649#true} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3649#true} is VALID [2022-04-08 09:29:25,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {3649#true} assume !(~j~0 < ~n~0); {3649#true} is VALID [2022-04-08 09:29:25,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {3649#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3649#true} is VALID [2022-04-08 09:29:25,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {3649#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3649#true} is VALID [2022-04-08 09:29:25,187 INFO L290 TraceCheckUtils]: 37: Hoare triple {3649#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3666#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-08 09:29:25,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {3666#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {3667#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:25,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {3667#(<= (+ main_~k~0 1) main_~n~0)} assume !(~k~0 < ~n~0); {3667#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:25,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {3667#(<= (+ main_~k~0 1) main_~n~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3667#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:25,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {3667#(<= (+ main_~k~0 1) main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3667#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:25,189 INFO L290 TraceCheckUtils]: 42: Hoare triple {3667#(<= (+ main_~k~0 1) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {3667#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:25,189 INFO L272 TraceCheckUtils]: 43: Hoare triple {3667#(<= (+ main_~k~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3649#true} is VALID [2022-04-08 09:29:25,189 INFO L290 TraceCheckUtils]: 44: Hoare triple {3649#true} ~cond := #in~cond; {3649#true} is VALID [2022-04-08 09:29:25,189 INFO L290 TraceCheckUtils]: 45: Hoare triple {3649#true} assume !(0 == ~cond); {3649#true} is VALID [2022-04-08 09:29:25,189 INFO L290 TraceCheckUtils]: 46: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,190 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {3649#true} {3667#(<= (+ main_~k~0 1) main_~n~0)} #94#return; {3667#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-08 09:29:25,190 INFO L272 TraceCheckUtils]: 48: Hoare triple {3667#(<= (+ main_~k~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3672#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:29:25,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {3672#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3673#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:29:25,191 INFO L290 TraceCheckUtils]: 50: Hoare triple {3673#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3650#false} is VALID [2022-04-08 09:29:25,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {3650#false} assume !false; {3650#false} is VALID [2022-04-08 09:29:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-08 09:29:25,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:25,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789244413] [2022-04-08 09:29:25,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789244413] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:25,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850675157] [2022-04-08 09:29:25,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:29:25,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:25,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:25,192 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:29:25,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 09:29:25,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:29:25,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:25,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 09:29:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:25,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:25,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {3649#true} call ULTIMATE.init(); {3649#true} is VALID [2022-04-08 09:29:25,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {3649#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); {3649#true} is VALID [2022-04-08 09:29:25,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3649#true} {3649#true} #98#return; {3649#true} is VALID [2022-04-08 09:29:25,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {3649#true} call #t~ret7 := main(); {3649#true} is VALID [2022-04-08 09:29:25,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {3649#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; {3649#true} is VALID [2022-04-08 09:29:25,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {3649#true} assume !!(~n~0 < 1000000); {3649#true} is VALID [2022-04-08 09:29:25,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {3649#true} assume ~k~0 == ~n~0; {3649#true} is VALID [2022-04-08 09:29:25,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {3649#true} ~i~0 := 0; {3649#true} is VALID [2022-04-08 09:29:25,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {3649#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3705#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-08 09:29:25,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {3705#(<= main_~j~0 (* main_~i~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3705#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-08 09:29:25,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {3705#(<= main_~j~0 (* main_~i~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {3705#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-08 09:29:25,727 INFO L272 TraceCheckUtils]: 12: Hoare triple {3705#(<= main_~j~0 (* main_~i~0 2))} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3649#true} is VALID [2022-04-08 09:29:25,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {3649#true} ~cond := #in~cond; {3649#true} is VALID [2022-04-08 09:29:25,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {3649#true} assume !(0 == ~cond); {3649#true} is VALID [2022-04-08 09:29:25,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,728 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3649#true} {3705#(<= main_~j~0 (* main_~i~0 2))} #94#return; {3705#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-08 09:29:25,728 INFO L272 TraceCheckUtils]: 17: Hoare triple {3705#(<= main_~j~0 (* main_~i~0 2))} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3649#true} is VALID [2022-04-08 09:29:25,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {3649#true} ~cond := #in~cond; {3649#true} is VALID [2022-04-08 09:29:25,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {3649#true} assume !(0 == ~cond); {3649#true} is VALID [2022-04-08 09:29:25,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,729 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3649#true} {3705#(<= main_~j~0 (* main_~i~0 2))} #96#return; {3705#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-08 09:29:25,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {3705#(<= main_~j~0 (* main_~i~0 2))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3745#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-08 09:29:25,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {3745#(<= main_~j~0 (+ (* main_~i~0 2) 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3745#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-08 09:29:25,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {3745#(<= main_~j~0 (+ (* main_~i~0 2) 1))} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {3752#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-08 09:29:25,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {3752#(<= main_~k~0 (+ (* main_~i~0 2) 1))} assume !!(~k~0 < ~n~0); {3752#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-08 09:29:25,730 INFO L272 TraceCheckUtils]: 26: Hoare triple {3752#(<= main_~k~0 (+ (* main_~i~0 2) 1))} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {3649#true} is VALID [2022-04-08 09:29:25,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {3649#true} ~cond := #in~cond; {3649#true} is VALID [2022-04-08 09:29:25,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {3649#true} assume !(0 == ~cond); {3649#true} is VALID [2022-04-08 09:29:25,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,731 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3649#true} {3752#(<= main_~k~0 (+ (* main_~i~0 2) 1))} #92#return; {3752#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-08 09:29:25,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {3752#(<= main_~k~0 (+ (* main_~i~0 2) 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3774#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:25,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {3774#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} assume !(~k~0 < ~n~0); {3778#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:25,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {3778#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3778#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:25,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {3778#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} assume !(~j~0 < ~n~0); {3778#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:25,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {3778#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3788#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} is VALID [2022-04-08 09:29:25,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {3788#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3792#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) (div main_~j~0 2))} is VALID [2022-04-08 09:29:25,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {3792#(<= (+ (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; {3650#false} is VALID [2022-04-08 09:29:25,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {3650#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {3650#false} is VALID [2022-04-08 09:29:25,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {3650#false} assume !(~k~0 < ~n~0); {3650#false} is VALID [2022-04-08 09:29:25,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {3650#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3650#false} is VALID [2022-04-08 09:29:25,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {3650#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3650#false} is VALID [2022-04-08 09:29:25,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {3650#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {3650#false} is VALID [2022-04-08 09:29:25,734 INFO L272 TraceCheckUtils]: 43: Hoare triple {3650#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3650#false} is VALID [2022-04-08 09:29:25,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {3650#false} ~cond := #in~cond; {3650#false} is VALID [2022-04-08 09:29:25,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {3650#false} assume !(0 == ~cond); {3650#false} is VALID [2022-04-08 09:29:25,734 INFO L290 TraceCheckUtils]: 46: Hoare triple {3650#false} assume true; {3650#false} is VALID [2022-04-08 09:29:25,734 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {3650#false} {3650#false} #94#return; {3650#false} is VALID [2022-04-08 09:29:25,734 INFO L272 TraceCheckUtils]: 48: Hoare triple {3650#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3650#false} is VALID [2022-04-08 09:29:25,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {3650#false} ~cond := #in~cond; {3650#false} is VALID [2022-04-08 09:29:25,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {3650#false} assume 0 == ~cond; {3650#false} is VALID [2022-04-08 09:29:25,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {3650#false} assume !false; {3650#false} is VALID [2022-04-08 09:29:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 09:29:25,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:29:25,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {3650#false} assume !false; {3650#false} is VALID [2022-04-08 09:29:25,934 INFO L290 TraceCheckUtils]: 50: Hoare triple {3650#false} assume 0 == ~cond; {3650#false} is VALID [2022-04-08 09:29:25,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {3650#false} ~cond := #in~cond; {3650#false} is VALID [2022-04-08 09:29:25,934 INFO L272 TraceCheckUtils]: 48: Hoare triple {3650#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3650#false} is VALID [2022-04-08 09:29:25,934 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {3649#true} {3650#false} #94#return; {3650#false} is VALID [2022-04-08 09:29:25,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {3649#true} assume !(0 == ~cond); {3649#true} is VALID [2022-04-08 09:29:25,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {3649#true} ~cond := #in~cond; {3649#true} is VALID [2022-04-08 09:29:25,934 INFO L272 TraceCheckUtils]: 43: Hoare triple {3650#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3649#true} is VALID [2022-04-08 09:29:25,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {3650#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {3650#false} is VALID [2022-04-08 09:29:25,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {3650#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3650#false} is VALID [2022-04-08 09:29:25,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {3650#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3650#false} is VALID [2022-04-08 09:29:25,935 INFO L290 TraceCheckUtils]: 39: Hoare triple {3650#false} assume !(~k~0 < ~n~0); {3650#false} is VALID [2022-04-08 09:29:25,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {3650#false} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {3650#false} is VALID [2022-04-08 09:29:25,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {3880#(not (< main_~j~0 main_~n~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3650#false} is VALID [2022-04-08 09:29:25,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {3788#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3880#(not (< main_~j~0 main_~n~0))} is VALID [2022-04-08 09:29:25,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {3778#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3788#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} is VALID [2022-04-08 09:29:25,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {3778#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} assume !(~j~0 < ~n~0); {3778#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:25,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {3778#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3778#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:25,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {3774#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} assume !(~k~0 < ~n~0); {3778#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:25,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {3752#(<= main_~k~0 (+ (* main_~i~0 2) 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3774#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-08 09:29:25,938 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3649#true} {3752#(<= main_~k~0 (+ (* main_~i~0 2) 1))} #92#return; {3752#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-08 09:29:25,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {3649#true} assume !(0 == ~cond); {3649#true} is VALID [2022-04-08 09:29:25,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {3649#true} ~cond := #in~cond; {3649#true} is VALID [2022-04-08 09:29:25,938 INFO L272 TraceCheckUtils]: 26: Hoare triple {3752#(<= main_~k~0 (+ (* main_~i~0 2) 1))} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {3649#true} is VALID [2022-04-08 09:29:25,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {3752#(<= main_~k~0 (+ (* main_~i~0 2) 1))} assume !!(~k~0 < ~n~0); {3752#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-08 09:29:25,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {3745#(<= main_~j~0 (+ (* main_~i~0 2) 1))} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {3752#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-08 09:29:25,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {3745#(<= main_~j~0 (+ (* main_~i~0 2) 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3745#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-08 09:29:25,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {3705#(<= main_~j~0 (* main_~i~0 2))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3745#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-08 09:29:25,940 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3649#true} {3705#(<= main_~j~0 (* main_~i~0 2))} #96#return; {3705#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-08 09:29:25,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {3649#true} assume !(0 == ~cond); {3649#true} is VALID [2022-04-08 09:29:25,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {3649#true} ~cond := #in~cond; {3649#true} is VALID [2022-04-08 09:29:25,940 INFO L272 TraceCheckUtils]: 17: Hoare triple {3705#(<= main_~j~0 (* main_~i~0 2))} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3649#true} is VALID [2022-04-08 09:29:25,941 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3649#true} {3705#(<= main_~j~0 (* main_~i~0 2))} #94#return; {3705#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-08 09:29:25,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {3649#true} assume !(0 == ~cond); {3649#true} is VALID [2022-04-08 09:29:25,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {3649#true} ~cond := #in~cond; {3649#true} is VALID [2022-04-08 09:29:25,941 INFO L272 TraceCheckUtils]: 12: Hoare triple {3705#(<= main_~j~0 (* main_~i~0 2))} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3649#true} is VALID [2022-04-08 09:29:25,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {3705#(<= main_~j~0 (* main_~i~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {3705#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-08 09:29:25,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {3705#(<= main_~j~0 (* main_~i~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3705#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-08 09:29:25,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {3649#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3705#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-08 09:29:25,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {3649#true} ~i~0 := 0; {3649#true} is VALID [2022-04-08 09:29:25,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {3649#true} assume ~k~0 == ~n~0; {3649#true} is VALID [2022-04-08 09:29:25,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {3649#true} assume !!(~n~0 < 1000000); {3649#true} is VALID [2022-04-08 09:29:25,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {3649#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; {3649#true} is VALID [2022-04-08 09:29:25,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {3649#true} call #t~ret7 := main(); {3649#true} is VALID [2022-04-08 09:29:25,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3649#true} {3649#true} #98#return; {3649#true} is VALID [2022-04-08 09:29:25,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {3649#true} assume true; {3649#true} is VALID [2022-04-08 09:29:25,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {3649#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); {3649#true} is VALID [2022-04-08 09:29:25,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {3649#true} call ULTIMATE.init(); {3649#true} is VALID [2022-04-08 09:29:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-08 09:29:25,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850675157] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:29:25,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:29:25,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2022-04-08 09:29:25,943 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:25,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2033159542] [2022-04-08 09:29:25,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2033159542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:25,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:25,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:29:25,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713089407] [2022-04-08 09:29:25,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:25,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-04-08 09:29:25,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:25,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 09:29:25,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:25,968 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:29:25,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:25,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:29:25,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-04-08 09:29:25,969 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 09:29:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:26,315 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2022-04-08 09:29:26,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:29:26,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-04-08 09:29:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 09:29:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-08 09:29:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 09:29:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-08 09:29:26,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-08 09:29:26,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:26,353 INFO L225 Difference]: With dead ends: 91 [2022-04-08 09:29:26,353 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:29:26,354 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:29:26,354 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:26,354 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 42 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:29:26,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:29:26,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:29:26,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:26,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:29:26,355 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:29:26,355 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:29:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:26,355 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:29:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:29:26,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:26,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:26,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:29:26,355 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:29:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:26,356 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:29:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:29:26,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:26,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:26,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:26,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:29:26,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:29:26,356 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-04-08 09:29:26,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:26,356 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:29:26,356 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 09:29:26,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:29:26,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:29:26,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:26,358 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:29:26,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 09:29:26,574 WARN L460 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-08 09:29:26,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:29:27,213 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 09:29:27,213 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 09:29:27,214 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 09:29:27,214 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 09:29:27,214 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:29:27,214 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:29:27,214 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:29:27,214 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 48) the Hoare annotation is: true [2022-04-08 09:29:27,214 INFO L878 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-08 09:29:27,214 INFO L885 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-08 09:29:27,214 INFO L878 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-08 09:29:27,214 INFO L878 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-08 09:29:27,214 INFO L878 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-08 09:29:27,214 INFO L878 garLoopResultBuilder]: At program point L37-1(lines 36 38) 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-08 09:29:27,214 INFO L878 garLoopResultBuilder]: At program point L33-2(lines 33 45) 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-08 09:29:27,214 INFO L878 garLoopResultBuilder]: At program point L33-3(lines 33 45) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2022-04-08 09:29:27,214 INFO L885 garLoopResultBuilder]: At program point L29(lines 29 32) the Hoare annotation is: true [2022-04-08 09:29:27,214 INFO L878 garLoopResultBuilder]: At program point L29-1(lines 29 32) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2022-04-08 09:29:27,214 INFO L885 garLoopResultBuilder]: At program point L46(lines 24 48) the Hoare annotation is: true [2022-04-08 09:29:27,214 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 48) the Hoare annotation is: true [2022-04-08 09:29:27,215 INFO L878 garLoopResultBuilder]: At program point L42(lines 34 44) 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-08 09:29:27,215 INFO L878 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-08 09:29:27,215 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 48) the Hoare annotation is: true [2022-04-08 09:29:27,215 INFO L878 garLoopResultBuilder]: At program point L35(lines 35 43) 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-08 09:29:27,215 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:29:27,215 INFO L878 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-08 09:29:27,215 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:29:27,215 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:29:27,215 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:29:27,215 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:29:27,215 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:29:27,215 INFO L878 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:29:27,215 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 09:29:27,215 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:29:27,215 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:29:27,215 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:29:27,215 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:29:27,217 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 09:29:27,218 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:29:27,224 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:29:27,224 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:29:27,226 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 09:29:27,227 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:29:27,227 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:29:27,227 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:29:27,227 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 09:29:27,237 INFO L163 areAnnotationChecker]: CFG has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:29:27,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:29:27 BoogieIcfgContainer [2022-04-08 09:29:27,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:29:27,252 INFO L158 Benchmark]: Toolchain (without parser) took 12096.07ms. Allocated memory was 223.3MB in the beginning and 342.9MB in the end (delta: 119.5MB). Free memory was 170.8MB in the beginning and 227.0MB in the end (delta: -56.3MB). Peak memory consumption was 174.1MB. Max. memory is 8.0GB. [2022-04-08 09:29:27,252 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 223.3MB. Free memory is still 187.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:29:27,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.48ms. Allocated memory was 223.3MB in the beginning and 285.2MB in the end (delta: 61.9MB). Free memory was 170.6MB in the beginning and 258.3MB in the end (delta: -87.6MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-04-08 09:29:27,253 INFO L158 Benchmark]: Boogie Preprocessor took 38.31ms. Allocated memory is still 285.2MB. Free memory was 258.3MB in the beginning and 256.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:29:27,253 INFO L158 Benchmark]: RCFGBuilder took 326.08ms. Allocated memory is still 285.2MB. Free memory was 256.3MB in the beginning and 244.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 09:29:27,253 INFO L158 Benchmark]: TraceAbstraction took 11408.72ms. Allocated memory was 285.2MB in the beginning and 342.9MB in the end (delta: 57.7MB). Free memory was 243.7MB in the beginning and 227.0MB in the end (delta: 16.6MB). Peak memory consumption was 185.9MB. Max. memory is 8.0GB. [2022-04-08 09:29:27,254 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.11ms. Allocated memory is still 223.3MB. Free memory is still 187.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 318.48ms. Allocated memory was 223.3MB in the beginning and 285.2MB in the end (delta: 61.9MB). Free memory was 170.6MB in the beginning and 258.3MB in the end (delta: -87.6MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.31ms. Allocated memory is still 285.2MB. Free memory was 258.3MB in the beginning and 256.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 326.08ms. Allocated memory is still 285.2MB. Free memory was 256.3MB in the beginning and 244.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 11408.72ms. Allocated memory was 285.2MB in the beginning and 342.9MB in the end (delta: 57.7MB). Free memory was 243.7MB in the beginning and 227.0MB in the end (delta: 16.6MB). Peak memory consumption was 185.9MB. 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: 11.3s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 319 mSDsluCounter, 404 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1009 IncrementalHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 217 mSolverCounterUnsat, 190 mSDtfsCounter, 1009 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 485 GetRequests, 363 SyntacticMatches, 5 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=7, InterpolantAutomatonStates: 63, 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, 69 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 258 PreInvPairs, 338 NumberOfFragments, 217 HoareAnnotationTreeSize, 258 FomulaSimplifications, -21 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 30 FomulaSimplificationsInter, 13069 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 <= 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 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-08 09:29:27,279 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...