/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:30:35,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:30:35,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:30:35,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:30:35,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:30:35,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:30:35,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:30:35,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:30:35,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:30:35,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:30:35,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:30:35,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:30:35,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:30:35,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:30:35,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:30:35,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:30:35,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:30:35,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:30:35,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:30:35,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:30:35,539 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:30:35,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:30:35,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:30:35,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:30:35,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:30:35,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:30:35,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:30:35,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:30:35,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:30:35,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:30:35,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:30:35,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:30:35,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:30:35,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:30:35,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:30:35,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:30:35,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:30:35,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:30:35,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:30:35,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:30:35,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:30:35,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:30:35,551 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:30:35,558 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:30:35,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:30:35,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:30:35,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:30:35,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:30:35,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:30:35,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:30:35,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:30:35,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:30:35,560 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:30:35,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:30:35,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:30:35,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:30:35,561 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:30:35,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:30:35,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:30:35,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:30:35,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:30:35,561 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:30:35,561 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:30:35,561 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:30:35,561 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:30:35,561 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:30:35,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:30:35,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:30:35,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:30:35,766 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:30:35,770 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:30:35,771 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2022-04-15 12:30:35,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b00ba152/9a4d85079faf40788cf7b86aa339a42c/FLAG81f834f08 [2022-04-15 12:30:36,175 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:30:36,176 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2022-04-15 12:30:36,181 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b00ba152/9a4d85079faf40788cf7b86aa339a42c/FLAG81f834f08 [2022-04-15 12:30:36,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b00ba152/9a4d85079faf40788cf7b86aa339a42c [2022-04-15 12:30:36,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:30:36,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:30:36,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:30:36,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:30:36,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:30:36,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:30:36" (1/1) ... [2022-04-15 12:30:36,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c815b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:36, skipping insertion in model container [2022-04-15 12:30:36,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:30:36" (1/1) ... [2022-04-15 12:30:36,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:30:36,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:30:36,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i[893,906] [2022-04-15 12:30:36,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:30:36,431 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:30:36,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i[893,906] [2022-04-15 12:30:36,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:30:36,470 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:30:36,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:36 WrapperNode [2022-04-15 12:30:36,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:30:36,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:30:36,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:30:36,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:30:36,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:36" (1/1) ... [2022-04-15 12:30:36,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:36" (1/1) ... [2022-04-15 12:30:36,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:36" (1/1) ... [2022-04-15 12:30:36,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:36" (1/1) ... [2022-04-15 12:30:36,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:36" (1/1) ... [2022-04-15 12:30:36,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:36" (1/1) ... [2022-04-15 12:30:36,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:36" (1/1) ... [2022-04-15 12:30:36,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:30:36,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:30:36,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:30:36,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:30:36,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:36" (1/1) ... [2022-04-15 12:30:36,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:30:36,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:30:36,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:30:36,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:30:36,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:30:36,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:30:36,564 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:30:36,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:30:36,565 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:30:36,565 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:30:36,565 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:30:36,565 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:30:36,565 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:30:36,565 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:30:36,565 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:30:36,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:30:36,566 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:30:36,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:30:36,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:30:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:30:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:30:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:30:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:30:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:30:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:30:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:30:36,628 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:30:36,630 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:30:36,839 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:30:36,844 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:30:36,845 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 12:30:36,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:30:36 BoogieIcfgContainer [2022-04-15 12:30:36,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:30:36,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:30:36,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:30:36,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:30:36,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:30:36" (1/3) ... [2022-04-15 12:30:36,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d0a9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:30:36, skipping insertion in model container [2022-04-15 12:30:36,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:36" (2/3) ... [2022-04-15 12:30:36,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d0a9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:30:36, skipping insertion in model container [2022-04-15 12:30:36,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:30:36" (3/3) ... [2022-04-15 12:30:36,852 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2022-04-15 12:30:36,856 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:30:36,856 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:30:36,893 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:30:36,899 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:30:36,899 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:30:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 12:30:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:30:36,924 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:36,924 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:36,925 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:36,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:36,929 INFO L85 PathProgramCache]: Analyzing trace with hash -250128701, now seen corresponding path program 1 times [2022-04-15 12:30:36,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:36,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1474691437] [2022-04-15 12:30:36,945 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:30:36,945 INFO L85 PathProgramCache]: Analyzing trace with hash -250128701, now seen corresponding path program 2 times [2022-04-15 12:30:36,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:36,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500039476] [2022-04-15 12:30:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:36,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:37,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:37,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {55#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {47#true} is VALID [2022-04-15 12:30:37,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2022-04-15 12:30:37,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #138#return; {47#true} is VALID [2022-04-15 12:30:37,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {55#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:37,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {55#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {47#true} is VALID [2022-04-15 12:30:37,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2022-04-15 12:30:37,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #138#return; {47#true} is VALID [2022-04-15 12:30:37,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {47#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {47#true} is VALID [2022-04-15 12:30:37,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {47#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {47#true} is VALID [2022-04-15 12:30:37,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {47#true} is VALID [2022-04-15 12:30:37,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {47#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {47#true} is VALID [2022-04-15 12:30:37,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {47#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {52#(<= 1 main_~r~0)} is VALID [2022-04-15 12:30:37,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {52#(<= 1 main_~r~0)} assume !(~j~0 <= ~r~0); {52#(<= 1 main_~r~0)} is VALID [2022-04-15 12:30:37,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {52#(<= 1 main_~r~0)} assume !(~l~0 > 1); {52#(<= 1 main_~r~0)} is VALID [2022-04-15 12:30:37,195 INFO L272 TraceCheckUtils]: 11: Hoare triple {52#(<= 1 main_~r~0)} call __VERIFIER_assert((if 1 <= ~r~0 then 1 else 0)); {53#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:30:37,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {53#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {54#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:30:37,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {54#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {48#false} is VALID [2022-04-15 12:30:37,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {48#false} assume !false; {48#false} is VALID [2022-04-15 12:30:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:30:37,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:37,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500039476] [2022-04-15 12:30:37,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500039476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:37,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:37,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:30:37,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:37,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1474691437] [2022-04-15 12:30:37,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1474691437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:37,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:37,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:30:37,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225661298] [2022-04-15 12:30:37,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:37,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:30:37,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:37,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:37,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:37,222 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:30:37,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:37,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:30:37,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:30:37,237 INFO L87 Difference]: Start difference. First operand has 44 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:37,913 INFO L93 Difference]: Finished difference Result 88 states and 148 transitions. [2022-04-15 12:30:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:30:37,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:30:37,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-15 12:30:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-15 12:30:37,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 148 transitions. [2022-04-15 12:30:38,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:38,084 INFO L225 Difference]: With dead ends: 88 [2022-04-15 12:30:38,085 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 12:30:38,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:30:38,089 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:38,090 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 63 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:30:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 12:30:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-15 12:30:38,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:38,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:30:38,138 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:30:38,139 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:30:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:38,147 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-04-15 12:30:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-15 12:30:38,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:38,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:38,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 44 states. [2022-04-15 12:30:38,150 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 44 states. [2022-04-15 12:30:38,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:38,156 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-04-15 12:30:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-15 12:30:38,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:38,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:38,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:38,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:30:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-15 12:30:38,172 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 15 [2022-04-15 12:30:38,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:38,175 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-15 12:30:38,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:38,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 61 transitions. [2022-04-15 12:30:38,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-15 12:30:38,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:30:38,238 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:38,238 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:38,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:30:38,239 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:38,239 INFO L85 PathProgramCache]: Analyzing trace with hash -254865470, now seen corresponding path program 1 times [2022-04-15 12:30:38,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:38,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1477502424] [2022-04-15 12:30:38,240 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:30:38,240 INFO L85 PathProgramCache]: Analyzing trace with hash -254865470, now seen corresponding path program 2 times [2022-04-15 12:30:38,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:38,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448750499] [2022-04-15 12:30:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:38,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:38,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:38,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {417#true} is VALID [2022-04-15 12:30:38,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-15 12:30:38,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {417#true} {417#true} #138#return; {417#true} is VALID [2022-04-15 12:30:38,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:38,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {417#true} is VALID [2022-04-15 12:30:38,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-15 12:30:38,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #138#return; {417#true} is VALID [2022-04-15 12:30:38,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {417#true} is VALID [2022-04-15 12:30:38,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {417#true} is VALID [2022-04-15 12:30:38,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {417#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {417#true} is VALID [2022-04-15 12:30:38,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {417#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {417#true} is VALID [2022-04-15 12:30:38,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {417#true} is VALID [2022-04-15 12:30:38,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#true} assume !(~j~0 <= ~r~0); {417#true} is VALID [2022-04-15 12:30:38,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {417#true} assume ~l~0 > 1; {422#(<= 1 main_~l~0)} is VALID [2022-04-15 12:30:38,350 INFO L272 TraceCheckUtils]: 11: Hoare triple {422#(<= 1 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {423#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:30:38,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {423#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {424#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:30:38,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {418#false} is VALID [2022-04-15 12:30:38,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-15 12:30:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:30:38,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:38,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448750499] [2022-04-15 12:30:38,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448750499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:38,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:38,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:30:38,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:38,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1477502424] [2022-04-15 12:30:38,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1477502424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:38,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:38,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:30:38,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21885652] [2022-04-15 12:30:38,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:38,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:30:38,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:38,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:38,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:38,367 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:30:38,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:38,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:30:38,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:30:38,368 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:38,983 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2022-04-15 12:30:38,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:30:38,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:30:38,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:38,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-15 12:30:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-15 12:30:38,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 102 transitions. [2022-04-15 12:30:39,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:39,097 INFO L225 Difference]: With dead ends: 71 [2022-04-15 12:30:39,097 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 12:30:39,098 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:30:39,100 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:39,101 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 56 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:30:39,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 12:30:39,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2022-04-15 12:30:39,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:39,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:30:39,135 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:30:39,136 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:30:39,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:39,139 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2022-04-15 12:30:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2022-04-15 12:30:39,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:39,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:39,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 69 states. [2022-04-15 12:30:39,141 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 69 states. [2022-04-15 12:30:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:39,144 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2022-04-15 12:30:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2022-04-15 12:30:39,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:39,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:39,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:39,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:39,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:30:39,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-15 12:30:39,147 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 15 [2022-04-15 12:30:39,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:39,147 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-15 12:30:39,147 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:39,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 64 transitions. [2022-04-15 12:30:39,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:39,207 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-15 12:30:39,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:30:39,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:39,208 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:39,208 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:30:39,208 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:39,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:39,208 INFO L85 PathProgramCache]: Analyzing trace with hash -216435080, now seen corresponding path program 1 times [2022-04-15 12:30:39,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:39,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [822044192] [2022-04-15 12:30:39,209 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:30:39,209 INFO L85 PathProgramCache]: Analyzing trace with hash -216435080, now seen corresponding path program 2 times [2022-04-15 12:30:39,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:39,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493062329] [2022-04-15 12:30:39,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:39,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:39,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:39,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {811#true} is VALID [2022-04-15 12:30:39,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {811#true} assume true; {811#true} is VALID [2022-04-15 12:30:39,286 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {811#true} {811#true} #138#return; {811#true} is VALID [2022-04-15 12:30:39,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {811#true} call ULTIMATE.init(); {820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:39,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {811#true} is VALID [2022-04-15 12:30:39,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {811#true} assume true; {811#true} is VALID [2022-04-15 12:30:39,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {811#true} {811#true} #138#return; {811#true} is VALID [2022-04-15 12:30:39,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {811#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {811#true} is VALID [2022-04-15 12:30:39,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {811#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {811#true} is VALID [2022-04-15 12:30:39,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {811#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {811#true} is VALID [2022-04-15 12:30:39,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {811#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {811#true} is VALID [2022-04-15 12:30:39,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {811#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {816#(<= 2 main_~r~0)} is VALID [2022-04-15 12:30:39,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {816#(<= 2 main_~r~0)} assume !!(~j~0 <= ~r~0); {816#(<= 2 main_~r~0)} is VALID [2022-04-15 12:30:39,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {816#(<= 2 main_~r~0)} assume !(~j~0 < ~r~0); {817#(<= 2 main_~j~0)} is VALID [2022-04-15 12:30:39,293 INFO L272 TraceCheckUtils]: 11: Hoare triple {817#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {818#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:30:39,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {818#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {819#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:30:39,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {819#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {812#false} is VALID [2022-04-15 12:30:39,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {812#false} assume !false; {812#false} is VALID [2022-04-15 12:30:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:30:39,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:39,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493062329] [2022-04-15 12:30:39,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493062329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:39,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:39,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:30:39,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:39,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [822044192] [2022-04-15 12:30:39,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [822044192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:39,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:39,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:30:39,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630327824] [2022-04-15 12:30:39,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:39,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:30:39,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:39,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:39,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:39,306 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:30:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:39,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:30:39,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:30:39,307 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:40,117 INFO L93 Difference]: Finished difference Result 80 states and 115 transitions. [2022-04-15 12:30:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:30:40,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:30:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:40,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-15 12:30:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-15 12:30:40,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2022-04-15 12:30:40,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:40,223 INFO L225 Difference]: With dead ends: 80 [2022-04-15 12:30:40,223 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 12:30:40,223 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:30:40,224 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 68 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:40,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 65 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:30:40,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 12:30:40,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2022-04-15 12:30:40,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:40,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 12:30:40,310 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 12:30:40,311 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 12:30:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:40,334 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2022-04-15 12:30:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2022-04-15 12:30:40,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:40,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:40,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 78 states. [2022-04-15 12:30:40,336 INFO L87 Difference]: Start difference. First operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 78 states. [2022-04-15 12:30:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:40,338 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2022-04-15 12:30:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2022-04-15 12:30:40,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:40,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:40,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:40,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 12:30:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2022-04-15 12:30:40,342 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 15 [2022-04-15 12:30:40,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:40,342 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2022-04-15 12:30:40,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:40,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 98 transitions. [2022-04-15 12:30:40,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:40,447 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2022-04-15 12:30:40,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:30:40,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:40,448 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:40,448 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:30:40,448 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:40,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:40,449 INFO L85 PathProgramCache]: Analyzing trace with hash -228679181, now seen corresponding path program 1 times [2022-04-15 12:30:40,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:40,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [546005585] [2022-04-15 12:30:40,449 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:30:40,449 INFO L85 PathProgramCache]: Analyzing trace with hash -228679181, now seen corresponding path program 2 times [2022-04-15 12:30:40,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:40,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783678969] [2022-04-15 12:30:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:40,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:40,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:40,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {1296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1287#true} is VALID [2022-04-15 12:30:40,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {1287#true} assume true; {1287#true} is VALID [2022-04-15 12:30:40,495 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1287#true} {1287#true} #138#return; {1287#true} is VALID [2022-04-15 12:30:40,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {1287#true} call ULTIMATE.init(); {1296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:40,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {1296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1287#true} is VALID [2022-04-15 12:30:40,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {1287#true} assume true; {1287#true} is VALID [2022-04-15 12:30:40,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1287#true} {1287#true} #138#return; {1287#true} is VALID [2022-04-15 12:30:40,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {1287#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {1287#true} is VALID [2022-04-15 12:30:40,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {1287#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1287#true} is VALID [2022-04-15 12:30:40,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {1287#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {1287#true} is VALID [2022-04-15 12:30:40,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {1287#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {1292#(<= 1 main_~l~0)} is VALID [2022-04-15 12:30:40,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {1292#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {1293#(<= 2 main_~j~0)} is VALID [2022-04-15 12:30:40,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {1293#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {1293#(<= 2 main_~j~0)} is VALID [2022-04-15 12:30:40,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {1293#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {1293#(<= 2 main_~j~0)} is VALID [2022-04-15 12:30:40,502 INFO L272 TraceCheckUtils]: 11: Hoare triple {1293#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {1294#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:30:40,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {1294#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1295#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:30:40,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {1295#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1288#false} is VALID [2022-04-15 12:30:40,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {1288#false} assume !false; {1288#false} is VALID [2022-04-15 12:30:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:30:40,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:40,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783678969] [2022-04-15 12:30:40,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783678969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:40,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:40,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:30:40,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:40,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [546005585] [2022-04-15 12:30:40,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [546005585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:40,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:40,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:30:40,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507145018] [2022-04-15 12:30:40,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:40,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:30:40,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:40,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:40,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:40,519 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:30:40,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:40,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:30:40,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:30:40,521 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:41,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:41,343 INFO L93 Difference]: Finished difference Result 122 states and 183 transitions. [2022-04-15 12:30:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:30:41,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:30:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-15 12:30:41,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-15 12:30:41,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2022-04-15 12:30:41,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:41,434 INFO L225 Difference]: With dead ends: 122 [2022-04-15 12:30:41,434 INFO L226 Difference]: Without dead ends: 120 [2022-04-15 12:30:41,435 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:30:41,435 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 65 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:41,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 56 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:30:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-15 12:30:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2022-04-15 12:30:41,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:41,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 12:30:41,560 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 12:30:41,560 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 12:30:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:41,567 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2022-04-15 12:30:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2022-04-15 12:30:41,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:41,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:41,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 120 states. [2022-04-15 12:30:41,571 INFO L87 Difference]: Start difference. First operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 120 states. [2022-04-15 12:30:41,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:41,578 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2022-04-15 12:30:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2022-04-15 12:30:41,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:41,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:41,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:41,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 12:30:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2022-04-15 12:30:41,583 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 15 [2022-04-15 12:30:41,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:41,583 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2022-04-15 12:30:41,583 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:41,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 140 transitions. [2022-04-15 12:30:41,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:41,704 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2022-04-15 12:30:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:30:41,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:41,705 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:41,705 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:30:41,705 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:41,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1266022048, now seen corresponding path program 1 times [2022-04-15 12:30:41,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:41,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2068530181] [2022-04-15 12:30:41,706 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:30:41,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1266022048, now seen corresponding path program 2 times [2022-04-15 12:30:41,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:41,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067042896] [2022-04-15 12:30:41,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:41,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:41,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:41,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {1996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1984#true} is VALID [2022-04-15 12:30:41,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-15 12:30:41,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1984#true} {1984#true} #138#return; {1984#true} is VALID [2022-04-15 12:30:41,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 12:30:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:41,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {1984#true} ~cond := #in~cond; {1984#true} is VALID [2022-04-15 12:30:41,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {1984#true} assume !(0 == ~cond); {1984#true} is VALID [2022-04-15 12:30:41,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-15 12:30:41,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1984#true} {1989#(<= main_~r~0 main_~n~0)} #134#return; {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:30:41,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {1984#true} call ULTIMATE.init(); {1996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:41,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {1996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1984#true} is VALID [2022-04-15 12:30:41,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-15 12:30:41,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1984#true} {1984#true} #138#return; {1984#true} is VALID [2022-04-15 12:30:41,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {1984#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {1984#true} is VALID [2022-04-15 12:30:41,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {1984#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1984#true} is VALID [2022-04-15 12:30:41,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {1984#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:30:41,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {1989#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:30:41,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {1989#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:30:41,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {1989#(<= main_~r~0 main_~n~0)} assume !(~j~0 <= ~r~0); {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:30:41,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {1989#(<= main_~r~0 main_~n~0)} assume !(~l~0 > 1); {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:30:41,756 INFO L272 TraceCheckUtils]: 11: Hoare triple {1989#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~r~0 then 1 else 0)); {1984#true} is VALID [2022-04-15 12:30:41,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {1984#true} ~cond := #in~cond; {1984#true} is VALID [2022-04-15 12:30:41,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {1984#true} assume !(0 == ~cond); {1984#true} is VALID [2022-04-15 12:30:41,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-15 12:30:41,757 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1984#true} {1989#(<= main_~r~0 main_~n~0)} #134#return; {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:30:41,758 INFO L272 TraceCheckUtils]: 16: Hoare triple {1989#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if ~r~0 <= ~n~0 then 1 else 0)); {1994#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:30:41,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {1994#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1995#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:30:41,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {1995#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1985#false} is VALID [2022-04-15 12:30:41,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {1985#false} assume !false; {1985#false} is VALID [2022-04-15 12:30:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:30:41,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:41,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067042896] [2022-04-15 12:30:41,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067042896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:41,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:41,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:30:41,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:41,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2068530181] [2022-04-15 12:30:41,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2068530181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:41,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:41,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:30:41,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985742139] [2022-04-15 12:30:41,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:41,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 12:30:41,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:41,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:41,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:41,771 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:30:41,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:41,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:30:41,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:30:41,772 INFO L87 Difference]: Start difference. First operand 94 states and 140 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:42,263 INFO L93 Difference]: Finished difference Result 100 states and 145 transitions. [2022-04-15 12:30:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:30:42,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 12:30:42,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-15 12:30:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-15 12:30:42,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-15 12:30:42,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:42,318 INFO L225 Difference]: With dead ends: 100 [2022-04-15 12:30:42,318 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 12:30:42,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:30:42,319 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 39 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:42,319 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 55 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:30:42,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 12:30:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-04-15 12:30:42,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:42,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 12:30:42,437 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 12:30:42,437 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 12:30:42,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:42,441 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-15 12:30:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-15 12:30:42,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:42,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:42,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 98 states. [2022-04-15 12:30:42,444 INFO L87 Difference]: Start difference. First operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 98 states. [2022-04-15 12:30:42,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:42,448 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-15 12:30:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-15 12:30:42,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:42,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:42,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:42,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 12:30:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2022-04-15 12:30:42,454 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 20 [2022-04-15 12:30:42,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:42,455 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2022-04-15 12:30:42,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:42,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 143 transitions. [2022-04-15 12:30:42,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-15 12:30:42,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:30:42,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:42,612 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:42,612 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 12:30:42,612 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:42,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:42,612 INFO L85 PathProgramCache]: Analyzing trace with hash 884659585, now seen corresponding path program 1 times [2022-04-15 12:30:42,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:42,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1836086271] [2022-04-15 12:30:42,613 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:30:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash 884659585, now seen corresponding path program 2 times [2022-04-15 12:30:42,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:42,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193456004] [2022-04-15 12:30:42,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:42,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:42,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:42,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {2613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2599#true} is VALID [2022-04-15 12:30:42,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-15 12:30:42,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2599#true} {2599#true} #138#return; {2599#true} is VALID [2022-04-15 12:30:42,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 12:30:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:42,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2022-04-15 12:30:42,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2022-04-15 12:30:42,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-15 12:30:42,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2599#true} {2606#(<= (+ main_~l~0 1) main_~n~0)} #130#return; {2606#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-15 12:30:42,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {2599#true} call ULTIMATE.init(); {2613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:42,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {2613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2599#true} is VALID [2022-04-15 12:30:42,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-15 12:30:42,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2599#true} {2599#true} #138#return; {2599#true} is VALID [2022-04-15 12:30:42,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {2599#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {2599#true} is VALID [2022-04-15 12:30:42,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {2599#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2599#true} is VALID [2022-04-15 12:30:42,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {2599#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {2604#(<= (+ (* main_~l~0 2) main_~r~0) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-15 12:30:42,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {2604#(<= (+ (* main_~l~0 2) main_~r~0) (+ 2 (* main_~n~0 2)))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {2605#(<= (+ (* main_~l~0 2) main_~r~0) (* main_~n~0 2))} is VALID [2022-04-15 12:30:42,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {2605#(<= (+ (* main_~l~0 2) main_~r~0) (* main_~n~0 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {2606#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-15 12:30:42,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {2606#(<= (+ main_~l~0 1) main_~n~0)} assume !(~j~0 <= ~r~0); {2606#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-15 12:30:42,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {2606#(<= (+ main_~l~0 1) main_~n~0)} assume ~l~0 > 1; {2606#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-15 12:30:42,699 INFO L272 TraceCheckUtils]: 11: Hoare triple {2606#(<= (+ main_~l~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {2599#true} is VALID [2022-04-15 12:30:42,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2022-04-15 12:30:42,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2022-04-15 12:30:42,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-15 12:30:42,700 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2599#true} {2606#(<= (+ main_~l~0 1) main_~n~0)} #130#return; {2606#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-15 12:30:42,701 INFO L272 TraceCheckUtils]: 16: Hoare triple {2606#(<= (+ main_~l~0 1) main_~n~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {2611#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:30:42,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {2611#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2612#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:30:42,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {2612#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2600#false} is VALID [2022-04-15 12:30:42,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {2600#false} assume !false; {2600#false} is VALID [2022-04-15 12:30:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:30:42,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:42,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193456004] [2022-04-15 12:30:42,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193456004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:42,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:42,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:30:42,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:42,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1836086271] [2022-04-15 12:30:42,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1836086271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:42,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:42,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:30:42,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570130910] [2022-04-15 12:30:42,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:42,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 12:30:42,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:42,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:42,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:42,720 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:30:42,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:42,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:30:42,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:30:42,721 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:43,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:43,942 INFO L93 Difference]: Finished difference Result 131 states and 194 transitions. [2022-04-15 12:30:43,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:30:43,943 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 12:30:43,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-15 12:30:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-15 12:30:43,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-15 12:30:44,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:44,057 INFO L225 Difference]: With dead ends: 131 [2022-04-15 12:30:44,057 INFO L226 Difference]: Without dead ends: 129 [2022-04-15 12:30:44,058 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:30:44,060 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 92 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:44,061 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 59 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:30:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-15 12:30:44,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2022-04-15 12:30:44,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:44,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-15 12:30:44,356 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-15 12:30:44,357 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-15 12:30:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:44,363 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2022-04-15 12:30:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2022-04-15 12:30:44,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:44,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:44,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 129 states. [2022-04-15 12:30:44,364 INFO L87 Difference]: Start difference. First operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 129 states. [2022-04-15 12:30:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:44,368 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2022-04-15 12:30:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2022-04-15 12:30:44,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:44,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:44,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:44,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-15 12:30:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 189 transitions. [2022-04-15 12:30:44,373 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 189 transitions. Word has length 20 [2022-04-15 12:30:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:44,373 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 189 transitions. [2022-04-15 12:30:44,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:44,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 189 transitions. [2022-04-15 12:30:44,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:44,577 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 189 transitions. [2022-04-15 12:30:44,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:30:44,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:44,578 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:44,578 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:30:44,578 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:44,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1424204299, now seen corresponding path program 1 times [2022-04-15 12:30:44,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:44,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1631692597] [2022-04-15 12:30:44,579 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:30:44,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1424204299, now seen corresponding path program 2 times [2022-04-15 12:30:44,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:44,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153955745] [2022-04-15 12:30:44,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:44,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:44,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:44,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {3413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3400#true} is VALID [2022-04-15 12:30:44,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-15 12:30:44,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3400#true} {3400#true} #138#return; {3400#true} is VALID [2022-04-15 12:30:44,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 12:30:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:44,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {3400#true} ~cond := #in~cond; {3400#true} is VALID [2022-04-15 12:30:44,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {3400#true} assume !(0 == ~cond); {3400#true} is VALID [2022-04-15 12:30:44,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-15 12:30:44,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3400#true} {3406#(<= main_~j~0 main_~n~0)} #118#return; {3406#(<= main_~j~0 main_~n~0)} is VALID [2022-04-15 12:30:44,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {3400#true} call ULTIMATE.init(); {3413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:44,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {3413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3400#true} is VALID [2022-04-15 12:30:44,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-15 12:30:44,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3400#true} {3400#true} #138#return; {3400#true} is VALID [2022-04-15 12:30:44,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {3400#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {3400#true} is VALID [2022-04-15 12:30:44,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {3400#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3400#true} is VALID [2022-04-15 12:30:44,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {3400#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {3405#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:30:44,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {3405#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {3405#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:30:44,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {3405#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {3405#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:30:44,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {3405#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {3406#(<= main_~j~0 main_~n~0)} is VALID [2022-04-15 12:30:44,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {3406#(<= main_~j~0 main_~n~0)} assume !(~j~0 < ~r~0); {3406#(<= main_~j~0 main_~n~0)} is VALID [2022-04-15 12:30:44,649 INFO L272 TraceCheckUtils]: 11: Hoare triple {3406#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {3400#true} is VALID [2022-04-15 12:30:44,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {3400#true} ~cond := #in~cond; {3400#true} is VALID [2022-04-15 12:30:44,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {3400#true} assume !(0 == ~cond); {3400#true} is VALID [2022-04-15 12:30:44,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-15 12:30:44,650 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3400#true} {3406#(<= main_~j~0 main_~n~0)} #118#return; {3406#(<= main_~j~0 main_~n~0)} is VALID [2022-04-15 12:30:44,651 INFO L272 TraceCheckUtils]: 16: Hoare triple {3406#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {3411#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:30:44,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {3411#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3412#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:30:44,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {3412#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3401#false} is VALID [2022-04-15 12:30:44,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {3401#false} assume !false; {3401#false} is VALID [2022-04-15 12:30:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:30:44,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:44,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153955745] [2022-04-15 12:30:44,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153955745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:44,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:44,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:30:44,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:44,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1631692597] [2022-04-15 12:30:44,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1631692597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:44,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:44,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:30:44,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311968776] [2022-04-15 12:30:44,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:44,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 12:30:44,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:44,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:44,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:44,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:30:44,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:44,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:30:44,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:30:44,664 INFO L87 Difference]: Start difference. First operand 126 states and 189 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:45,824 INFO L93 Difference]: Finished difference Result 188 states and 291 transitions. [2022-04-15 12:30:45,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:30:45,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 12:30:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-15 12:30:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-15 12:30:45,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-15 12:30:45,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:45,910 INFO L225 Difference]: With dead ends: 188 [2022-04-15 12:30:45,910 INFO L226 Difference]: Without dead ends: 186 [2022-04-15 12:30:45,911 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:30:45,912 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:45,912 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:30:45,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-15 12:30:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2022-04-15 12:30:46,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:46,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-15 12:30:46,302 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-15 12:30:46,303 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-15 12:30:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:46,309 INFO L93 Difference]: Finished difference Result 186 states and 289 transitions. [2022-04-15 12:30:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2022-04-15 12:30:46,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:46,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:46,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) Second operand 186 states. [2022-04-15 12:30:46,311 INFO L87 Difference]: Start difference. First operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) Second operand 186 states. [2022-04-15 12:30:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:46,317 INFO L93 Difference]: Finished difference Result 186 states and 289 transitions. [2022-04-15 12:30:46,317 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2022-04-15 12:30:46,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:46,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:46,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:46,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:46,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-15 12:30:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 252 transitions. [2022-04-15 12:30:46,324 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 252 transitions. Word has length 20 [2022-04-15 12:30:46,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:46,324 INFO L478 AbstractCegarLoop]: Abstraction has 162 states and 252 transitions. [2022-04-15 12:30:46,324 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:46,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 162 states and 252 transitions. [2022-04-15 12:30:46,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 252 transitions. [2022-04-15 12:30:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:30:46,607 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:46,607 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:46,608 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 12:30:46,608 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:46,608 INFO L85 PathProgramCache]: Analyzing trace with hash 297853571, now seen corresponding path program 1 times [2022-04-15 12:30:46,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:46,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1121329678] [2022-04-15 12:30:46,609 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:30:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash 297853571, now seen corresponding path program 2 times [2022-04-15 12:30:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:46,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879136909] [2022-04-15 12:30:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:46,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:46,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:46,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {4508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4498#true} is VALID [2022-04-15 12:30:46,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-15 12:30:46,638 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4498#true} {4498#true} #138#return; {4498#true} is VALID [2022-04-15 12:30:46,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 12:30:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:46,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-15 12:30:46,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-15 12:30:46,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-15 12:30:46,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4498#true} {4499#false} #130#return; {4499#false} is VALID [2022-04-15 12:30:46,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {4498#true} call ULTIMATE.init(); {4508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:46,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {4508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4498#true} is VALID [2022-04-15 12:30:46,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-15 12:30:46,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4498#true} {4498#true} #138#return; {4498#true} is VALID [2022-04-15 12:30:46,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {4498#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {4498#true} is VALID [2022-04-15 12:30:46,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {4498#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4498#true} is VALID [2022-04-15 12:30:46,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {4498#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {4498#true} is VALID [2022-04-15 12:30:46,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {4498#true} assume !(~l~0 > 1);#t~post3 := ~r~0;~r~0 := #t~post3 - 1;havoc #t~post3; {4503#(<= main_~l~0 1)} is VALID [2022-04-15 12:30:46,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {4503#(<= main_~l~0 1)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {4503#(<= main_~l~0 1)} is VALID [2022-04-15 12:30:46,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {4503#(<= main_~l~0 1)} assume !(~j~0 <= ~r~0); {4503#(<= main_~l~0 1)} is VALID [2022-04-15 12:30:46,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {4503#(<= main_~l~0 1)} assume ~l~0 > 1; {4499#false} is VALID [2022-04-15 12:30:46,646 INFO L272 TraceCheckUtils]: 11: Hoare triple {4499#false} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {4498#true} is VALID [2022-04-15 12:30:46,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-15 12:30:46,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-15 12:30:46,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-15 12:30:46,646 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4498#true} {4499#false} #130#return; {4499#false} is VALID [2022-04-15 12:30:46,646 INFO L272 TraceCheckUtils]: 16: Hoare triple {4499#false} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {4499#false} is VALID [2022-04-15 12:30:46,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {4499#false} ~cond := #in~cond; {4499#false} is VALID [2022-04-15 12:30:46,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {4499#false} assume 0 == ~cond; {4499#false} is VALID [2022-04-15 12:30:46,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {4499#false} assume !false; {4499#false} is VALID [2022-04-15 12:30:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:30:46,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:46,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879136909] [2022-04-15 12:30:46,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879136909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:46,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:46,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:30:46,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:46,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1121329678] [2022-04-15 12:30:46,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1121329678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:46,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:46,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:30:46,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496511662] [2022-04-15 12:30:46,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:46,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 12:30:46,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:46,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:46,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:46,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:30:46,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:46,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:30:46,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:30:46,659 INFO L87 Difference]: Start difference. First operand 162 states and 252 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:47,558 INFO L93 Difference]: Finished difference Result 329 states and 524 transitions. [2022-04-15 12:30:47,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:30:47,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 12:30:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-15 12:30:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-15 12:30:47,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-15 12:30:47,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:47,670 INFO L225 Difference]: With dead ends: 329 [2022-04-15 12:30:47,670 INFO L226 Difference]: Without dead ends: 239 [2022-04-15 12:30:47,671 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:30:47,671 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:47,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 66 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:30:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-15 12:30:48,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 209. [2022-04-15 12:30:48,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:48,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-15 12:30:48,272 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-15 12:30:48,273 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-15 12:30:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:48,282 INFO L93 Difference]: Finished difference Result 239 states and 389 transitions. [2022-04-15 12:30:48,282 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2022-04-15 12:30:48,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:48,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:48,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) Second operand 239 states. [2022-04-15 12:30:48,285 INFO L87 Difference]: Start difference. First operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) Second operand 239 states. [2022-04-15 12:30:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:48,294 INFO L93 Difference]: Finished difference Result 239 states and 389 transitions. [2022-04-15 12:30:48,294 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2022-04-15 12:30:48,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:48,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:48,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:48,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-15 12:30:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 336 transitions. [2022-04-15 12:30:48,308 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 336 transitions. Word has length 20 [2022-04-15 12:30:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:48,308 INFO L478 AbstractCegarLoop]: Abstraction has 209 states and 336 transitions. [2022-04-15 12:30:48,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:48,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 209 states and 336 transitions. [2022-04-15 12:30:48,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 336 transitions. [2022-04-15 12:30:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:30:48,672 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:48,672 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:48,672 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 12:30:48,672 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:48,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:48,673 INFO L85 PathProgramCache]: Analyzing trace with hash 288094237, now seen corresponding path program 1 times [2022-04-15 12:30:48,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:48,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1557325742] [2022-04-15 12:30:48,673 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:30:48,673 INFO L85 PathProgramCache]: Analyzing trace with hash 288094237, now seen corresponding path program 2 times [2022-04-15 12:30:48,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:48,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372666226] [2022-04-15 12:30:48,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:48,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:48,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {6084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6067#true} is VALID [2022-04-15 12:30:48,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-15 12:30:48,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6067#true} {6067#true} #138#return; {6067#true} is VALID [2022-04-15 12:30:48,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 12:30:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:48,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-15 12:30:48,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-15 12:30:48,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-15 12:30:48,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #118#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-15 12:30:48,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 12:30:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:48,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-15 12:30:48,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-15 12:30:48,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-15 12:30:48,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #120#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-15 12:30:48,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {6067#true} call ULTIMATE.init(); {6084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:48,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {6084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6067#true} is VALID [2022-04-15 12:30:48,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-15 12:30:48,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6067#true} #138#return; {6067#true} is VALID [2022-04-15 12:30:48,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {6067#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {6067#true} is VALID [2022-04-15 12:30:48,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {6067#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6067#true} is VALID [2022-04-15 12:30:48,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {6067#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {6067#true} is VALID [2022-04-15 12:30:48,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {6067#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {6072#(<= 1 main_~l~0)} is VALID [2022-04-15 12:30:48,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {6072#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {6073#(<= 1 main_~i~0)} is VALID [2022-04-15 12:30:48,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {6073#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {6073#(<= 1 main_~i~0)} is VALID [2022-04-15 12:30:48,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {6073#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {6073#(<= 1 main_~i~0)} is VALID [2022-04-15 12:30:48,758 INFO L272 TraceCheckUtils]: 11: Hoare triple {6073#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {6067#true} is VALID [2022-04-15 12:30:48,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-15 12:30:48,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-15 12:30:48,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-15 12:30:48,759 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #118#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-15 12:30:48,759 INFO L272 TraceCheckUtils]: 16: Hoare triple {6073#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {6067#true} is VALID [2022-04-15 12:30:48,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-15 12:30:48,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-15 12:30:48,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-15 12:30:48,760 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #120#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-15 12:30:48,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {6073#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {6073#(<= 1 main_~i~0)} is VALID [2022-04-15 12:30:48,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {6073#(<= 1 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {6073#(<= 1 main_~i~0)} is VALID [2022-04-15 12:30:48,761 INFO L272 TraceCheckUtils]: 23: Hoare triple {6073#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {6082#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:30:48,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {6082#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6083#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:30:48,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {6083#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6068#false} is VALID [2022-04-15 12:30:48,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {6068#false} assume !false; {6068#false} is VALID [2022-04-15 12:30:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:30:48,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:48,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372666226] [2022-04-15 12:30:48,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372666226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:48,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:48,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:30:48,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:48,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1557325742] [2022-04-15 12:30:48,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1557325742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:48,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:48,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:30:48,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817143988] [2022-04-15 12:30:48,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:48,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-15 12:30:48,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:48,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 12:30:48,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:48,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:30:48,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:48,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:30:48,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:30:48,776 INFO L87 Difference]: Start difference. First operand 209 states and 336 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 12:30:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:50,433 INFO L93 Difference]: Finished difference Result 275 states and 448 transitions. [2022-04-15 12:30:50,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:30:50,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-15 12:30:50,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 12:30:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-15 12:30:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 12:30:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-15 12:30:50,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2022-04-15 12:30:50,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:50,576 INFO L225 Difference]: With dead ends: 275 [2022-04-15 12:30:50,576 INFO L226 Difference]: Without dead ends: 273 [2022-04-15 12:30:50,578 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:30:50,579 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 81 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:50,579 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 61 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:30:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-15 12:30:51,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 249. [2022-04-15 12:30:51,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:51,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-15 12:30:51,316 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-15 12:30:51,316 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-15 12:30:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:51,325 INFO L93 Difference]: Finished difference Result 273 states and 446 transitions. [2022-04-15 12:30:51,325 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 446 transitions. [2022-04-15 12:30:51,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:51,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:51,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) Second operand 273 states. [2022-04-15 12:30:51,328 INFO L87 Difference]: Start difference. First operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) Second operand 273 states. [2022-04-15 12:30:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:51,337 INFO L93 Difference]: Finished difference Result 273 states and 446 transitions. [2022-04-15 12:30:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 446 transitions. [2022-04-15 12:30:51,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:51,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:51,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:51,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-15 12:30:51,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 405 transitions. [2022-04-15 12:30:51,347 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 405 transitions. Word has length 27 [2022-04-15 12:30:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:51,348 INFO L478 AbstractCegarLoop]: Abstraction has 249 states and 405 transitions. [2022-04-15 12:30:51,348 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 12:30:51,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 249 states and 405 transitions. [2022-04-15 12:30:51,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 405 edges. 405 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 405 transitions. [2022-04-15 12:30:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:30:51,875 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:51,875 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:51,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 12:30:51,875 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:51,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash -870562259, now seen corresponding path program 1 times [2022-04-15 12:30:51,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:51,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1338765921] [2022-04-15 12:30:51,876 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:30:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash -870562259, now seen corresponding path program 2 times [2022-04-15 12:30:51,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:51,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232782159] [2022-04-15 12:30:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:51,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:51,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {7710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7694#true} is VALID [2022-04-15 12:30:51,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-15 12:30:51,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7694#true} {7694#true} #138#return; {7694#true} is VALID [2022-04-15 12:30:51,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 12:30:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:51,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-15 12:30:51,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-15 12:30:51,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-15 12:30:51,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7695#false} #130#return; {7695#false} is VALID [2022-04-15 12:30:51,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 12:30:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:51,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-15 12:30:51,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-15 12:30:51,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-15 12:30:51,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7695#false} #132#return; {7695#false} is VALID [2022-04-15 12:30:51,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {7694#true} call ULTIMATE.init(); {7710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:51,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {7710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7694#true} is VALID [2022-04-15 12:30:51,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-15 12:30:51,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7694#true} #138#return; {7694#true} is VALID [2022-04-15 12:30:51,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {7694#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {7694#true} is VALID [2022-04-15 12:30:51,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {7694#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7694#true} is VALID [2022-04-15 12:30:51,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {7694#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {7699#(<= (* main_~l~0 2) (+ main_~r~0 2))} is VALID [2022-04-15 12:30:51,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {7699#(<= (* main_~l~0 2) (+ main_~r~0 2))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {7700#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-15 12:30:51,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {7700#(<= (* main_~l~0 2) main_~r~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {7701#(<= main_~j~0 main_~r~0)} is VALID [2022-04-15 12:30:51,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {7701#(<= main_~j~0 main_~r~0)} assume !(~j~0 <= ~r~0); {7695#false} is VALID [2022-04-15 12:30:51,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {7695#false} assume ~l~0 > 1; {7695#false} is VALID [2022-04-15 12:30:51,948 INFO L272 TraceCheckUtils]: 11: Hoare triple {7695#false} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {7694#true} is VALID [2022-04-15 12:30:51,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-15 12:30:51,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-15 12:30:51,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-15 12:30:51,953 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7694#true} {7695#false} #130#return; {7695#false} is VALID [2022-04-15 12:30:51,954 INFO L272 TraceCheckUtils]: 16: Hoare triple {7695#false} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {7694#true} is VALID [2022-04-15 12:30:51,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-15 12:30:51,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-15 12:30:51,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-15 12:30:51,958 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7694#true} {7695#false} #132#return; {7695#false} is VALID [2022-04-15 12:30:51,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {7695#false} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {7695#false} is VALID [2022-04-15 12:30:51,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {7695#false} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {7695#false} is VALID [2022-04-15 12:30:51,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {7695#false} assume !!(~j~0 <= ~r~0); {7695#false} is VALID [2022-04-15 12:30:51,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {7695#false} assume ~j~0 < ~r~0; {7695#false} is VALID [2022-04-15 12:30:51,959 INFO L272 TraceCheckUtils]: 25: Hoare triple {7695#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {7695#false} is VALID [2022-04-15 12:30:51,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {7695#false} ~cond := #in~cond; {7695#false} is VALID [2022-04-15 12:30:51,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {7695#false} assume 0 == ~cond; {7695#false} is VALID [2022-04-15 12:30:51,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {7695#false} assume !false; {7695#false} is VALID [2022-04-15 12:30:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:30:51,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:51,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232782159] [2022-04-15 12:30:51,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232782159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:51,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:51,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:30:51,964 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:51,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1338765921] [2022-04-15 12:30:51,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1338765921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:51,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:51,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:30:51,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536058071] [2022-04-15 12:30:51,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:51,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-15 12:30:51,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:51,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 12:30:51,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:51,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:30:51,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:51,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:30:51,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:30:51,980 INFO L87 Difference]: Start difference. First operand 249 states and 405 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 12:30:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:54,345 INFO L93 Difference]: Finished difference Result 593 states and 971 transitions. [2022-04-15 12:30:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:30:54,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-15 12:30:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 12:30:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-04-15 12:30:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 12:30:54,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-04-15 12:30:54,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 258 transitions. [2022-04-15 12:30:54,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:54,574 INFO L225 Difference]: With dead ends: 593 [2022-04-15 12:30:54,574 INFO L226 Difference]: Without dead ends: 396 [2022-04-15 12:30:54,576 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:30:54,576 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:54,577 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 60 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:30:54,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-15 12:30:55,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 250. [2022-04-15 12:30:55,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:55,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-15 12:30:55,460 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-15 12:30:55,461 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-15 12:30:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:55,476 INFO L93 Difference]: Finished difference Result 396 states and 653 transitions. [2022-04-15 12:30:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 653 transitions. [2022-04-15 12:30:55,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:55,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:55,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) Second operand 396 states. [2022-04-15 12:30:55,478 INFO L87 Difference]: Start difference. First operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) Second operand 396 states. [2022-04-15 12:30:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:55,494 INFO L93 Difference]: Finished difference Result 396 states and 653 transitions. [2022-04-15 12:30:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 653 transitions. [2022-04-15 12:30:55,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:55,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:55,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:55,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-15 12:30:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 405 transitions. [2022-04-15 12:30:55,504 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 405 transitions. Word has length 29 [2022-04-15 12:30:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:55,504 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 405 transitions. [2022-04-15 12:30:55,505 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 12:30:55,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 405 transitions. [2022-04-15 12:30:55,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 405 edges. 405 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 405 transitions. [2022-04-15 12:30:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:30:55,991 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:55,991 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:55,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 12:30:55,991 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:55,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:55,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1319777776, now seen corresponding path program 1 times [2022-04-15 12:30:55,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:55,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [913581087] [2022-04-15 12:30:55,992 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:30:55,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1319777776, now seen corresponding path program 2 times [2022-04-15 12:30:55,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:55,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135071524] [2022-04-15 12:30:55,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:55,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:56,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:56,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {10222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10201#true} is VALID [2022-04-15 12:30:56,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 12:30:56,079 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10201#true} {10201#true} #138#return; {10201#true} is VALID [2022-04-15 12:30:56,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 12:30:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:56,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-15 12:30:56,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-15 12:30:56,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 12:30:56,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:30:56,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 12:30:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:56,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-15 12:30:56,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-15 12:30:56,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 12:30:56,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:30:56,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 12:30:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:56,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-15 12:30:56,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-15 12:30:56,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 12:30:56,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:30:56,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {10201#true} call ULTIMATE.init(); {10222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:56,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {10222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10201#true} is VALID [2022-04-15 12:30:56,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 12:30:56,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10201#true} #138#return; {10201#true} is VALID [2022-04-15 12:30:56,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {10201#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {10201#true} is VALID [2022-04-15 12:30:56,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {10201#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10201#true} is VALID [2022-04-15 12:30:56,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {10201#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {10206#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:30:56,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {10206#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {10206#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:30:56,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {10206#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {10206#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:30:56,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {10206#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {10206#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:30:56,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {10206#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:30:56,100 INFO L272 TraceCheckUtils]: 11: Hoare triple {10207#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {10201#true} is VALID [2022-04-15 12:30:56,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-15 12:30:56,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-15 12:30:56,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 12:30:56,101 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:30:56,101 INFO L272 TraceCheckUtils]: 16: Hoare triple {10207#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {10201#true} is VALID [2022-04-15 12:30:56,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-15 12:30:56,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-15 12:30:56,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 12:30:56,102 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:30:56,102 INFO L272 TraceCheckUtils]: 21: Hoare triple {10207#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {10201#true} is VALID [2022-04-15 12:30:56,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-15 12:30:56,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-15 12:30:56,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-15 12:30:56,103 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:30:56,103 INFO L272 TraceCheckUtils]: 26: Hoare triple {10207#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {10220#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:30:56,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {10220#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10221#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:30:56,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {10221#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10202#false} is VALID [2022-04-15 12:30:56,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {10202#false} assume !false; {10202#false} is VALID [2022-04-15 12:30:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:30:56,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:56,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135071524] [2022-04-15 12:30:56,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135071524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:56,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:56,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:30:56,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:56,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [913581087] [2022-04-15 12:30:56,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [913581087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:56,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:56,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:30:56,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744467252] [2022-04-15 12:30:56,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:56,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-15 12:30:56,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:56,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 12:30:56,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:56,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:30:56,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:56,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:30:56,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:30:56,120 INFO L87 Difference]: Start difference. First operand 250 states and 405 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 12:30:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:57,990 INFO L93 Difference]: Finished difference Result 324 states and 521 transitions. [2022-04-15 12:30:57,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:30:57,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-15 12:30:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 12:30:57,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-15 12:30:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 12:30:57,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-15 12:30:57,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-15 12:30:58,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:58,117 INFO L225 Difference]: With dead ends: 324 [2022-04-15 12:30:58,117 INFO L226 Difference]: Without dead ends: 322 [2022-04-15 12:30:58,117 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:30:58,118 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:58,118 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 75 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:30:58,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-15 12:30:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 300. [2022-04-15 12:30:59,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:59,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-15 12:30:59,172 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-15 12:30:59,173 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-15 12:30:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:59,182 INFO L93 Difference]: Finished difference Result 322 states and 519 transitions. [2022-04-15 12:30:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2022-04-15 12:30:59,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:59,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:59,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) Second operand 322 states. [2022-04-15 12:30:59,185 INFO L87 Difference]: Start difference. First operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) Second operand 322 states. [2022-04-15 12:30:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:59,194 INFO L93 Difference]: Finished difference Result 322 states and 519 transitions. [2022-04-15 12:30:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2022-04-15 12:30:59,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:59,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:59,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:59,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-15 12:30:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 489 transitions. [2022-04-15 12:30:59,206 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 489 transitions. Word has length 30 [2022-04-15 12:30:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:59,206 INFO L478 AbstractCegarLoop]: Abstraction has 300 states and 489 transitions. [2022-04-15 12:30:59,206 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 12:30:59,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 489 transitions. [2022-04-15 12:30:59,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 489 transitions. [2022-04-15 12:30:59,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:30:59,812 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:59,812 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:59,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 12:30:59,812 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:59,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1828949766, now seen corresponding path program 1 times [2022-04-15 12:30:59,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:59,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [637654492] [2022-04-15 12:30:59,813 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:30:59,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1828949766, now seen corresponding path program 2 times [2022-04-15 12:30:59,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:59,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728844365] [2022-04-15 12:30:59,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:59,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:59,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:59,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {12150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {12128#true} is VALID [2022-04-15 12:30:59,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 12:30:59,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12128#true} {12128#true} #138#return; {12128#true} is VALID [2022-04-15 12:30:59,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 12:30:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:59,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-15 12:30:59,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-15 12:30:59,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 12:30:59,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #118#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-15 12:30:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 12:30:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:59,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-15 12:30:59,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-15 12:30:59,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 12:30:59,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #120#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-15 12:30:59,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 12:30:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:59,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-15 12:30:59,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-15 12:30:59,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 12:30:59,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #122#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-15 12:30:59,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {12128#true} call ULTIMATE.init(); {12150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:59,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {12150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {12128#true} is VALID [2022-04-15 12:30:59,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 12:30:59,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12128#true} #138#return; {12128#true} is VALID [2022-04-15 12:30:59,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {12128#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {12128#true} is VALID [2022-04-15 12:30:59,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {12128#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12128#true} is VALID [2022-04-15 12:30:59,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {12128#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {12133#(<= (* main_~l~0 2) (+ main_~n~0 2))} is VALID [2022-04-15 12:30:59,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {12133#(<= (* main_~l~0 2) (+ main_~n~0 2))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {12134#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-15 12:30:59,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {12134#(<= (+ main_~l~0 1) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-15 12:30:59,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} assume !!(~j~0 <= ~r~0); {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-15 12:30:59,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} assume !(~j~0 < ~r~0); {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-15 12:30:59,885 INFO L272 TraceCheckUtils]: 11: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {12128#true} is VALID [2022-04-15 12:30:59,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-15 12:30:59,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-15 12:30:59,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 12:30:59,886 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #118#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-15 12:30:59,886 INFO L272 TraceCheckUtils]: 16: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {12128#true} is VALID [2022-04-15 12:30:59,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-15 12:30:59,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-15 12:30:59,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 12:30:59,886 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #120#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-15 12:30:59,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-15 12:30:59,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-15 12:30:59,887 INFO L272 TraceCheckUtils]: 23: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {12128#true} is VALID [2022-04-15 12:30:59,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-15 12:30:59,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-15 12:30:59,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-15 12:30:59,888 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #122#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-15 12:30:59,888 INFO L272 TraceCheckUtils]: 28: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {12148#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:30:59,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {12148#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12149#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:30:59,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {12149#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12129#false} is VALID [2022-04-15 12:30:59,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {12129#false} assume !false; {12129#false} is VALID [2022-04-15 12:30:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:30:59,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:59,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728844365] [2022-04-15 12:30:59,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728844365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:59,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:59,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:30:59,890 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:59,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [637654492] [2022-04-15 12:30:59,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [637654492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:59,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:59,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:30:59,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591275585] [2022-04-15 12:30:59,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:59,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-15 12:30:59,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:59,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 12:30:59,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:59,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:30:59,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:59,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:30:59,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:30:59,908 INFO L87 Difference]: Start difference. First operand 300 states and 489 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 12:31:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:02,969 INFO L93 Difference]: Finished difference Result 470 states and 788 transitions. [2022-04-15 12:31:02,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:31:02,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-15 12:31:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:31:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 12:31:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-04-15 12:31:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 12:31:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-04-15 12:31:02,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 145 transitions. [2022-04-15 12:31:03,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:03,109 INFO L225 Difference]: With dead ends: 470 [2022-04-15 12:31:03,109 INFO L226 Difference]: Without dead ends: 468 [2022-04-15 12:31:03,110 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:31:03,110 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 98 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:31:03,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 77 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:31:03,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-15 12:31:04,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 422. [2022-04-15 12:31:04,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:31:04,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 468 states. Second operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) [2022-04-15 12:31:04,950 INFO L74 IsIncluded]: Start isIncluded. First operand 468 states. Second operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) [2022-04-15 12:31:04,950 INFO L87 Difference]: Start difference. First operand 468 states. Second operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) [2022-04-15 12:31:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:04,977 INFO L93 Difference]: Finished difference Result 468 states and 786 transitions. [2022-04-15 12:31:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 786 transitions. [2022-04-15 12:31:04,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:04,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:04,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) Second operand 468 states. [2022-04-15 12:31:04,981 INFO L87 Difference]: Start difference. First operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) Second operand 468 states. [2022-04-15 12:31:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:05,000 INFO L93 Difference]: Finished difference Result 468 states and 786 transitions. [2022-04-15 12:31:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 786 transitions. [2022-04-15 12:31:05,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:05,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:05,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:31:05,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:31:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) [2022-04-15 12:31:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 708 transitions. [2022-04-15 12:31:05,022 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 708 transitions. Word has length 32 [2022-04-15 12:31:05,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:31:05,022 INFO L478 AbstractCegarLoop]: Abstraction has 422 states and 708 transitions. [2022-04-15 12:31:05,022 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 12:31:05,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 422 states and 708 transitions. [2022-04-15 12:31:05,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 708 edges. 708 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:05,991 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 708 transitions. [2022-04-15 12:31:05,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:31:05,992 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:05,992 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:05,992 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 12:31:05,992 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:05,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:05,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1969498376, now seen corresponding path program 1 times [2022-04-15 12:31:05,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:05,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [802570997] [2022-04-15 12:31:05,993 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:31:05,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1969498376, now seen corresponding path program 2 times [2022-04-15 12:31:05,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:05,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551884162] [2022-04-15 12:31:05,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:05,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:06,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:31:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:06,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {14907#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {14885#true} is VALID [2022-04-15 12:31:06,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 12:31:06,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14885#true} {14885#true} #138#return; {14885#true} is VALID [2022-04-15 12:31:06,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 12:31:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:06,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-15 12:31:06,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-15 12:31:06,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 12:31:06,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #118#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-15 12:31:06,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 12:31:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:06,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-15 12:31:06,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-15 12:31:06,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 12:31:06,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #120#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-15 12:31:06,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 12:31:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:06,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-15 12:31:06,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-15 12:31:06,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 12:31:06,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #122#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-15 12:31:06,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {14885#true} call ULTIMATE.init(); {14907#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:31:06,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {14907#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {14885#true} is VALID [2022-04-15 12:31:06,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 12:31:06,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14885#true} #138#return; {14885#true} is VALID [2022-04-15 12:31:06,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {14885#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {14885#true} is VALID [2022-04-15 12:31:06,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {14885#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {14885#true} is VALID [2022-04-15 12:31:06,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {14885#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {14890#(<= 1 main_~n~0)} is VALID [2022-04-15 12:31:06,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {14890#(<= 1 main_~n~0)} assume !(~l~0 > 1);#t~post3 := ~r~0;~r~0 := #t~post3 - 1;havoc #t~post3; {14891#(<= main_~l~0 main_~n~0)} is VALID [2022-04-15 12:31:06,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {14891#(<= main_~l~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-15 12:31:06,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {14892#(<= main_~i~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-15 12:31:06,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {14892#(<= main_~i~0 main_~n~0)} assume !(~j~0 < ~r~0); {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-15 12:31:06,062 INFO L272 TraceCheckUtils]: 11: Hoare triple {14892#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {14885#true} is VALID [2022-04-15 12:31:06,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-15 12:31:06,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-15 12:31:06,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 12:31:06,062 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #118#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-15 12:31:06,062 INFO L272 TraceCheckUtils]: 16: Hoare triple {14892#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {14885#true} is VALID [2022-04-15 12:31:06,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-15 12:31:06,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-15 12:31:06,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 12:31:06,063 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #120#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-15 12:31:06,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {14892#(<= main_~i~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-15 12:31:06,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {14892#(<= main_~i~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-15 12:31:06,064 INFO L272 TraceCheckUtils]: 23: Hoare triple {14892#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {14885#true} is VALID [2022-04-15 12:31:06,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-15 12:31:06,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-15 12:31:06,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 12:31:06,064 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #122#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-15 12:31:06,065 INFO L272 TraceCheckUtils]: 28: Hoare triple {14892#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {14905#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:31:06,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {14905#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {14906#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:31:06,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {14906#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14886#false} is VALID [2022-04-15 12:31:06,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {14886#false} assume !false; {14886#false} is VALID [2022-04-15 12:31:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:31:06,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:31:06,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551884162] [2022-04-15 12:31:06,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551884162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:06,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:06,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:31:06,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:31:06,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [802570997] [2022-04-15 12:31:06,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [802570997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:06,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:06,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:31:06,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744298354] [2022-04-15 12:31:06,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:31:06,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-15 12:31:06,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:31:06,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 12:31:06,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:06,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:31:06,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:06,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:31:06,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:31:06,081 INFO L87 Difference]: Start difference. First operand 422 states and 708 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 12:31:09,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:09,427 INFO L93 Difference]: Finished difference Result 489 states and 817 transitions. [2022-04-15 12:31:09,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:31:09,428 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-15 12:31:09,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:31:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 12:31:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-15 12:31:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 12:31:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-15 12:31:09,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2022-04-15 12:31:09,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:09,537 INFO L225 Difference]: With dead ends: 489 [2022-04-15 12:31:09,538 INFO L226 Difference]: Without dead ends: 487 [2022-04-15 12:31:09,538 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:31:09,539 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 109 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:31:09,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 66 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:31:09,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-04-15 12:31:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 429. [2022-04-15 12:31:11,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:31:11,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 487 states. Second operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:11,821 INFO L74 IsIncluded]: Start isIncluded. First operand 487 states. Second operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:11,822 INFO L87 Difference]: Start difference. First operand 487 states. Second operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:11,847 INFO L93 Difference]: Finished difference Result 487 states and 815 transitions. [2022-04-15 12:31:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 815 transitions. [2022-04-15 12:31:11,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:11,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:11,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 487 states. [2022-04-15 12:31:11,850 INFO L87 Difference]: Start difference. First operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 487 states. [2022-04-15 12:31:11,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:11,875 INFO L93 Difference]: Finished difference Result 487 states and 815 transitions. [2022-04-15 12:31:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 815 transitions. [2022-04-15 12:31:11,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:11,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:11,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:31:11,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:31:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 717 transitions. [2022-04-15 12:31:11,900 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 717 transitions. Word has length 32 [2022-04-15 12:31:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:31:11,901 INFO L478 AbstractCegarLoop]: Abstraction has 429 states and 717 transitions. [2022-04-15 12:31:11,901 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 12:31:11,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 429 states and 717 transitions. [2022-04-15 12:31:12,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 717 edges. 717 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 717 transitions. [2022-04-15 12:31:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 12:31:12,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:12,910 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:12,910 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 12:31:12,910 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:12,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:12,910 INFO L85 PathProgramCache]: Analyzing trace with hash 154781133, now seen corresponding path program 1 times [2022-04-15 12:31:12,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:12,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [779367670] [2022-04-15 12:31:12,911 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:31:12,911 INFO L85 PathProgramCache]: Analyzing trace with hash 154781133, now seen corresponding path program 2 times [2022-04-15 12:31:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:12,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658267817] [2022-04-15 12:31:12,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:12,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:12,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:31:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:13,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {17760#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {17730#true} is VALID [2022-04-15 12:31:13,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 12:31:13,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17730#true} {17730#true} #138#return; {17730#true} is VALID [2022-04-15 12:31:13,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 12:31:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:13,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 12:31:13,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 12:31:13,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 12:31:13,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:31:13,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 12:31:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:13,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 12:31:13,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 12:31:13,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 12:31:13,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:31:13,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 12:31:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:13,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 12:31:13,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 12:31:13,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 12:31:13,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:31:13,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 12:31:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:13,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 12:31:13,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 12:31:13,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 12:31:13,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #116#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:31:13,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-15 12:31:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:13,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 12:31:13,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 12:31:13,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 12:31:13,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17753#(<= main_~j~0 main_~n~0)} #118#return; {17753#(<= main_~j~0 main_~n~0)} is VALID [2022-04-15 12:31:13,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {17730#true} call ULTIMATE.init(); {17760#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:31:13,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {17760#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {17730#true} is VALID [2022-04-15 12:31:13,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 12:31:13,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17730#true} #138#return; {17730#true} is VALID [2022-04-15 12:31:13,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {17730#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {17730#true} is VALID [2022-04-15 12:31:13,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {17730#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {17730#true} is VALID [2022-04-15 12:31:13,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {17730#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {17735#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:31:13,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {17735#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {17735#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:31:13,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {17735#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {17735#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:31:13,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {17735#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {17735#(<= main_~r~0 main_~n~0)} is VALID [2022-04-15 12:31:13,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {17735#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:31:13,032 INFO L272 TraceCheckUtils]: 11: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {17730#true} is VALID [2022-04-15 12:31:13,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 12:31:13,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 12:31:13,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 12:31:13,034 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:31:13,034 INFO L272 TraceCheckUtils]: 16: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {17730#true} is VALID [2022-04-15 12:31:13,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 12:31:13,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 12:31:13,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 12:31:13,035 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:31:13,035 INFO L272 TraceCheckUtils]: 21: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {17730#true} is VALID [2022-04-15 12:31:13,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 12:31:13,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 12:31:13,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 12:31:13,036 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:31:13,036 INFO L272 TraceCheckUtils]: 26: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {17730#true} is VALID [2022-04-15 12:31:13,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 12:31:13,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 12:31:13,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 12:31:13,037 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #116#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:31:13,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:31:13,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {17753#(<= main_~j~0 main_~n~0)} is VALID [2022-04-15 12:31:13,038 INFO L272 TraceCheckUtils]: 33: Hoare triple {17753#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {17730#true} is VALID [2022-04-15 12:31:13,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-15 12:31:13,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-15 12:31:13,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-15 12:31:13,038 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17730#true} {17753#(<= main_~j~0 main_~n~0)} #118#return; {17753#(<= main_~j~0 main_~n~0)} is VALID [2022-04-15 12:31:13,039 INFO L272 TraceCheckUtils]: 38: Hoare triple {17753#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {17758#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:31:13,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {17758#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {17759#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:31:13,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {17759#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17731#false} is VALID [2022-04-15 12:31:13,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {17731#false} assume !false; {17731#false} is VALID [2022-04-15 12:31:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 12:31:13,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:31:13,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658267817] [2022-04-15 12:31:13,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658267817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:13,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:13,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:31:13,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:31:13,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [779367670] [2022-04-15 12:31:13,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [779367670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:13,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:13,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:31:13,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131047739] [2022-04-15 12:31:13,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:31:13,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-15 12:31:13,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:31:13,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 12:31:13,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:13,063 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:31:13,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:13,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:31:13,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:31:13,063 INFO L87 Difference]: Start difference. First operand 429 states and 717 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 12:31:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:16,489 INFO L93 Difference]: Finished difference Result 484 states and 791 transitions. [2022-04-15 12:31:16,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:31:16,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-15 12:31:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:31:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 12:31:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-15 12:31:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 12:31:16,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-15 12:31:16,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2022-04-15 12:31:16,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:16,596 INFO L225 Difference]: With dead ends: 484 [2022-04-15 12:31:16,597 INFO L226 Difference]: Without dead ends: 482 [2022-04-15 12:31:16,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:31:16,597 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 56 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:31:16,598 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 82 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:31:16,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-04-15 12:31:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 433. [2022-04-15 12:31:18,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:31:18,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 482 states. Second operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:18,829 INFO L74 IsIncluded]: Start isIncluded. First operand 482 states. Second operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:18,829 INFO L87 Difference]: Start difference. First operand 482 states. Second operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:18,846 INFO L93 Difference]: Finished difference Result 482 states and 789 transitions. [2022-04-15 12:31:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 789 transitions. [2022-04-15 12:31:18,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:18,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:18,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 482 states. [2022-04-15 12:31:18,850 INFO L87 Difference]: Start difference. First operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 482 states. [2022-04-15 12:31:18,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:18,866 INFO L93 Difference]: Finished difference Result 482 states and 789 transitions. [2022-04-15 12:31:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 789 transitions. [2022-04-15 12:31:18,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:18,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:18,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:31:18,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:31:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 720 transitions. [2022-04-15 12:31:18,885 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 720 transitions. Word has length 42 [2022-04-15 12:31:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:31:18,885 INFO L478 AbstractCegarLoop]: Abstraction has 433 states and 720 transitions. [2022-04-15 12:31:18,885 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 12:31:18,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 433 states and 720 transitions. [2022-04-15 12:31:19,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 720 edges. 720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 720 transitions. [2022-04-15 12:31:19,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 12:31:19,910 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:19,910 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:19,910 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 12:31:19,911 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:19,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:19,911 INFO L85 PathProgramCache]: Analyzing trace with hash -756625364, now seen corresponding path program 1 times [2022-04-15 12:31:19,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:19,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [349024482] [2022-04-15 12:31:19,911 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:31:19,911 INFO L85 PathProgramCache]: Analyzing trace with hash -756625364, now seen corresponding path program 2 times [2022-04-15 12:31:19,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:19,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774037847] [2022-04-15 12:31:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:19,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:19,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:31:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:19,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {20600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {20574#true} is VALID [2022-04-15 12:31:19,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 12:31:19,962 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20574#true} {20574#true} #138#return; {20574#true} is VALID [2022-04-15 12:31:19,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 12:31:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:19,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 12:31:19,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 12:31:19,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 12:31:19,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #118#return; {20574#true} is VALID [2022-04-15 12:31:19,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 12:31:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:19,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 12:31:19,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 12:31:19,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 12:31:19,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #120#return; {20574#true} is VALID [2022-04-15 12:31:19,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 12:31:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:19,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 12:31:19,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 12:31:19,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 12:31:19,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #130#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-15 12:31:19,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 12:31:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:19,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 12:31:19,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 12:31:19,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 12:31:19,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #132#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-15 12:31:19,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {20574#true} call ULTIMATE.init(); {20600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:31:19,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {20600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {20574#true} is VALID [2022-04-15 12:31:19,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 12:31:19,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #138#return; {20574#true} is VALID [2022-04-15 12:31:19,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {20574#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {20574#true} is VALID [2022-04-15 12:31:19,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {20574#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {20574#true} is VALID [2022-04-15 12:31:19,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {20574#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {20574#true} is VALID [2022-04-15 12:31:19,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {20574#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {20574#true} is VALID [2022-04-15 12:31:19,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {20574#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {20574#true} is VALID [2022-04-15 12:31:19,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {20574#true} assume !!(~j~0 <= ~r~0); {20574#true} is VALID [2022-04-15 12:31:19,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {20574#true} assume !(~j~0 < ~r~0); {20574#true} is VALID [2022-04-15 12:31:19,976 INFO L272 TraceCheckUtils]: 11: Hoare triple {20574#true} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {20574#true} is VALID [2022-04-15 12:31:19,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 12:31:19,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 12:31:19,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 12:31:19,976 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20574#true} {20574#true} #118#return; {20574#true} is VALID [2022-04-15 12:31:19,976 INFO L272 TraceCheckUtils]: 16: Hoare triple {20574#true} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {20574#true} is VALID [2022-04-15 12:31:19,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 12:31:19,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 12:31:19,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 12:31:19,976 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20574#true} {20574#true} #120#return; {20574#true} is VALID [2022-04-15 12:31:19,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {20574#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20574#true} is VALID [2022-04-15 12:31:19,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {20574#true} assume 0 != #t~nondet5;havoc #t~nondet5; {20574#true} is VALID [2022-04-15 12:31:19,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {20574#true} assume ~l~0 > 1; {20587#(<= 2 main_~l~0)} is VALID [2022-04-15 12:31:19,977 INFO L272 TraceCheckUtils]: 24: Hoare triple {20587#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {20574#true} is VALID [2022-04-15 12:31:19,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 12:31:19,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 12:31:19,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 12:31:19,978 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #130#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-15 12:31:19,978 INFO L272 TraceCheckUtils]: 29: Hoare triple {20587#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {20574#true} is VALID [2022-04-15 12:31:19,978 INFO L290 TraceCheckUtils]: 30: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-15 12:31:19,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-15 12:31:19,978 INFO L290 TraceCheckUtils]: 32: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-15 12:31:19,978 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #132#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-15 12:31:19,979 INFO L290 TraceCheckUtils]: 34: Hoare triple {20587#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {20596#(<= 1 main_~l~0)} is VALID [2022-04-15 12:31:19,979 INFO L290 TraceCheckUtils]: 35: Hoare triple {20596#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {20597#(<= 2 main_~j~0)} is VALID [2022-04-15 12:31:19,980 INFO L290 TraceCheckUtils]: 36: Hoare triple {20597#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {20597#(<= 2 main_~j~0)} is VALID [2022-04-15 12:31:19,980 INFO L290 TraceCheckUtils]: 37: Hoare triple {20597#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {20597#(<= 2 main_~j~0)} is VALID [2022-04-15 12:31:19,980 INFO L272 TraceCheckUtils]: 38: Hoare triple {20597#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {20598#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:31:19,981 INFO L290 TraceCheckUtils]: 39: Hoare triple {20598#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {20599#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:31:19,981 INFO L290 TraceCheckUtils]: 40: Hoare triple {20599#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20575#false} is VALID [2022-04-15 12:31:19,981 INFO L290 TraceCheckUtils]: 41: Hoare triple {20575#false} assume !false; {20575#false} is VALID [2022-04-15 12:31:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 12:31:19,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:31:19,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774037847] [2022-04-15 12:31:19,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774037847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:19,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:19,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:31:19,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:31:19,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [349024482] [2022-04-15 12:31:19,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [349024482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:19,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:19,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:31:19,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764955699] [2022-04-15 12:31:19,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:31:19,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-04-15 12:31:19,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:31:19,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 12:31:20,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:20,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:31:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:20,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:31:20,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:31:20,002 INFO L87 Difference]: Start difference. First operand 433 states and 720 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 12:31:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:22,828 INFO L93 Difference]: Finished difference Result 440 states and 726 transitions. [2022-04-15 12:31:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:31:22,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-04-15 12:31:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:31:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 12:31:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 12:31:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 12:31:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 12:31:22,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-15 12:31:22,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:22,904 INFO L225 Difference]: With dead ends: 440 [2022-04-15 12:31:22,905 INFO L226 Difference]: Without dead ends: 438 [2022-04-15 12:31:22,905 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:31:22,905 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:31:22,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 57 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:31:22,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-04-15 12:31:25,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 437. [2022-04-15 12:31:25,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:31:25,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 438 states. Second operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:25,184 INFO L74 IsIncluded]: Start isIncluded. First operand 438 states. Second operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:25,184 INFO L87 Difference]: Start difference. First operand 438 states. Second operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:25,198 INFO L93 Difference]: Finished difference Result 438 states and 724 transitions. [2022-04-15 12:31:25,198 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 724 transitions. [2022-04-15 12:31:25,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:25,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:25,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 438 states. [2022-04-15 12:31:25,201 INFO L87 Difference]: Start difference. First operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 438 states. [2022-04-15 12:31:25,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:25,214 INFO L93 Difference]: Finished difference Result 438 states and 724 transitions. [2022-04-15 12:31:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 724 transitions. [2022-04-15 12:31:25,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:25,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:25,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:31:25,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:31:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 723 transitions. [2022-04-15 12:31:25,232 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 723 transitions. Word has length 42 [2022-04-15 12:31:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:31:25,232 INFO L478 AbstractCegarLoop]: Abstraction has 437 states and 723 transitions. [2022-04-15 12:31:25,232 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 12:31:25,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 437 states and 723 transitions. [2022-04-15 12:31:26,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 723 edges. 723 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:26,224 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 723 transitions. [2022-04-15 12:31:26,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 12:31:26,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:26,225 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:26,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 12:31:26,225 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:26,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:26,225 INFO L85 PathProgramCache]: Analyzing trace with hash 202086614, now seen corresponding path program 1 times [2022-04-15 12:31:26,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:26,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1121336340] [2022-04-15 12:31:26,226 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:31:26,226 INFO L85 PathProgramCache]: Analyzing trace with hash 202086614, now seen corresponding path program 2 times [2022-04-15 12:31:26,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:26,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641204537] [2022-04-15 12:31:26,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:26,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:26,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:31:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:26,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {23282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23248#true} is VALID [2022-04-15 12:31:26,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 12:31:26,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23248#true} {23248#true} #138#return; {23248#true} is VALID [2022-04-15 12:31:26,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 12:31:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:26,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 12:31:26,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 12:31:26,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 12:31:26,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #118#return; {23248#true} is VALID [2022-04-15 12:31:26,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 12:31:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:26,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 12:31:26,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 12:31:26,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 12:31:26,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #120#return; {23248#true} is VALID [2022-04-15 12:31:26,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 12:31:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:26,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 12:31:26,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 12:31:26,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 12:31:26,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #130#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-15 12:31:26,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 12:31:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:26,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 12:31:26,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 12:31:26,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 12:31:26,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #132#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-15 12:31:26,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 12:31:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:26,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 12:31:26,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 12:31:26,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 12:31:26,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #118#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-15 12:31:26,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-15 12:31:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:26,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 12:31:26,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 12:31:26,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 12:31:26,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #120#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-15 12:31:26,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {23248#true} call ULTIMATE.init(); {23282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:31:26,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {23282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23248#true} is VALID [2022-04-15 12:31:26,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 12:31:26,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #138#return; {23248#true} is VALID [2022-04-15 12:31:26,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {23248#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {23248#true} is VALID [2022-04-15 12:31:26,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {23248#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {23248#true} is VALID [2022-04-15 12:31:26,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {23248#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {23248#true} is VALID [2022-04-15 12:31:26,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {23248#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {23248#true} is VALID [2022-04-15 12:31:26,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {23248#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {23248#true} is VALID [2022-04-15 12:31:26,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {23248#true} assume !!(~j~0 <= ~r~0); {23248#true} is VALID [2022-04-15 12:31:26,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {23248#true} assume !(~j~0 < ~r~0); {23248#true} is VALID [2022-04-15 12:31:26,329 INFO L272 TraceCheckUtils]: 11: Hoare triple {23248#true} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {23248#true} is VALID [2022-04-15 12:31:26,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 12:31:26,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 12:31:26,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 12:31:26,329 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23248#true} {23248#true} #118#return; {23248#true} is VALID [2022-04-15 12:31:26,330 INFO L272 TraceCheckUtils]: 16: Hoare triple {23248#true} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {23248#true} is VALID [2022-04-15 12:31:26,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 12:31:26,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 12:31:26,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 12:31:26,330 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {23248#true} {23248#true} #120#return; {23248#true} is VALID [2022-04-15 12:31:26,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {23248#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23248#true} is VALID [2022-04-15 12:31:26,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {23248#true} assume 0 != #t~nondet5;havoc #t~nondet5; {23248#true} is VALID [2022-04-15 12:31:26,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {23248#true} assume ~l~0 > 1; {23261#(<= 2 main_~l~0)} is VALID [2022-04-15 12:31:26,330 INFO L272 TraceCheckUtils]: 24: Hoare triple {23261#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {23248#true} is VALID [2022-04-15 12:31:26,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 12:31:26,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 12:31:26,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 12:31:26,331 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #130#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-15 12:31:26,331 INFO L272 TraceCheckUtils]: 29: Hoare triple {23261#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {23248#true} is VALID [2022-04-15 12:31:26,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 12:31:26,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 12:31:26,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 12:31:26,332 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #132#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-15 12:31:26,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {23261#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {23270#(<= 1 main_~l~0)} is VALID [2022-04-15 12:31:26,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {23270#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {23271#(<= 1 main_~i~0)} is VALID [2022-04-15 12:31:26,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {23271#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {23271#(<= 1 main_~i~0)} is VALID [2022-04-15 12:31:26,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {23271#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {23271#(<= 1 main_~i~0)} is VALID [2022-04-15 12:31:26,333 INFO L272 TraceCheckUtils]: 38: Hoare triple {23271#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {23248#true} is VALID [2022-04-15 12:31:26,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 12:31:26,333 INFO L290 TraceCheckUtils]: 40: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 12:31:26,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 12:31:26,334 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #118#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-15 12:31:26,334 INFO L272 TraceCheckUtils]: 43: Hoare triple {23271#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {23248#true} is VALID [2022-04-15 12:31:26,334 INFO L290 TraceCheckUtils]: 44: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-15 12:31:26,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-15 12:31:26,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-15 12:31:26,334 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #120#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-15 12:31:26,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {23271#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23271#(<= 1 main_~i~0)} is VALID [2022-04-15 12:31:26,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {23271#(<= 1 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {23271#(<= 1 main_~i~0)} is VALID [2022-04-15 12:31:26,335 INFO L272 TraceCheckUtils]: 50: Hoare triple {23271#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {23280#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:31:26,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {23280#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {23281#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:31:26,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {23281#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23249#false} is VALID [2022-04-15 12:31:26,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {23249#false} assume !false; {23249#false} is VALID [2022-04-15 12:31:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 12:31:26,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:31:26,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641204537] [2022-04-15 12:31:26,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641204537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:26,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:26,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:31:26,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:31:26,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1121336340] [2022-04-15 12:31:26,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1121336340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:26,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:26,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:31:26,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414724816] [2022-04-15 12:31:26,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:31:26,340 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2022-04-15 12:31:26,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:31:26,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 12:31:26,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:26,360 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:31:26,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:26,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:31:26,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:31:26,361 INFO L87 Difference]: Start difference. First operand 437 states and 723 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 12:31:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:29,813 INFO L93 Difference]: Finished difference Result 501 states and 826 transitions. [2022-04-15 12:31:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:31:29,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2022-04-15 12:31:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:31:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 12:31:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-15 12:31:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 12:31:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-15 12:31:29,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 107 transitions. [2022-04-15 12:31:29,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:29,915 INFO L225 Difference]: With dead ends: 501 [2022-04-15 12:31:29,916 INFO L226 Difference]: Without dead ends: 499 [2022-04-15 12:31:29,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:31:29,916 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 80 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:31:29,917 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 66 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:31:29,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-15 12:31:32,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 441. [2022-04-15 12:31:32,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:31:32,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:32,214 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:32,214 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:32,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:32,230 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-15 12:31:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-15 12:31:32,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:32,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:32,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 499 states. [2022-04-15 12:31:32,233 INFO L87 Difference]: Start difference. First operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 499 states. [2022-04-15 12:31:32,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:32,248 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-15 12:31:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-15 12:31:32,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:32,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:32,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:31:32,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:31:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-15 12:31:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 726 transitions. [2022-04-15 12:31:32,265 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 726 transitions. Word has length 54 [2022-04-15 12:31:32,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:31:32,265 INFO L478 AbstractCegarLoop]: Abstraction has 441 states and 726 transitions. [2022-04-15 12:31:32,265 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 12:31:32,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 441 states and 726 transitions. [2022-04-15 12:31:33,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 726 edges. 726 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:33,253 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 726 transitions. [2022-04-15 12:31:33,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 12:31:33,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:33,254 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:33,254 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 12:31:33,254 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:33,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:33,254 INFO L85 PathProgramCache]: Analyzing trace with hash -667500302, now seen corresponding path program 1 times [2022-04-15 12:31:33,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:33,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1479994537] [2022-04-15 12:31:33,636 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 12:31:33,639 INFO L158 Benchmark]: Toolchain (without parser) took 57440.26ms. Allocated memory was 178.3MB in the beginning and 348.1MB in the end (delta: 169.9MB). Free memory was 126.3MB in the beginning and 250.4MB in the end (delta: -124.1MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. [2022-04-15 12:31:33,639 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 178.3MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:31:33,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.63ms. Allocated memory is still 178.3MB. Free memory was 126.0MB in the beginning and 152.9MB in the end (delta: -26.9MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-15 12:31:33,639 INFO L158 Benchmark]: Boogie Preprocessor took 36.07ms. Allocated memory is still 178.3MB. Free memory was 152.9MB in the beginning and 151.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:31:33,640 INFO L158 Benchmark]: RCFGBuilder took 338.56ms. Allocated memory is still 178.3MB. Free memory was 151.1MB in the beginning and 136.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-15 12:31:33,640 INFO L158 Benchmark]: TraceAbstraction took 56790.96ms. Allocated memory was 178.3MB in the beginning and 348.1MB in the end (delta: 169.9MB). Free memory was 135.9MB in the beginning and 250.4MB in the end (delta: -114.5MB). Peak memory consumption was 55.7MB. Max. memory is 8.0GB. [2022-04-15 12:31:33,640 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.17ms. Allocated memory is still 178.3MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 269.63ms. Allocated memory is still 178.3MB. Free memory was 126.0MB in the beginning and 152.9MB in the end (delta: -26.9MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.07ms. Allocated memory is still 178.3MB. Free memory was 152.9MB in the beginning and 151.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 338.56ms. Allocated memory is still 178.3MB. Free memory was 151.1MB in the beginning and 136.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 56790.96ms. Allocated memory was 178.3MB in the beginning and 348.1MB in the end (delta: 169.9MB). Free memory was 135.9MB in the beginning and 250.4MB in the end (delta: -114.5MB). Peak memory consumption was 55.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:31:33,663 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...