/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-lit/gj2007b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:41:44,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:41:44,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:41:44,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:41:44,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:41:44,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:41:44,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:41:44,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:41:44,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:41:44,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:41:44,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:41:44,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:41:44,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:41:44,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:41:44,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:41:44,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:41:44,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:41:44,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:41:44,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:41:44,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:41:44,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:41:44,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:41:44,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:41:44,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:41:44,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:41:44,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:41:44,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:41:44,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:41:44,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:41:44,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:41:44,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:41:44,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:41:44,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:41:44,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:41:44,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:41:44,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:41:44,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:41:44,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:41:44,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:41:44,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:41:44,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:41:44,603 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:41:44,626 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:41:44,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:41:44,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:41:44,632 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:41:44,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:41:44,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:41:44,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:41:44,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:41:44,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:41:44,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:41:44,635 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:41:44,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:41:44,635 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:41:44,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:41:44,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:41:44,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:41:44,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:41:44,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:41:44,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:41:44,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:41:44,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:41:44,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:41:44,637 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:41:44,637 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:41:45,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:41:45,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:41:45,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:41:45,048 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:41:45,049 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:41:45,050 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007b.i [2021-05-02 23:41:45,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4ecf5126/1949e59072af438c84f9613cd9d85c37/FLAG73a0a9e9a [2021-05-02 23:41:45,702 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:41:45,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i [2021-05-02 23:41:45,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4ecf5126/1949e59072af438c84f9613cd9d85c37/FLAG73a0a9e9a [2021-05-02 23:41:46,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4ecf5126/1949e59072af438c84f9613cd9d85c37 [2021-05-02 23:41:46,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:41:46,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:41:46,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:41:46,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:41:46,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:41:46,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:41:46" (1/1) ... [2021-05-02 23:41:46,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795a619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:41:46, skipping insertion in model container [2021-05-02 23:41:46,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:41:46" (1/1) ... [2021-05-02 23:41:46,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:41:46,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:41:46,283 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-lit/gj2007b.i[895,908] [2021-05-02 23:41:46,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:41:46,302 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:41:46,313 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-lit/gj2007b.i[895,908] [2021-05-02 23:41:46,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:41:46,330 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:41:46,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:41:46 WrapperNode [2021-05-02 23:41:46,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:41:46,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:41:46,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:41:46,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:41:46,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:41:46" (1/1) ... [2021-05-02 23:41:46,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:41:46" (1/1) ... [2021-05-02 23:41:46,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:41:46" (1/1) ... [2021-05-02 23:41:46,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:41:46" (1/1) ... [2021-05-02 23:41:46,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:41:46" (1/1) ... [2021-05-02 23:41:46,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:41:46" (1/1) ... [2021-05-02 23:41:46,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:41:46" (1/1) ... [2021-05-02 23:41:46,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:41:46,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:41:46,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:41:46,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:41:46,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:41:46" (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:41:46,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:41:46,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:41:46,529 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:41:46,529 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 23:41:46,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:41:46,530 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:41:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:41:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:41:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 23:41:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 23:41:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:41:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:41:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 23:41:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:41:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 23:41:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:41:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:41:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:41:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:41:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:41:46,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:41:46,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:41:46,830 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:41:46,831 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 23:41:46,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:41:46 BoogieIcfgContainer [2021-05-02 23:41:46,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:41:46,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:41:46,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:41:46,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:41:46,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:41:46" (1/3) ... [2021-05-02 23:41:46,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c39607a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:41:46, skipping insertion in model container [2021-05-02 23:41:46,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:41:46" (2/3) ... [2021-05-02 23:41:46,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c39607a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:41:46, skipping insertion in model container [2021-05-02 23:41:46,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:41:46" (3/3) ... [2021-05-02 23:41:46,858 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007b.i [2021-05-02 23:41:46,864 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:41:46,885 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:41:46,904 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:41:46,938 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:41:46,939 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:41:46,939 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:41:46,939 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:41:46,939 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:41:46,939 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:41:46,939 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:41:46,939 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:41:46,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 23:41:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:41:46,990 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:41:46,991 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:41:46,991 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:41:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:41:47,014 INFO L82 PathProgramCache]: Analyzing trace with hash -915508507, now seen corresponding path program 1 times [2021-05-02 23:41:47,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:41:47,023 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [371984757] [2021-05-02 23:41:47,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:41:47,101 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:41:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:47,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:41:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:47,315 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:41:47,318 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:41:47,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [371984757] [2021-05-02 23:41:47,321 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [371984757] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:41:47,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:41:47,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 23:41:47,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901468589] [2021-05-02 23:41:47,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 23:41:47,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:41:47,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 23:41:47,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:41:47,344 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:41:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:41:47,452 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2021-05-02 23:41:47,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 23:41:47,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2021-05-02 23:41:47,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:41:47,464 INFO L225 Difference]: With dead ends: 35 [2021-05-02 23:41:47,465 INFO L226 Difference]: Without dead ends: 17 [2021-05-02 23:41:47,469 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:41:47,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-02 23:41:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-05-02 23:41:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:41:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-05-02 23:41:47,513 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2021-05-02 23:41:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:41:47,515 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-05-02 23:41:47,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:41:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-05-02 23:41:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:41:47,517 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:41:47,517 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:41:47,518 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:41:47,518 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:41:47,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:41:47,520 INFO L82 PathProgramCache]: Analyzing trace with hash -925667238, now seen corresponding path program 1 times [2021-05-02 23:41:47,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:41:47,520 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1102121325] [2021-05-02 23:41:47,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:41:47,534 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:41:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:47,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:41:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:47,657 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:41:47,658 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:41:47,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1102121325] [2021-05-02 23:41:47,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1102121325] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:41:47,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:41:47,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:41:47,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729928417] [2021-05-02 23:41:47,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:41:47,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:41:47,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:41:47,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:41:47,661 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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:41:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:41:47,856 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-05-02 23:41:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:41:47,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2021-05-02 23:41:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:41:47,859 INFO L225 Difference]: With dead ends: 28 [2021-05-02 23:41:47,860 INFO L226 Difference]: Without dead ends: 26 [2021-05-02 23:41:47,862 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 139.9ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:41:47,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-05-02 23:41:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-05-02 23:41:47,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 23:41:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-05-02 23:41:47,889 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2021-05-02 23:41:47,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:41:47,890 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-05-02 23:41:47,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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:41:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2021-05-02 23:41:47,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 23:41:47,891 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:41:47,892 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:41:47,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:41:47,892 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:41:47,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:41:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1147629988, now seen corresponding path program 1 times [2021-05-02 23:41:47,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:41:47,894 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1377358011] [2021-05-02 23:41:47,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:41:47,961 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_8 v_main_~n~0_8) (<= 0 (+ |v_main_#t~nondet4_7| 2147483648)) (<= |v_main_#t~nondet4_7| 2147483647) (not (= |v_main_#t~nondet4_7| 0))) InVars {main_#t~nondet4=|v_main_#t~nondet4_7|, main_~n~0=v_main_~n~0_8, main_~x~0=v_main_~x~0_8} OutVars{main_#t~nondet4=|v_main_#t~nondet4_7|, main_~n~0=v_main_~n~0_8, main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] [2021-05-02 23:41:47,979 WARN L240 tifierPushTermWalker]: treesize reduction 10, result has 91.5 percent of original size [2021-05-02 23:41:47,986 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:41:47,989 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:41:48,010 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:41:48,029 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-05-02 23:41:48,134 WARN L245 tifierPushTermWalker]: treesize reduction 10, result has 91.5 percent of original size 107 [2021-05-02 23:41:48,184 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:41:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:48,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:41:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:48,296 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:41:48,307 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:41:48,458 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:41:48,499 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:41:48,499 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1377358011] [2021-05-02 23:41:48,499 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1377358011] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:41:48,500 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:41:48,500 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:41:48,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093651354] [2021-05-02 23:41:48,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:41:48,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:41:48,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:41:48,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:41:48,502 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:41:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:41:48,997 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2021-05-02 23:41:48,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 23:41:48,998 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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 14 [2021-05-02 23:41:48,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:41:49,002 INFO L225 Difference]: With dead ends: 46 [2021-05-02 23:41:49,002 INFO L226 Difference]: Without dead ends: 40 [2021-05-02 23:41:49,003 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 459.3ms TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2021-05-02 23:41:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-02 23:41:49,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2021-05-02 23:41:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 23:41:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-05-02 23:41:49,013 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2021-05-02 23:41:49,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:41:49,014 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-05-02 23:41:49,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:41:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-05-02 23:41:49,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:41:49,015 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:41:49,015 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:41:49,015 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:41:49,016 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:41:49,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:41:49,016 INFO L82 PathProgramCache]: Analyzing trace with hash 427578968, now seen corresponding path program 1 times [2021-05-02 23:41:49,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:41:49,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [661018280] [2021-05-02 23:41:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:41:49,024 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:41:49,026 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:41:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:49,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:41:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:49,108 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:41:49,109 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:41:49,109 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [661018280] [2021-05-02 23:41:49,109 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [661018280] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:41:49,109 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:41:49,109 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:41:49,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280129691] [2021-05-02 23:41:49,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:41:49,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:41:49,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:41:49,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:41:49,111 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 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:41:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:41:49,380 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2021-05-02 23:41:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:41:49,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 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:41:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:41:49,383 INFO L225 Difference]: With dead ends: 46 [2021-05-02 23:41:49,383 INFO L226 Difference]: Without dead ends: 42 [2021-05-02 23:41:49,384 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 173.1ms TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:41:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-05-02 23:41:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 23. [2021-05-02 23:41:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:41:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2021-05-02 23:41:49,392 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2021-05-02 23:41:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:41:49,392 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2021-05-02 23:41:49,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 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:41:49,393 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2021-05-02 23:41:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 23:41:49,393 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:41:49,393 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:41:49,393 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:41:49,394 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:41:49,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:41:49,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1930189671, now seen corresponding path program 1 times [2021-05-02 23:41:49,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:41:49,395 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1387495832] [2021-05-02 23:41:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:41:49,401 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= |v_main_#t~nondet4_17| 0) (< v_main_~x~0_18 v_main_~n~0_12)) InVars {main_#t~nondet4=|v_main_#t~nondet4_17|, main_~n~0=v_main_~n~0_12, main_~x~0=v_main_~x~0_18} OutVars{main_#t~nondet4=|v_main_#t~nondet4_17|, main_~n~0=v_main_~n~0_12, main_~x~0=v_main_~x~0_18} AuxVars[] AssignedVars[] [2021-05-02 23:41:49,407 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.3 percent of original size [2021-05-02 23:41:49,410 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:41:49,411 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:41:49,417 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-02 23:41:49,425 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:41:49,466 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.3 percent of original size 65 [2021-05-02 23:41:49,486 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:41:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:49,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:41:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:49,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-02 23:41:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:49,592 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:41:49,602 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:41:49,651 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:41:49,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1387495832] [2021-05-02 23:41:49,652 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1387495832] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:41:49,652 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:41:49,652 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:41:49,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797520199] [2021-05-02 23:41:49,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:41:49,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:41:49,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:41:49,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:41:49,654 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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:41:49,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:41:49,928 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2021-05-02 23:41:49,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:41:49,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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 19 [2021-05-02 23:41:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:41:49,930 INFO L225 Difference]: With dead ends: 36 [2021-05-02 23:41:49,930 INFO L226 Difference]: Without dead ends: 26 [2021-05-02 23:41:49,931 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 232.6ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:41:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-05-02 23:41:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-05-02 23:41:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:41:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2021-05-02 23:41:49,939 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 19 [2021-05-02 23:41:49,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:41:49,939 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2021-05-02 23:41:49,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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:41:49,939 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2021-05-02 23:41:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 23:41:49,940 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:41:49,940 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:41:49,940 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:41:49,941 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:41:49,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:41:49,941 INFO L82 PathProgramCache]: Analyzing trace with hash 729032691, now seen corresponding path program 1 times [2021-05-02 23:41:49,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:41:49,941 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1263405575] [2021-05-02 23:41:49,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:41:49,947 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:41:49,948 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:41:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:50,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:41:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:50,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-02 23:41:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:50,031 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:41:50,031 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:41:50,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1263405575] [2021-05-02 23:41:50,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1263405575] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:41:50,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:41:50,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:41:50,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609487512] [2021-05-02 23:41:50,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:41:50,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:41:50,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:41:50,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:41:50,033 INFO L87 Difference]: Start difference. First operand 26 states and 29 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, (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:41:50,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:41:50,255 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-05-02 23:41:50,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:41:50,255 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, (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 22 [2021-05-02 23:41:50,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:41:50,256 INFO L225 Difference]: With dead ends: 26 [2021-05-02 23:41:50,256 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 23:41:50,257 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 180.3ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:41:50,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 23:41:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 23:41:50,257 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:41:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 23:41:50,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2021-05-02 23:41:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:41:50,258 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 23:41:50,258 INFO L481 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, (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:41:50,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 23:41:50,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 23:41:50,258 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 23:41:50,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 23:41:50,955 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-02 23:41:50,955 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-02 23:41:50,955 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-02 23:41:50,956 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:41:50,956 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:41:50,957 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:41:50,957 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:41:50,957 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 23:41:50,957 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 23:41:50,957 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:41:50,957 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-02 23:41:50,957 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:41:50,957 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:41:50,957 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:41:50,957 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 37) the Hoare annotation is: true [2021-05-02 23:41:50,958 INFO L194 CegarLoopUtils]: At program point L29(lines 29 31) the Hoare annotation is: (or (and (<= 0 main_~m~0) (<= 1 main_~x~0) (<= (+ main_~m~0 1) main_~n~0) (<= (+ main_~x~0 1) main_~n~0)) (and (< main_~x~0 main_~n~0) (= main_~m~0 0) (<= 0 (+ |main_#t~nondet4| 2147483648)) (<= |main_#t~nondet4| 2147483647) (= main_~x~0 0))) [2021-05-02 23:41:50,958 INFO L194 CegarLoopUtils]: At program point L29-2(lines 29 31) the Hoare annotation is: (and (let ((.cse0 (<= 0 main_~m~0))) (or (and .cse0 (= main_~x~0 0)) (and .cse0 (<= 1 main_~x~0)))) (<= (+ main_~m~0 1) main_~n~0) (<= (+ main_~x~0 1) main_~n~0)) [2021-05-02 23:41:50,958 INFO L194 CegarLoopUtils]: At program point L28-2(lines 28 33) the Hoare annotation is: (or (and (= main_~m~0 0) (= main_~x~0 0)) (and (<= 0 main_~m~0) (<= 1 main_~x~0) (<= (+ main_~m~0 1) main_~n~0))) [2021-05-02 23:41:50,958 INFO L194 CegarLoopUtils]: At program point L28-3(lines 28 33) the Hoare annotation is: (or (and (= main_~m~0 0) (= main_~x~0 0)) (and (<= 0 main_~m~0) (<= 1 main_~x~0) (<= (+ main_~m~0 1) main_~n~0))) [2021-05-02 23:41:50,958 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 24 37) the Hoare annotation is: true [2021-05-02 23:41:50,958 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 24 37) the Hoare annotation is: true [2021-05-02 23:41:50,958 INFO L201 CegarLoopUtils]: At program point L35(line 35) the Hoare annotation is: true [2021-05-02 23:41:50,958 INFO L194 CegarLoopUtils]: At program point L34(line 34) the Hoare annotation is: (or (and (<= 1 main_~x~0) (<= (+ main_~m~0 1) main_~n~0)) (and (= main_~m~0 0) (= main_~x~0 0))) [2021-05-02 23:41:50,958 INFO L194 CegarLoopUtils]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-02 23:41:50,959 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-02 23:41:50,959 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-02 23:41:50,959 INFO L194 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-02 23:41:50,959 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:41:50,959 INFO L194 CegarLoopUtils]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-02 23:41:50,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:41:50 BoogieIcfgContainer [2021-05-02 23:41:50,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 23:41:50,983 INFO L168 Benchmark]: Toolchain (without parser) took 4911.31 ms. Allocated memory was 201.3 MB in the beginning and 274.7 MB in the end (delta: 73.4 MB). Free memory was 168.1 MB in the beginning and 202.8 MB in the end (delta: -34.7 MB). Peak memory consumption was 145.1 MB. Max. memory is 8.0 GB. [2021-05-02 23:41:50,984 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 201.3 MB. Free memory is still 184.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 23:41:50,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.15 ms. Allocated memory is still 201.3 MB. Free memory was 167.9 MB in the beginning and 158.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-05-02 23:41:50,985 INFO L168 Benchmark]: Boogie Preprocessor took 55.16 ms. Allocated memory is still 201.3 MB. Free memory was 158.4 MB in the beginning and 156.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-02 23:41:50,988 INFO L168 Benchmark]: RCFGBuilder took 443.95 ms. Allocated memory is still 201.3 MB. Free memory was 156.9 MB in the beginning and 173.1 MB in the end (delta: -16.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-05-02 23:41:50,988 INFO L168 Benchmark]: TraceAbstraction took 4130.06 ms. Allocated memory was 201.3 MB in the beginning and 274.7 MB in the end (delta: 73.4 MB). Free memory was 172.4 MB in the beginning and 202.8 MB in the end (delta: -30.4 MB). Peak memory consumption was 148.8 MB. Max. memory is 8.0 GB. [2021-05-02 23:41:50,996 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.18 ms. Allocated memory is still 201.3 MB. Free memory is still 184.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 258.15 ms. Allocated memory is still 201.3 MB. Free memory was 167.9 MB in the beginning and 158.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 55.16 ms. Allocated memory is still 201.3 MB. Free memory was 158.4 MB in the beginning and 156.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 443.95 ms. Allocated memory is still 201.3 MB. Free memory was 156.9 MB in the beginning and 173.1 MB in the end (delta: -16.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4130.06 ms. Allocated memory was 201.3 MB in the beginning and 274.7 MB in the end (delta: 73.4 MB). Free memory was 172.4 MB in the beginning and 202.8 MB in the end (delta: -30.4 MB). Peak memory consumption was 148.8 MB. Max. memory is 8.0 GB. * 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, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3323.7ms, OverallIterations: 6, TraceHistogramMax: 2, EmptinessCheckTime: 30.9ms, AutomataDifference: 1617.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 695.4ms, InitialAbstractionConstructionTime: 24.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 91 SDtfs, 142 SDslu, 131 SDs, 0 SdLazy, 397 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 398.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1239.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=3, 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: 83.3ms AutomataMinimizationTime, 6 MinimizatonAttempts, 30 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 22 LocationsWithAnnotation, 76 PreInvPairs, 124 NumberOfFragments, 185 HoareAnnotationTreeSize, 76 FomulaSimplifications, 3203 FormulaSimplificationTreeSizeReduction, 213.6ms HoareSimplificationTime, 22 FomulaSimplificationsInter, 1303 FormulaSimplificationTreeSizeReductionInter, 459.0ms 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: 28]: Loop Invariant Derived loop invariant: (m == 0 && x == 0) || ((0 <= m && 1 <= x) && m + 1 <= n) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! Received shutdown request...