/usr/bin/java -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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:31:41,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:31:41,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:31:41,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:31:41,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:31:41,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:31:41,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:31:41,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:31:41,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:31:41,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:31:41,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:31:41,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:31:41,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:31:41,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:31:41,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:31:41,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:31:41,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:31:41,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:31:41,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:31:41,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:31:41,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:31:41,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:31:41,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:31:41,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:31:41,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:31:41,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:31:41,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:31:41,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:31:41,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:31:41,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:31:41,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:31:41,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:31:41,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:31:41,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:31:41,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:31:41,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:31:41,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:31:41,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:31:41,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:31:41,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:31:41,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:31:41,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:31:41,510 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:31:41,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:31:41,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:31:41,513 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:31:41,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:31:41,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:31:41,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:31:41,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:31:41,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:31:41,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:31:41,514 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:31:41,515 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:31:41,515 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:31:41,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:31:41,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:31:41,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:31:41,515 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:31:41,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:31:41,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:31:41,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:31:41,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:31:41,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:31:41,516 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:31:41,516 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; [2021-05-02 23:31:41,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:31:41,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:31:41,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:31:41,825 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:31:41,826 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:31:41,827 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2021-05-02 23:31:41,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c62a26e/9f34c608686d49a586fa7ebaf286c374/FLAG4225a6989 [2021-05-02 23:31:42,256 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:31:42,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2021-05-02 23:31:42,263 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c62a26e/9f34c608686d49a586fa7ebaf286c374/FLAG4225a6989 [2021-05-02 23:31:42,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c62a26e/9f34c608686d49a586fa7ebaf286c374 [2021-05-02 23:31:42,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:31:42,285 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:31:42,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:31:42,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:31:42,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:31:42,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:31:42" (1/1) ... [2021-05-02 23:31:42,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7a7830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:42, skipping insertion in model container [2021-05-02 23:31:42,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:31:42" (1/1) ... [2021-05-02 23:31:42,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:31:42,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:31:42,437 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i[893,906] [2021-05-02 23:31:42,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:31:42,454 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:31:42,502 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i[893,906] [2021-05-02 23:31:42,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:31:42,523 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:31:42,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:42 WrapperNode [2021-05-02 23:31:42,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:31:42,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:31:42,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:31:42,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:31:42,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:42" (1/1) ... [2021-05-02 23:31:42,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:42" (1/1) ... [2021-05-02 23:31:42,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:42" (1/1) ... [2021-05-02 23:31:42,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:42" (1/1) ... [2021-05-02 23:31:42,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:42" (1/1) ... [2021-05-02 23:31:42,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:42" (1/1) ... [2021-05-02 23:31:42,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:42" (1/1) ... [2021-05-02 23:31:42,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:31:42,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:31:42,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:31:42,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:31:42,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:31:42,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:31:42,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:31:42,676 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:31:42,676 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 23:31:42,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:31:42,677 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:31:42,677 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:31:42,677 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:31:42,677 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 23:31:42,677 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 23:31:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:31:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:31:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 23:31:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:31:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 23:31:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:31:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:31:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:31:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:31:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:31:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:31:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:31:42,864 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:31:42,864 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-05-02 23:31:42,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:31:42 BoogieIcfgContainer [2021-05-02 23:31:42,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:31:42,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:31:42,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:31:42,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:31:42,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:31:42" (1/3) ... [2021-05-02 23:31:42,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:31:42, skipping insertion in model container [2021-05-02 23:31:42,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:42" (2/3) ... [2021-05-02 23:31:42,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:31:42, skipping insertion in model container [2021-05-02 23:31:42,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:31:42" (3/3) ... [2021-05-02 23:31:42,870 INFO L111 eAbstractionObserver]: Analyzing ICFG nested6.i [2021-05-02 23:31:42,873 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:31:42,875 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:31:42,886 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:31:42,900 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:31:42,900 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:31:42,900 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:31:42,900 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:31:42,900 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:31:42,900 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:31:42,900 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:31:42,900 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:31:42,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 22 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 23:31:42,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 23:31:42,913 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:42,913 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:42,914 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:42,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:42,917 INFO L82 PathProgramCache]: Analyzing trace with hash -380972064, now seen corresponding path program 1 times [2021-05-02 23:31:42,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:42,922 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1333895091] [2021-05-02 23:31:42,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:42,960 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:43,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:43,147 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:43,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1333895091] [2021-05-02 23:31:43,148 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1333895091] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:43,148 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:43,149 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:31:43,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27938561] [2021-05-02 23:31:43,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:31:43,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:43,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:31:43,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:31:43,163 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 22 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:43,521 INFO L93 Difference]: Finished difference Result 58 states and 81 transitions. [2021-05-02 23:31:43,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:31:43,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-02 23:31:43,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:43,528 INFO L225 Difference]: With dead ends: 58 [2021-05-02 23:31:43,529 INFO L226 Difference]: Without dead ends: 29 [2021-05-02 23:31:43,532 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 130.0ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:31:43,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-02 23:31:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-05-02 23:31:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 23:31:43,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-05-02 23:31:43,581 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2021-05-02 23:31:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:43,581 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-05-02 23:31:43,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-05-02 23:31:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:31:43,582 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:43,583 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:43,583 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:31:43,583 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:43,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:43,586 INFO L82 PathProgramCache]: Analyzing trace with hash 580085489, now seen corresponding path program 1 times [2021-05-02 23:31:43,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:43,587 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1921699918] [2021-05-02 23:31:43,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:43,598 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:43,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:43,738 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:43,738 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1921699918] [2021-05-02 23:31:43,738 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1921699918] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:43,738 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:43,738 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:31:43,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339721472] [2021-05-02 23:31:43,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:31:43,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:43,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:31:43,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:31:43,740 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:44,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:44,003 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2021-05-02 23:31:44,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:31:44,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 23:31:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:44,006 INFO L225 Difference]: With dead ends: 41 [2021-05-02 23:31:44,007 INFO L226 Difference]: Without dead ends: 39 [2021-05-02 23:31:44,009 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 132.0ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:31:44,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-02 23:31:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2021-05-02 23:31:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 23:31:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2021-05-02 23:31:44,020 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2021-05-02 23:31:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:44,020 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-05-02 23:31:44,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2021-05-02 23:31:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 23:31:44,021 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:44,021 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:44,022 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:31:44,022 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:44,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:44,022 INFO L82 PathProgramCache]: Analyzing trace with hash -132185391, now seen corresponding path program 1 times [2021-05-02 23:31:44,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:44,023 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1939884853] [2021-05-02 23:31:44,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:44,025 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:44,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:44,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-02 23:31:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:44,088 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:44,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1939884853] [2021-05-02 23:31:44,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1939884853] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:44,088 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:44,088 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:31:44,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426795792] [2021-05-02 23:31:44,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:31:44,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:44,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:31:44,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:31:44,089 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:31:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:44,250 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2021-05-02 23:31:44,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:31:44,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2021-05-02 23:31:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:44,253 INFO L225 Difference]: With dead ends: 46 [2021-05-02 23:31:44,253 INFO L226 Difference]: Without dead ends: 44 [2021-05-02 23:31:44,254 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 84.0ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:31:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-05-02 23:31:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-05-02 23:31:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-02 23:31:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2021-05-02 23:31:44,275 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2021-05-02 23:31:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:44,275 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2021-05-02 23:31:44,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:31:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2021-05-02 23:31:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-02 23:31:44,277 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:44,278 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:44,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:31:44,278 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:44,278 INFO L82 PathProgramCache]: Analyzing trace with hash -512108736, now seen corresponding path program 1 times [2021-05-02 23:31:44,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:44,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [892999787] [2021-05-02 23:31:44,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:44,295 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-02 23:31:44,307 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:44,326 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:31:44,334 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:44,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:44,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-02 23:31:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:44,415 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:44,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:44,437 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:44,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [892999787] [2021-05-02 23:31:44,438 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [892999787] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:44,438 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:44,438 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:31:44,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522333054] [2021-05-02 23:31:44,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:31:44,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:44,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:31:44,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:31:44,439 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 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) [2021-05-02 23:31:44,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:44,678 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2021-05-02 23:31:44,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:31:44,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 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 25 [2021-05-02 23:31:44,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:44,679 INFO L225 Difference]: With dead ends: 83 [2021-05-02 23:31:44,679 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 23:31:44,680 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 139.8ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:31:44,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 23:31:44,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2021-05-02 23:31:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-05-02 23:31:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2021-05-02 23:31:44,687 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 25 [2021-05-02 23:31:44,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:44,687 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2021-05-02 23:31:44,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 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) [2021-05-02 23:31:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2021-05-02 23:31:44,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-02 23:31:44,688 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:44,688 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:44,688 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:31:44,688 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:44,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:44,688 INFO L82 PathProgramCache]: Analyzing trace with hash 735221632, now seen corresponding path program 1 times [2021-05-02 23:31:44,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:44,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [596095788] [2021-05-02 23:31:44,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:44,743 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse1 (+ v_main_~j~0_13 1)) (.cse0 (* 2 v_main_~i~0_12))) (and (not (= |v_main_#t~nondet7_12| 0)) (<= 0 (+ |v_main_#t~nondet7_12| 2147483648)) (<= v_main_~n~0_20 (+ v_main_~j~0_13 2)) (<= |v_main_#t~nondet7_12| 2147483647) (<= .cse0 .cse1) (< .cse1 v_main_~n~0_20) (< v_main_~j~0_13 v_main_~n~0_20) (<= .cse0 v_main_~j~0_13))) InVars {main_~i~0=v_main_~i~0_12, main_#t~nondet7=|v_main_#t~nondet7_12|, main_~n~0=v_main_~n~0_20, main_~j~0=v_main_~j~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~nondet7=|v_main_#t~nondet7_12|, main_~n~0=v_main_~n~0_20, main_~j~0=v_main_~j~0_13} AuxVars[] AssignedVars[] [2021-05-02 23:31:44,752 WARN L240 tifierPushTermWalker]: treesize reduction 68, result has 70.7 percent of original size [2021-05-02 23:31:44,772 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:44,774 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:44,784 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:31:44,801 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-05-02 23:31:44,896 WARN L245 tifierPushTermWalker]: treesize reduction 68, result has 70.7 percent of original size 164 [2021-05-02 23:31:44,949 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-02 23:31:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:45,056 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:45,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:45,086 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:45,126 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:45,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:45,151 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:45,177 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:45,198 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:45,209 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:45,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:45,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:45,308 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:45,310 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:45,350 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:45,352 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,434 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,445 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:51,513 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:51,515 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:53,566 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:53,567 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:53,570 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:53,571 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:53,575 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:53,609 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:53,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:53,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:53,640 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:53,640 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [596095788] [2021-05-02 23:31:53,640 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [596095788] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:53,641 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:53,641 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-02 23:31:53,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079391610] [2021-05-02 23:31:53,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-02 23:31:53,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:53,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-02 23:31:53,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=309, Unknown=3, NotChecked=0, Total=380 [2021-05-02 23:31:53,642 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 23:31:55,464 WARN L205 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2021-05-02 23:32:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:32:01,943 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2021-05-02 23:32:01,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-02 23:32:01,944 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 39 [2021-05-02 23:32:01,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:32:01,945 INFO L225 Difference]: With dead ends: 89 [2021-05-02 23:32:01,945 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 23:32:01,946 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 10443.7ms TimeCoverageRelationStatistics Valid=204, Invalid=1053, Unknown=3, NotChecked=0, Total=1260 [2021-05-02 23:32:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 23:32:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 23:32:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-02 23:32:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 23:32:01,946 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2021-05-02 23:32:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:32:01,946 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 23:32:01,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 23:32:01,947 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 23:32:01,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 23:32:01,947 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:32:01,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 23:32:16,487 WARN L205 SmtUtils]: Spent 14.21 s on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2021-05-02 23:32:16,966 WARN L205 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2021-05-02 23:32:17,297 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-02 23:32:17,297 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-02 23:32:17,297 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-02 23:32:17,297 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:32:17,297 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2021-05-02 23:32:17,297 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:32:17,297 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:32:17,297 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 23:32:17,297 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 23:32:17,297 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:32:17,297 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-02 23:32:17,298 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:32:17,298 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:32:17,298 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:32:17,298 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 24 48) the Hoare annotation is: true [2021-05-02 23:32:17,298 INFO L194 CegarLoopUtils]: At program point L36-2(lines 36 38) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (or (and (<= .cse0 main_~j~0) (exists ((v_main_~n~0_BEFORE_RETURN_1 Int) (v_main_~j~0_BEFORE_RETURN_1 Int) (v_main_~i~0_13 Int)) (let ((.cse1 (ite (<= (* 2 v_main_~i~0_13) v_main_~j~0_BEFORE_RETURN_1) 1 0))) (and (= .cse1 (ite (<= (+ (* 2 main_~i~0) 1) main_~k~0) 1 0)) (not (= .cse1 0)) (< v_main_~j~0_BEFORE_RETURN_1 v_main_~n~0_BEFORE_RETURN_1)))) (<= main_~k~0 main_~n~0)) (and (= main_~k~0 main_~j~0) (<= .cse0 main_~k~0) (< main_~j~0 main_~n~0)))) [2021-05-02 23:32:17,298 INFO L201 CegarLoopUtils]: At program point L28(line 28) the Hoare annotation is: true [2021-05-02 23:32:17,298 INFO L194 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: (and (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 main_~k~0) (<= main_~k~0 main_~n~0)) [2021-05-02 23:32:17,298 INFO L194 CegarLoopUtils]: At program point L41-1(line 41) the Hoare annotation is: (and (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 main_~k~0) (<= main_~k~0 main_~n~0)) [2021-05-02 23:32:17,299 INFO L194 CegarLoopUtils]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (or (and (= main_~k~0 main_~j~0) (<= .cse0 main_~k~0) (< main_~j~0 main_~n~0)) (and (<= .cse0 main_~j~0) (exists ((v_main_~n~0_BEFORE_RETURN_1 Int) (v_main_~j~0_BEFORE_RETURN_1 Int) (v_main_~i~0_13 Int)) (let ((.cse1 (ite (<= (* 2 v_main_~i~0_13) v_main_~j~0_BEFORE_RETURN_1) 1 0))) (and (= .cse1 (ite (<= (+ (* 2 main_~i~0) 1) main_~k~0) 1 0)) (not (= .cse1 0)) (< v_main_~j~0_BEFORE_RETURN_1 v_main_~n~0_BEFORE_RETURN_1)))) (< main_~k~0 main_~n~0)))) [2021-05-02 23:32:17,299 INFO L194 CegarLoopUtils]: At program point L37-1(lines 36 38) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (or (and (= main_~k~0 main_~j~0) (<= .cse0 main_~k~0) (< main_~j~0 main_~n~0)) (and (<= .cse0 main_~j~0) (exists ((v_main_~n~0_BEFORE_RETURN_1 Int) (v_main_~j~0_BEFORE_RETURN_1 Int) (v_main_~i~0_13 Int)) (let ((.cse1 (ite (<= (* 2 v_main_~i~0_13) v_main_~j~0_BEFORE_RETURN_1) 1 0))) (and (= .cse1 (ite (<= (+ (* 2 main_~i~0) 1) main_~k~0) 1 0)) (not (= .cse1 0)) (< v_main_~j~0_BEFORE_RETURN_1 v_main_~n~0_BEFORE_RETURN_1)))) (< main_~k~0 main_~n~0)))) [2021-05-02 23:32:17,299 INFO L194 CegarLoopUtils]: At program point L33-2(lines 33 45) the Hoare annotation is: (and (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 main_~k~0) (<= main_~k~0 main_~n~0)) [2021-05-02 23:32:17,299 INFO L194 CegarLoopUtils]: At program point L33-3(lines 33 45) the Hoare annotation is: (and (<= main_~n~0 main_~k~0) (<= main_~k~0 main_~n~0)) [2021-05-02 23:32:17,299 INFO L201 CegarLoopUtils]: At program point L29(lines 29 32) the Hoare annotation is: true [2021-05-02 23:32:17,299 INFO L194 CegarLoopUtils]: At program point L29-1(lines 29 32) the Hoare annotation is: (and (<= main_~n~0 main_~k~0) (<= main_~k~0 main_~n~0)) [2021-05-02 23:32:17,299 INFO L201 CegarLoopUtils]: At program point L46(lines 24 48) the Hoare annotation is: true [2021-05-02 23:32:17,299 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 24 48) the Hoare annotation is: true [2021-05-02 23:32:17,299 INFO L194 CegarLoopUtils]: At program point L42(lines 34 44) the Hoare annotation is: (and (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 main_~k~0) (<= main_~k~0 main_~n~0)) [2021-05-02 23:32:17,300 INFO L194 CegarLoopUtils]: At program point L34-2(lines 34 44) the Hoare annotation is: (and (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 main_~k~0) (<= main_~k~0 main_~n~0)) [2021-05-02 23:32:17,300 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 48) the Hoare annotation is: true [2021-05-02 23:32:17,300 INFO L194 CegarLoopUtils]: At program point L35(lines 35 43) the Hoare annotation is: (and (<= (* 2 main_~i~0) main_~j~0) (< main_~j~0 main_~n~0) (<= 0 (+ |main_#t~nondet7| 2147483648)) (<= main_~n~0 main_~k~0) (<= main_~k~0 main_~n~0) (<= |main_#t~nondet7| 2147483647)) [2021-05-02 23:32:17,300 INFO L194 CegarLoopUtils]: At program point L18-2(lines 17 22) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) (or (forall ((v_main_~k~0_33 Int) (v_main_~i~0_14 Int)) (or (not (= |__VERIFIER_assert_#in~cond| (ite (<= (* 2 v_main_~i~0_14) v_main_~k~0_33) 1 0))) (forall ((v_main_~n~0_BEFORE_RETURN_1 Int) (v_main_~j~0_BEFORE_RETURN_1 Int) (v_main_~i~0_13 Int)) (let ((.cse0 (ite (<= (* 2 v_main_~i~0_13) v_main_~j~0_BEFORE_RETURN_1) 1 0))) (or (not (= .cse0 (ite (<= (+ (* 2 v_main_~i~0_14) 1) v_main_~k~0_33) 1 0))) (not (< v_main_~j~0_BEFORE_RETURN_1 v_main_~n~0_BEFORE_RETURN_1)) (= .cse0 0)))) (not (< v_main_~k~0_33 main_~n~0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) [2021-05-02 23:32:17,300 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-02 23:32:17,300 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) (or (forall ((v_main_~k~0_33 Int) (v_main_~i~0_14 Int)) (or (not (= |__VERIFIER_assert_#in~cond| (ite (<= (* 2 v_main_~i~0_14) v_main_~k~0_33) 1 0))) (forall ((v_main_~n~0_BEFORE_RETURN_1 Int) (v_main_~j~0_BEFORE_RETURN_1 Int) (v_main_~i~0_13 Int)) (let ((.cse0 (ite (<= (* 2 v_main_~i~0_13) v_main_~j~0_BEFORE_RETURN_1) 1 0))) (or (not (= .cse0 (ite (<= (+ (* 2 v_main_~i~0_14) 1) v_main_~k~0_33) 1 0))) (not (< v_main_~j~0_BEFORE_RETURN_1 v_main_~n~0_BEFORE_RETURN_1)) (= .cse0 0)))) (not (< v_main_~k~0_33 main_~n~0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) [2021-05-02 23:32:17,300 INFO L194 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-02 23:32:17,300 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-02 23:32:17,300 INFO L194 CegarLoopUtils]: At program point L18(lines 18 20) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) (or (forall ((v_main_~k~0_33 Int) (v_main_~i~0_14 Int)) (or (not (= |__VERIFIER_assert_#in~cond| (ite (<= (* 2 v_main_~i~0_14) v_main_~k~0_33) 1 0))) (forall ((v_main_~n~0_BEFORE_RETURN_1 Int) (v_main_~j~0_BEFORE_RETURN_1 Int) (v_main_~i~0_13 Int)) (let ((.cse0 (ite (<= (* 2 v_main_~i~0_13) v_main_~j~0_BEFORE_RETURN_1) 1 0))) (or (not (= .cse0 (ite (<= (+ (* 2 v_main_~i~0_14) 1) v_main_~k~0_33) 1 0))) (not (< v_main_~j~0_BEFORE_RETURN_1 v_main_~n~0_BEFORE_RETURN_1)) (= .cse0 0)))) (not (< v_main_~k~0_33 main_~n~0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) [2021-05-02 23:32:17,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2021-05-02 23:32:17,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2021-05-02 23:32:17,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2021-05-02 23:32:17,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2021-05-02 23:32:17,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_14,QUANTIFIED] [2021-05-02 23:32:17,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_33,QUANTIFIED] [2021-05-02 23:32:17,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2021-05-02 23:32:17,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_14,QUANTIFIED] [2021-05-02 23:32:17,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_33,QUANTIFIED] [2021-05-02 23:32:17,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2021-05-02 23:32:17,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_33,QUANTIFIED] [2021-05-02 23:32:17,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:32:17 BoogieIcfgContainer [2021-05-02 23:32:17,316 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 23:32:17,316 INFO L168 Benchmark]: Toolchain (without parser) took 35031.97 ms. Allocated memory was 159.4 MB in the beginning and 191.9 MB in the end (delta: 32.5 MB). Free memory was 124.7 MB in the beginning and 136.0 MB in the end (delta: -11.3 MB). Peak memory consumption was 92.1 MB. Max. memory is 8.0 GB. [2021-05-02 23:32:17,317 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 159.4 MB. Free memory is still 141.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 23:32:17,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.18 ms. Allocated memory is still 159.4 MB. Free memory was 124.5 MB in the beginning and 143.0 MB in the end (delta: -18.5 MB). Peak memory consumption was 11.9 MB. Max. memory is 8.0 GB. [2021-05-02 23:32:17,317 INFO L168 Benchmark]: Boogie Preprocessor took 33.84 ms. Allocated memory is still 159.4 MB. Free memory was 143.0 MB in the beginning and 141.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-02 23:32:17,320 INFO L168 Benchmark]: RCFGBuilder took 304.65 ms. Allocated memory is still 159.4 MB. Free memory was 141.4 MB in the beginning and 125.7 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-05-02 23:32:17,320 INFO L168 Benchmark]: TraceAbstraction took 34449.73 ms. Allocated memory was 159.4 MB in the beginning and 191.9 MB in the end (delta: 32.5 MB). Free memory was 125.0 MB in the beginning and 136.0 MB in the end (delta: -11.1 MB). Peak memory consumption was 92.8 MB. Max. memory is 8.0 GB. [2021-05-02 23:32:17,321 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 159.4 MB. Free memory is still 141.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 235.18 ms. Allocated memory is still 159.4 MB. Free memory was 124.5 MB in the beginning and 143.0 MB in the end (delta: -18.5 MB). Peak memory consumption was 11.9 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 33.84 ms. Allocated memory is still 159.4 MB. Free memory was 143.0 MB in the beginning and 141.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 304.65 ms. Allocated memory is still 159.4 MB. Free memory was 141.4 MB in the beginning and 125.7 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 34449.73 ms. Allocated memory was 159.4 MB in the beginning and 191.9 MB in the end (delta: 32.5 MB). Free memory was 125.0 MB in the beginning and 136.0 MB in the end (delta: -11.1 MB). Peak memory consumption was 92.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_33,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 19049.1ms, OverallIterations: 5, TraceHistogramMax: 4, EmptinessCheckTime: 10.1ms, AutomataDifference: 9358.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 15349.1ms, InitialAbstractionConstructionTime: 6.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 115 SDtfs, 185 SDslu, 171 SDs, 0 SdLazy, 732 SolverSat, 112 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 6692.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 10929.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=4, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 76.2ms AutomataMinimizationTime, 5 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 30 LocationsWithAnnotation, 144 PreInvPairs, 193 NumberOfFragments, 510 HoareAnnotationTreeSize, 144 FomulaSimplifications, 1316 FormulaSimplificationTreeSizeReduction, 168.2ms HoareSimplificationTime, 30 FomulaSimplificationsInter, 1588 FormulaSimplificationTreeSizeReductionInter, 15135.3ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant [2021-05-02 23:32:17,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2021-05-02 23:32:17,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2021-05-02 23:32:17,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2021-05-02 23:32:17,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2021-05-02 23:32:17,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_RETURN_1,QUANTIFIED] Derived loop invariant: ((2 * i <= j && (\exists v_main_~n~0_BEFORE_RETURN_1 : int, v_main_~j~0_BEFORE_RETURN_1 : int, v_main_~i~0_13 : int :: ((if 2 * v_main_~i~0_13 <= v_main_~j~0_BEFORE_RETURN_1 then 1 else 0) == (if 2 * i + 1 <= k then 1 else 0) && !((if 2 * v_main_~i~0_13 <= v_main_~j~0_BEFORE_RETURN_1 then 1 else 0) == 0)) && v_main_~j~0_BEFORE_RETURN_1 < v_main_~n~0_BEFORE_RETURN_1)) && k <= n) || ((k == j && 2 * i <= k) && j < n) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: n <= k && k <= n - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (2 * i <= j && n <= k) && k <= n - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert [2021-05-02 23:32:17,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_14,QUANTIFIED] [2021-05-02 23:32:17,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_33,QUANTIFIED] [2021-05-02 23:32:17,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2021-05-02 23:32:17,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_14,QUANTIFIED] [2021-05-02 23:32:17,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_33,QUANTIFIED] [2021-05-02 23:32:17,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2021-05-02 23:32:17,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_33,QUANTIFIED] [2021-05-02 23:32:17,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_14,QUANTIFIED] [2021-05-02 23:32:17,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_33,QUANTIFIED] [2021-05-02 23:32:17,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2021-05-02 23:32:17,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_14,QUANTIFIED] [2021-05-02 23:32:17,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_33,QUANTIFIED] [2021-05-02 23:32:17,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2021-05-02 23:32:17,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-02 23:32:17,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_33,QUANTIFIED] Derived contract for procedure __VERIFIER_assert: (\old(cond) == 0 || !(cond == 0)) && ((forall v_main_~k~0_33 : int, v_main_~i~0_14 : int :: (!(\old(cond) == (if 2 * v_main_~i~0_14 <= v_main_~k~0_33 then 1 else 0)) || (forall v_main_~n~0_BEFORE_RETURN_1 : int, v_main_~j~0_BEFORE_RETURN_1 : int, v_main_~i~0_13 : int :: (!((if 2 * v_main_~i~0_13 <= v_main_~j~0_BEFORE_RETURN_1 then 1 else 0) == (if 2 * v_main_~i~0_14 + 1 <= v_main_~k~0_33 then 1 else 0)) || !(v_main_~j~0_BEFORE_RETURN_1 < v_main_~n~0_BEFORE_RETURN_1)) || (if 2 * v_main_~i~0_13 <= v_main_~j~0_BEFORE_RETURN_1 then 1 else 0) == 0)) || !(v_main_~k~0_33 < n)) || \old(cond) == cond) RESULT: Ultimate proved your program to be correct! Received shutdown request...