/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-zilu/benchmark05_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-03 00:33:19,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-03 00:33:19,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-03 00:33:19,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-03 00:33:19,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-03 00:33:19,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-03 00:33:19,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-03 00:33:19,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-03 00:33:19,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-03 00:33:19,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-03 00:33:19,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-03 00:33:19,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-03 00:33:19,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-03 00:33:19,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-03 00:33:19,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-03 00:33:19,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-03 00:33:19,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-03 00:33:19,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-03 00:33:19,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-03 00:33:19,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-03 00:33:19,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-03 00:33:19,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-03 00:33:19,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-03 00:33:19,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-03 00:33:19,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-03 00:33:19,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-03 00:33:19,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-03 00:33:19,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-03 00:33:19,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-03 00:33:19,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-03 00:33:19,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-03 00:33:19,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-03 00:33:19,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-03 00:33:19,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-03 00:33:19,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-03 00:33:19,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-03 00:33:19,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-03 00:33:19,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-03 00:33:19,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-03 00:33:19,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-03 00:33:19,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-03 00:33:19,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-03 00:33:19,633 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-03 00:33:19,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-03 00:33:19,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-03 00:33:19,636 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-03 00:33:19,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-03 00:33:19,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-03 00:33:19,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-03 00:33:19,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-03 00:33:19,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-03 00:33:19,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-03 00:33:19,637 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-03 00:33:19,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-03 00:33:19,637 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-03 00:33:19,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-03 00:33:19,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-03 00:33:19,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-03 00:33:19,638 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-03 00:33:19,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-03 00:33:19,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:33:19,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-03 00:33:19,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-03 00:33:19,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-03 00:33:19,639 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-03 00:33:19,639 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-03 00:33:19,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-03 00:33:19,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-03 00:33:19,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-03 00:33:19,930 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-03 00:33:19,931 INFO L275 PluginConnector]: CDTParser initialized [2021-05-03 00:33:19,931 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i [2021-05-03 00:33:19,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c009efd6e/77e18170f00a47a6bb9f07967f3eeb38/FLAGc450df911 [2021-05-03 00:33:20,277 INFO L306 CDTParser]: Found 1 translation units. [2021-05-03 00:33:20,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i [2021-05-03 00:33:20,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c009efd6e/77e18170f00a47a6bb9f07967f3eeb38/FLAGc450df911 [2021-05-03 00:33:20,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c009efd6e/77e18170f00a47a6bb9f07967f3eeb38 [2021-05-03 00:33:20,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-03 00:33:20,718 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-03 00:33:20,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-03 00:33:20,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-03 00:33:20,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-03 00:33:20,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:33:20" (1/1) ... [2021-05-03 00:33:20,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6c902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:33:20, skipping insertion in model container [2021-05-03 00:33:20,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:33:20" (1/1) ... [2021-05-03 00:33:20,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-03 00:33:20,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-03 00:33:20,816 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-zilu/benchmark05_conjunctive.i[873,886] [2021-05-03 00:33:20,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:33:20,827 INFO L203 MainTranslator]: Completed pre-run [2021-05-03 00:33:20,866 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-zilu/benchmark05_conjunctive.i[873,886] [2021-05-03 00:33:20,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:33:20,877 INFO L208 MainTranslator]: Completed translation [2021-05-03 00:33:20,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:33:20 WrapperNode [2021-05-03 00:33:20,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-03 00:33:20,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-03 00:33:20,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-03 00:33:20,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-03 00:33:20,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:33:20" (1/1) ... [2021-05-03 00:33:20,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:33:20" (1/1) ... [2021-05-03 00:33:20,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:33:20" (1/1) ... [2021-05-03 00:33:20,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:33:20" (1/1) ... [2021-05-03 00:33:20,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:33:20" (1/1) ... [2021-05-03 00:33:20,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:33:20" (1/1) ... [2021-05-03 00:33:20,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:33:20" (1/1) ... [2021-05-03 00:33:20,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-03 00:33:20,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-03 00:33:20,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-03 00:33:20,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-03 00:33:20,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:33:20" (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-03 00:33:20,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-03 00:33:20,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-03 00:33:20,961 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-03 00:33:20,961 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-03 00:33:20,961 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-03 00:33:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-03 00:33:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-03 00:33:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-03 00:33:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-03 00:33:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-03 00:33:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-03 00:33:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2021-05-03 00:33:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-03 00:33:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-03 00:33:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-03 00:33:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-03 00:33:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-03 00:33:20,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-03 00:33:20,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-03 00:33:20,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-03 00:33:21,161 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-03 00:33:21,161 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-03 00:33:21,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:33:21 BoogieIcfgContainer [2021-05-03 00:33:21,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-03 00:33:21,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-03 00:33:21,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-03 00:33:21,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-03 00:33:21,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:33:20" (1/3) ... [2021-05-03 00:33:21,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40597610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:33:21, skipping insertion in model container [2021-05-03 00:33:21,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:33:20" (2/3) ... [2021-05-03 00:33:21,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40597610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:33:21, skipping insertion in model container [2021-05-03 00:33:21,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:33:21" (3/3) ... [2021-05-03 00:33:21,167 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark05_conjunctive.i [2021-05-03 00:33:21,171 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-03 00:33:21,173 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-03 00:33:21,184 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-03 00:33:21,199 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-03 00:33:21,199 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-03 00:33:21,199 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-03 00:33:21,199 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-03 00:33:21,199 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-03 00:33:21,199 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-03 00:33:21,199 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-03 00:33:21,199 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-03 00:33:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-03 00:33:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-03 00:33:21,234 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:33:21,235 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:33:21,235 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:33:21,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:33:21,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1005951186, now seen corresponding path program 1 times [2021-05-03 00:33:21,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:33:21,244 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1673034405] [2021-05-03 00:33:21,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:33:21,314 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:33:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:33:21,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:33:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:33:21,492 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-03 00:33:21,493 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:33:21,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1673034405] [2021-05-03 00:33:21,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1673034405] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:33:21,495 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:33:21,496 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-03 00:33:21,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250724837] [2021-05-03 00:33:21,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-03 00:33:21,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:33:21,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-03 00:33:21,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-03 00:33:21,510 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-03 00:33:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:33:21,618 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2021-05-03 00:33:21,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-03 00:33:21,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2021-05-03 00:33:21,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:33:21,623 INFO L225 Difference]: With dead ends: 34 [2021-05-03 00:33:21,623 INFO L226 Difference]: Without dead ends: 15 [2021-05-03 00:33:21,626 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-03 00:33:21,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-05-03 00:33:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-05-03 00:33:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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-03 00:33:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-05-03 00:33:21,655 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2021-05-03 00:33:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:33:21,656 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-05-03 00:33:21,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-03 00:33:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2021-05-03 00:33:21,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-03 00:33:21,657 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:33:21,657 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:33:21,657 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-03 00:33:21,657 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:33:21,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:33:21,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1392462319, now seen corresponding path program 1 times [2021-05-03 00:33:21,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:33:21,659 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1079507300] [2021-05-03 00:33:21,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:33:21,716 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~y~0_10 (+ v_main_~x~0_10 1)) (< v_main_~x~0_10 v_main_~n~0_8)) InVars {main_~y~0=v_main_~y~0_10, main_~n~0=v_main_~n~0_8, main_~x~0=v_main_~x~0_10} OutVars{main_~y~0=v_main_~y~0_10, main_~n~0=v_main_~n~0_8, main_~x~0=v_main_~x~0_10} AuxVars[] AssignedVars[] [2021-05-03 00:33:21,745 WARN L240 tifierPushTermWalker]: treesize reduction 21, result has 76.7 percent of original size [2021-05-03 00:33:21,781 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:33:21,797 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:33:21,817 WARN L245 tifierPushTermWalker]: treesize reduction 21, result has 76.7 percent of original size 69 [2021-05-03 00:33:21,847 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:33:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:33:21,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:33:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:33:22,000 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-03 00:33:22,007 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:33:22,045 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:33:22,092 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:33:22,120 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:33:22,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1079507300] [2021-05-03 00:33:22,121 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1079507300] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:33:22,121 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:33:22,121 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:33:22,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088868273] [2021-05-03 00:33:22,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:33:22,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:33:22,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:33:22,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:33:22,123 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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-03 00:33:22,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:33:22,396 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-05-03 00:33:22,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-03 00:33:22,397 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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-03 00:33:22,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:33:22,399 INFO L225 Difference]: With dead ends: 24 [2021-05-03 00:33:22,399 INFO L226 Difference]: Without dead ends: 19 [2021-05-03 00:33:22,400 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 317.3ms TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:33:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-05-03 00:33:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2021-05-03 00:33:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 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-03 00:33:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2021-05-03 00:33:22,405 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2021-05-03 00:33:22,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:33:22,405 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-05-03 00:33:22,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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-03 00:33:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2021-05-03 00:33:22,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-03 00:33:22,406 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:33:22,406 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:33:22,406 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-03 00:33:22,406 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:33:22,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:33:22,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1449720621, now seen corresponding path program 1 times [2021-05-03 00:33:22,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:33:22,407 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1831706544] [2021-05-03 00:33:22,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:33:22,411 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_14 v_main_~n~0_9) (<= (+ v_main_~x~0_14 1) v_main_~y~0_13)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_14} OutVars{main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_14} AuxVars[] AssignedVars[] [2021-05-03 00:33:22,415 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:33:22,428 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:33:22,435 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:33:22,448 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:33:22,454 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:33:22,468 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:33:22,484 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:33:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:33:22,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:33:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:33:22,530 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-03 00:33:22,532 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:33:22,572 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:33:22,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1831706544] [2021-05-03 00:33:22,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1831706544] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:33:22,573 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:33:22,573 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-03 00:33:22,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084515713] [2021-05-03 00:33:22,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-03 00:33:22,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:33:22,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-03 00:33:22,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-05-03 00:33:22,575 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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-03 00:33:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:33:22,639 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2021-05-03 00:33:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-03 00:33:22,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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-03 00:33:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:33:22,641 INFO L225 Difference]: With dead ends: 25 [2021-05-03 00:33:22,641 INFO L226 Difference]: Without dead ends: 20 [2021-05-03 00:33:22,641 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 67.4ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:33:22,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-05-03 00:33:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-05-03 00:33:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 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-03 00:33:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-05-03 00:33:22,650 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2021-05-03 00:33:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:33:22,650 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-05-03 00:33:22,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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-03 00:33:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-05-03 00:33:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-03 00:33:22,651 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:33:22,651 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:33:22,651 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-03 00:33:22,651 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:33:22,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:33:22,652 INFO L82 PathProgramCache]: Analyzing trace with hash -775235318, now seen corresponding path program 1 times [2021-05-03 00:33:22,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:33:22,652 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [350694043] [2021-05-03 00:33:22,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:33:22,662 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_18 v_main_~n~0_10) (< v_main_~y~0_15 (+ v_main_~x~0_18 1))) InVars {main_~y~0=v_main_~y~0_15, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_18} OutVars{main_~y~0=v_main_~y~0_15, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_18} AuxVars[] AssignedVars[] [2021-05-03 00:33:22,666 WARN L240 tifierPushTermWalker]: treesize reduction 21, result has 76.7 percent of original size [2021-05-03 00:33:22,667 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:33:22,673 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:33:22,709 WARN L245 tifierPushTermWalker]: treesize reduction 21, result has 76.7 percent of original size 69 [2021-05-03 00:33:22,731 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_20 v_main_~n~0_11) (<= (+ v_main_~x~0_20 1) v_main_~y~0_16)) InVars {main_~y~0=v_main_~y~0_16, main_~n~0=v_main_~n~0_11, main_~x~0=v_main_~x~0_20} OutVars{main_~y~0=v_main_~y~0_16, main_~n~0=v_main_~n~0_11, main_~x~0=v_main_~x~0_20} AuxVars[] AssignedVars[] [2021-05-03 00:33:22,734 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:33:22,746 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:33:22,750 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:33:22,770 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:33:22,776 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:33:22,792 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:33:22,829 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:33:22,832 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_22 v_main_~n~0_12) (< v_main_~y~0_18 v_main_~x~0_22)) InVars {main_~y~0=v_main_~y~0_18, main_~n~0=v_main_~n~0_12, main_~x~0=v_main_~x~0_22} OutVars{main_~y~0=v_main_~y~0_18, main_~n~0=v_main_~n~0_12, main_~x~0=v_main_~x~0_22} AuxVars[] AssignedVars[] [2021-05-03 00:33:22,835 WARN L240 tifierPushTermWalker]: treesize reduction 17, result has 79.3 percent of original size [2021-05-03 00:33:22,836 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:33:22,841 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:33:22,878 WARN L245 tifierPushTermWalker]: treesize reduction 17, result has 79.3 percent of original size 65 [2021-05-03 00:33:22,900 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:33:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:33:23,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:33:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:33:23,009 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-03 00:33:23,011 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:33:23,014 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:33:23,057 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:33:23,088 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:33:23,122 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:33:23,145 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:33:23,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [350694043] [2021-05-03 00:33:23,145 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [350694043] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:33:23,145 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:33:23,145 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-03 00:33:23,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589370958] [2021-05-03 00:33:23,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-03 00:33:23,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:33:23,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-03 00:33:23,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:33:23,146 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-03 00:33:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:33:23,411 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2021-05-03 00:33:23,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-03 00:33:23,411 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-03 00:33:23,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:33:23,412 INFO L225 Difference]: With dead ends: 25 [2021-05-03 00:33:23,412 INFO L226 Difference]: Without dead ends: 0 [2021-05-03 00:33:23,412 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 348.3ms TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:33:23,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-03 00:33:23,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-03 00:33:23,412 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-03 00:33:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-03 00:33:23,413 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2021-05-03 00:33:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:33:23,413 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-03 00:33:23,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-03 00:33:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-03 00:33:23,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-03 00:33:23,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-03 00:33:23,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-03 00:33:23,638 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2021-05-03 00:33:23,638 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2021-05-03 00:33:23,638 INFO L198 CegarLoopUtils]: For program point L11-1(line 11) no Hoare annotation was computed. [2021-05-03 00:33:23,638 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-03 00:33:23,638 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-03 00:33:23,648 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-03 00:33:23,648 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-03 00:33:23,649 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-03 00:33:23,649 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-03 00:33:23,649 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-03 00:33:23,649 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2021-05-03 00:33:23,650 INFO L201 CegarLoopUtils]: At program point L28(line 28) the Hoare annotation is: true [2021-05-03 00:33:23,652 INFO L194 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: (exists ((v_main_~x~0_23 Int) (|v_main_#t~post6_16| Int) (|v_main_#t~post7_11| Int) (|v_main_#t~post6_18| Int) (v_main_~y~0_19 Int)) (and (let ((.cse1 (+ v_main_~x~0_23 1))) (let ((.cse0 (= v_main_~y~0_19 main_~y~0)) (.cse2 (= .cse1 main_~x~0)) (.cse3 (= |v_main_#t~post6_18| |v_main_#t~post6_16|)) (.cse4 (= |main_#t~post7| |v_main_#t~post7_11|))) (or (and .cse0 (or (<= .cse1 v_main_~y~0_19) (<= main_~n~0 v_main_~x~0_23)) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4)))) (<= (+ v_main_~y~0_19 1) main_~n~0) (<= v_main_~x~0_23 v_main_~y~0_19))) [2021-05-03 00:33:23,653 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 19 30) the Hoare annotation is: true [2021-05-03 00:33:23,653 INFO L194 CegarLoopUtils]: At program point L26-2(lines 24 27) the Hoare annotation is: (or (and (<= main_~x~0 main_~y~0) (<= (+ main_~y~0 1) main_~n~0)) (and (< main_~y~0 (+ main_~x~0 1)) (exists ((v_main_~x~0_23 Int) (|v_main_#t~post6_16| Int) (|v_main_#t~post7_12| Int) (|v_main_#t~post7_11| Int) (|v_main_#t~post6_18| Int) (v_main_~y~0_19 Int)) (let ((.cse5 (+ v_main_~y~0_19 1))) (and (let ((.cse1 (+ v_main_~x~0_23 1))) (let ((.cse0 (= |v_main_#t~post7_12| |v_main_#t~post7_11|)) (.cse2 (= .cse1 main_~x~0)) (.cse3 (= |v_main_#t~post6_18| |v_main_#t~post6_16|)) (.cse4 (= .cse5 main_~y~0))) (or (and .cse0 (or (<= .cse1 v_main_~y~0_19) (<= main_~n~0 v_main_~x~0_23)) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4)))) (<= .cse5 main_~n~0) (<= v_main_~x~0_23 v_main_~y~0_19)))))) [2021-05-03 00:33:23,653 INFO L201 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: true [2021-05-03 00:33:23,653 INFO L194 CegarLoopUtils]: At program point L24-2(lines 24 27) the Hoare annotation is: (and (< main_~y~0 (+ main_~x~0 1)) (exists ((v_main_~x~0_23 Int) (|v_main_#t~post6_16| Int) (|v_main_#t~post7_12| Int) (|v_main_#t~post7_11| Int) (|v_main_#t~post6_18| Int) (v_main_~y~0_19 Int)) (let ((.cse5 (+ v_main_~y~0_19 1))) (and (let ((.cse1 (+ v_main_~x~0_23 1))) (let ((.cse0 (= |v_main_#t~post7_12| |v_main_#t~post7_11|)) (.cse2 (= .cse1 main_~x~0)) (.cse3 (= |v_main_#t~post6_18| |v_main_#t~post6_16|)) (.cse4 (= .cse5 main_~y~0))) (or (and .cse0 (or (<= .cse1 v_main_~y~0_19) (<= main_~n~0 v_main_~x~0_23)) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4)))) (<= .cse5 main_~n~0) (<= v_main_~x~0_23 v_main_~y~0_19)))) (<= main_~n~0 main_~y~0)) [2021-05-03 00:33:23,653 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 19 30) the Hoare annotation is: true [2021-05-03 00:33:23,653 INFO L194 CegarLoopUtils]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-03 00:33:23,653 INFO L194 CegarLoopUtils]: At program point L15(lines 15 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-03 00:33:23,653 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2021-05-03 00:33:23,653 INFO L201 CegarLoopUtils]: At program point L15-2(lines 14 18) the Hoare annotation is: true [2021-05-03 00:33:23,654 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: true [2021-05-03 00:33:23,654 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-03 00:33:23,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_12,QUANTIFIED] [2021-05-03 00:33:23,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_11,QUANTIFIED] [2021-05-03 00:33:23,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_18,QUANTIFIED] [2021-05-03 00:33:23,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_16,QUANTIFIED] [2021-05-03 00:33:23,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_12,QUANTIFIED] [2021-05-03 00:33:23,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_11,QUANTIFIED] [2021-05-03 00:33:23,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_18,QUANTIFIED] [2021-05-03 00:33:23,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_16,QUANTIFIED] [2021-05-03 00:33:23,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_12,QUANTIFIED] [2021-05-03 00:33:23,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_11,QUANTIFIED] [2021-05-03 00:33:23,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_18,QUANTIFIED] [2021-05-03 00:33:23,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_16,QUANTIFIED] [2021-05-03 00:33:23,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_12,QUANTIFIED] [2021-05-03 00:33:23,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_11,QUANTIFIED] [2021-05-03 00:33:23,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_18,QUANTIFIED] [2021-05-03 00:33:23,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_16,QUANTIFIED] [2021-05-03 00:33:23,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 12:33:23 BoogieIcfgContainer [2021-05-03 00:33:23,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-03 00:33:23,678 INFO L168 Benchmark]: Toolchain (without parser) took 2960.08 ms. Allocated memory was 183.5 MB in the beginning and 220.2 MB in the end (delta: 36.7 MB). Free memory was 148.2 MB in the beginning and 166.6 MB in the end (delta: -18.4 MB). Peak memory consumption was 110.9 MB. Max. memory is 8.0 GB. [2021-05-03 00:33:23,678 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 183.5 MB. Free memory is still 164.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-03 00:33:23,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.60 ms. Allocated memory is still 183.5 MB. Free memory was 148.0 MB in the beginning and 166.0 MB in the end (delta: -18.0 MB). Peak memory consumption was 12.7 MB. Max. memory is 8.0 GB. [2021-05-03 00:33:23,679 INFO L168 Benchmark]: Boogie Preprocessor took 18.76 ms. Allocated memory is still 183.5 MB. Free memory was 166.0 MB in the beginning and 164.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-03 00:33:23,684 INFO L168 Benchmark]: RCFGBuilder took 264.20 ms. Allocated memory is still 183.5 MB. Free memory was 164.6 MB in the beginning and 150.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-05-03 00:33:23,684 INFO L168 Benchmark]: TraceAbstraction took 2514.37 ms. Allocated memory was 183.5 MB in the beginning and 220.2 MB in the end (delta: 36.7 MB). Free memory was 150.3 MB in the beginning and 166.6 MB in the end (delta: -16.3 MB). Peak memory consumption was 111.8 MB. Max. memory is 8.0 GB. [2021-05-03 00:33:23,685 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.11 ms. Allocated memory is still 183.5 MB. Free memory is still 164.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 156.60 ms. Allocated memory is still 183.5 MB. Free memory was 148.0 MB in the beginning and 166.0 MB in the end (delta: -18.0 MB). Peak memory consumption was 12.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 18.76 ms. Allocated memory is still 183.5 MB. Free memory was 166.0 MB in the beginning and 164.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 264.20 ms. Allocated memory is still 183.5 MB. Free memory was 164.6 MB in the beginning and 150.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 2514.37 ms. Allocated memory was 183.5 MB in the beginning and 220.2 MB in the end (delta: 36.7 MB). Free memory was 150.3 MB in the beginning and 166.6 MB in the end (delta: -16.3 MB). Peak memory consumption was 111.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_#t~post7_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: 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 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2216.3ms, OverallIterations: 4, TraceHistogramMax: 2, EmptinessCheckTime: 29.6ms, AutomataDifference: 737.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 223.9ms, InitialAbstractionConstructionTime: 6.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 47 SDtfs, 51 SDslu, 69 SDs, 0 SdLazy, 155 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 157.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 791.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 33.0ms AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 21 LocationsWithAnnotation, 45 PreInvPairs, 68 NumberOfFragments, 236 HoareAnnotationTreeSize, 45 FomulaSimplifications, 1428 FormulaSimplificationTreeSizeReduction, 40.1ms HoareSimplificationTime, 21 FomulaSimplificationsInter, 589 FormulaSimplificationTreeSizeReductionInter, 175.4ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2021-05-03 00:33:23,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_12,QUANTIFIED] [2021-05-03 00:33:23,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_11,QUANTIFIED] [2021-05-03 00:33:23,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_18,QUANTIFIED] [2021-05-03 00:33:23,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_16,QUANTIFIED] [2021-05-03 00:33:23,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_12,QUANTIFIED] [2021-05-03 00:33:23,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_11,QUANTIFIED] [2021-05-03 00:33:23,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_18,QUANTIFIED] [2021-05-03 00:33:23,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_16,QUANTIFIED] [2021-05-03 00:33:23,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_12,QUANTIFIED] [2021-05-03 00:33:23,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_11,QUANTIFIED] [2021-05-03 00:33:23,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_18,QUANTIFIED] [2021-05-03 00:33:23,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_16,QUANTIFIED] [2021-05-03 00:33:23,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_12,QUANTIFIED] [2021-05-03 00:33:23,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post7_11,QUANTIFIED] [2021-05-03 00:33:23,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_18,QUANTIFIED] [2021-05-03 00:33:23,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post6_16,QUANTIFIED] [2021-05-03 00:33:23,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] [2021-05-03 00:33:23,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_23,QUANTIFIED] [2021-05-03 00:33:23,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_19,QUANTIFIED] Derived loop invariant: (x <= y && y + 1 <= n) || (y < x + 1 && (\exists v_main_~x~0_23 : int, v_main_#t~post6_16 : int, v_main_#t~post7_12 : int, v_main_#t~post7_11 : int, v_main_#t~post6_18 : int, v_main_~y~0_19 : int :: ((((((v_main_#t~post7_12 == v_main_#t~post7_11 && (v_main_~x~0_23 + 1 <= v_main_~y~0_19 || n <= v_main_~x~0_23)) && v_main_~x~0_23 + 1 == x) && v_main_#t~post6_18 == v_main_#t~post6_16) && v_main_~y~0_19 + 1 == y) || (((v_main_#t~post7_12 == v_main_#t~post7_11 && v_main_~x~0_23 + 1 == x) && v_main_#t~post6_18 == v_main_#t~post6_16) && v_main_~y~0_19 + 1 == y)) && v_main_~y~0_19 + 1 <= n) && v_main_~x~0_23 <= v_main_~y~0_19)) - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! Received shutdown request...