/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/ddlm2013.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:40:16,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:40:16,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:40:16,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:40:16,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:40:16,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:40:16,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:40:16,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:40:16,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:40:16,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:40:16,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:40:16,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:40:16,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:40:16,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:40:16,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:40:16,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:40:16,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:40:16,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:40:16,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:40:16,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:40:16,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:40:16,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:40:16,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:40:16,331 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:40:16,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:40:16,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:40:16,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:40:16,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:40:16,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:40:16,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:40:16,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:40:16,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:40:16,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:40:16,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:40:16,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:40:16,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:40:16,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:40:16,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:40:16,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:40:16,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:40:16,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:40:16,358 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:40:16,383 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:40:16,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:40:16,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:40:16,388 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:40:16,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:40:16,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:40:16,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:40:16,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:40:16,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:40:16,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:40:16,392 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:40:16,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:40:16,392 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:40:16,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:40:16,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:40:16,393 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:40:16,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:40:16,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:40:16,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:40:16,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:40:16,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:40:16,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:40:16,395 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.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 06:40:16,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:40:16,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:40:16,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:40:16,846 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:40:16,847 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:40:16,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/ddlm2013.i [2020-11-07 06:40:16,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80719c1d/a371f3f29848413292b21bb53a480835/FLAG5e5d4b66d [2020-11-07 06:40:17,710 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:40:17,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013.i [2020-11-07 06:40:17,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80719c1d/a371f3f29848413292b21bb53a480835/FLAG5e5d4b66d [2020-11-07 06:40:18,062 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80719c1d/a371f3f29848413292b21bb53a480835 [2020-11-07 06:40:18,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:40:18,075 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:40:18,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:40:18,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:40:18,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:40:18,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:40:18" (1/1) ... [2020-11-07 06:40:18,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a5114f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:18, skipping insertion in model container [2020-11-07 06:40:18,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:40:18" (1/1) ... [2020-11-07 06:40:18,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:40:18,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:40:18,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:40:18,328 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:40:18,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:40:18,368 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:40:18,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:18 WrapperNode [2020-11-07 06:40:18,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:40:18,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:40:18,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:40:18,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:40:18,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:18" (1/1) ... [2020-11-07 06:40:18,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:18" (1/1) ... [2020-11-07 06:40:18,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:18" (1/1) ... [2020-11-07 06:40:18,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:18" (1/1) ... [2020-11-07 06:40:18,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:18" (1/1) ... [2020-11-07 06:40:18,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:18" (1/1) ... [2020-11-07 06:40:18,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:18" (1/1) ... [2020-11-07 06:40:18,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:40:18,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:40:18,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:40:18,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:40:18,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:18" (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 [2020-11-07 06:40:18,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:40:18,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:40:18,501 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:40:18,501 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 06:40:18,501 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:40:18,501 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:40:18,501 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:40:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:40:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 06:40:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 06:40:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:40:18,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:40:18,503 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 06:40:18,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:40:18,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:40:18,503 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:40:18,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:40:18,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:40:18,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:40:18,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:40:18,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:40:18,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:40:18,894 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:40:18,895 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 06:40:18,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:40:18 BoogieIcfgContainer [2020-11-07 06:40:18,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:40:18,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:40:18,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:40:18,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:40:18,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:40:18" (1/3) ... [2020-11-07 06:40:18,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447e155e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:40:18, skipping insertion in model container [2020-11-07 06:40:18,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:18" (2/3) ... [2020-11-07 06:40:18,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447e155e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:40:18, skipping insertion in model container [2020-11-07 06:40:18,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:40:18" (3/3) ... [2020-11-07 06:40:18,907 INFO L111 eAbstractionObserver]: Analyzing ICFG ddlm2013.i [2020-11-07 06:40:18,926 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:40:18,929 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:40:18,943 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:40:18,971 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:40:18,971 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:40:18,971 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:40:18,971 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:40:18,971 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:40:18,971 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:40:18,972 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:40:18,972 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:40:18,989 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-11-07 06:40:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-07 06:40:19,000 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:19,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:19,001 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:19,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:19,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1451726539, now seen corresponding path program 1 times [2020-11-07 06:40:19,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:19,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1630373251] [2020-11-07 06:40:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:19,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:19,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1630373251] [2020-11-07 06:40:19,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:40:19,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-07 06:40:19,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978873717] [2020-11-07 06:40:19,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-07 06:40:19,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:19,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-07 06:40:19,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-07 06:40:19,414 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2020-11-07 06:40:19,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:19,517 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2020-11-07 06:40:19,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-07 06:40:19,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-11-07 06:40:19,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:19,530 INFO L225 Difference]: With dead ends: 72 [2020-11-07 06:40:19,530 INFO L226 Difference]: Without dead ends: 46 [2020-11-07 06:40:19,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-07 06:40:19,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-11-07 06:40:19,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-11-07 06:40:19,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-07 06:40:19,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2020-11-07 06:40:19,601 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 31 [2020-11-07 06:40:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:19,602 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2020-11-07 06:40:19,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-07 06:40:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-11-07 06:40:19,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 06:40:19,603 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:19,604 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:19,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:40:19,604 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:19,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:19,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1635626356, now seen corresponding path program 1 times [2020-11-07 06:40:19,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:19,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1614781142] [2020-11-07 06:40:19,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:19,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:19,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1614781142] [2020-11-07 06:40:19,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:40:19,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 06:40:19,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115498003] [2020-11-07 06:40:19,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 06:40:19,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:19,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 06:40:19,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 06:40:19,721 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 4 states. [2020-11-07 06:40:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:19,924 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2020-11-07 06:40:19,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 06:40:19,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-11-07 06:40:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:19,926 INFO L225 Difference]: With dead ends: 68 [2020-11-07 06:40:19,926 INFO L226 Difference]: Without dead ends: 45 [2020-11-07 06:40:19,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:40:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-11-07 06:40:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-11-07 06:40:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-07 06:40:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-11-07 06:40:19,941 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 33 [2020-11-07 06:40:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:19,942 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-11-07 06:40:19,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 06:40:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-11-07 06:40:19,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 06:40:19,944 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:19,944 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:19,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:40:19,944 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:19,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:19,945 INFO L82 PathProgramCache]: Analyzing trace with hash -926987732, now seen corresponding path program 1 times [2020-11-07 06:40:19,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:19,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [291420345] [2020-11-07 06:40:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:20,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:20,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [291420345] [2020-11-07 06:40:20,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:40:20,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 06:40:20,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5607778] [2020-11-07 06:40:20,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:40:20,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:20,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:40:20,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:40:20,172 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 7 states. [2020-11-07 06:40:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:20,447 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-11-07 06:40:20,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:40:20,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-11-07 06:40:20,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:20,449 INFO L225 Difference]: With dead ends: 59 [2020-11-07 06:40:20,449 INFO L226 Difference]: Without dead ends: 50 [2020-11-07 06:40:20,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:40:20,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-07 06:40:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2020-11-07 06:40:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-07 06:40:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-11-07 06:40:20,464 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 33 [2020-11-07 06:40:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:20,464 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-11-07 06:40:20,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:40:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-11-07 06:40:20,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 06:40:20,466 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:20,466 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:20,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:40:20,467 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:20,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:20,467 INFO L82 PathProgramCache]: Analyzing trace with hash 543258678, now seen corresponding path program 1 times [2020-11-07 06:40:20,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:20,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1588941968] [2020-11-07 06:40:20,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:20,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:20,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1588941968] [2020-11-07 06:40:20,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:40:20,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:40:20,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124476214] [2020-11-07 06:40:20,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:40:20,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:20,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:40:20,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:40:20,802 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 12 states. [2020-11-07 06:40:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:21,411 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2020-11-07 06:40:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:40:21,411 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2020-11-07 06:40:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:21,413 INFO L225 Difference]: With dead ends: 72 [2020-11-07 06:40:21,413 INFO L226 Difference]: Without dead ends: 63 [2020-11-07 06:40:21,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2020-11-07 06:40:21,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-07 06:40:21,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2020-11-07 06:40:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-11-07 06:40:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2020-11-07 06:40:21,431 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 43 [2020-11-07 06:40:21,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:21,432 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2020-11-07 06:40:21,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:40:21,432 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-11-07 06:40:21,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-07 06:40:21,433 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:21,433 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:21,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:40:21,434 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:21,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:21,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1097784896, now seen corresponding path program 2 times [2020-11-07 06:40:21,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:21,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [539052001] [2020-11-07 06:40:21,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:21,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:21,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [539052001] [2020-11-07 06:40:21,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:40:21,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 06:40:21,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996893886] [2020-11-07 06:40:21,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 06:40:21,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:21,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 06:40:21,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:40:21,911 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 17 states. [2020-11-07 06:40:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:23,035 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2020-11-07 06:40:23,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 06:40:23,036 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2020-11-07 06:40:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:23,037 INFO L225 Difference]: With dead ends: 105 [2020-11-07 06:40:23,038 INFO L226 Difference]: Without dead ends: 73 [2020-11-07 06:40:23,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=884, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 06:40:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-07 06:40:23,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-11-07 06:40:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-07 06:40:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2020-11-07 06:40:23,058 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 53 [2020-11-07 06:40:23,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:23,059 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2020-11-07 06:40:23,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 06:40:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-11-07 06:40:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 06:40:23,060 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:23,061 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:23,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:40:23,061 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:23,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:23,062 INFO L82 PathProgramCache]: Analyzing trace with hash -347478326, now seen corresponding path program 3 times [2020-11-07 06:40:23,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:23,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1130006867] [2020-11-07 06:40:23,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:23,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:23,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1130006867] [2020-11-07 06:40:23,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:40:23,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-11-07 06:40:23,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820276057] [2020-11-07 06:40:23,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 06:40:23,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:23,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 06:40:23,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2020-11-07 06:40:23,705 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 21 states. [2020-11-07 06:40:24,651 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2020-11-07 06:40:25,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:25,456 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2020-11-07 06:40:25,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 06:40:25,458 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2020-11-07 06:40:25,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:25,463 INFO L225 Difference]: With dead ends: 97 [2020-11-07 06:40:25,463 INFO L226 Difference]: Without dead ends: 88 [2020-11-07 06:40:25,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=242, Invalid=1480, Unknown=0, NotChecked=0, Total=1722 [2020-11-07 06:40:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-07 06:40:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2020-11-07 06:40:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-07 06:40:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2020-11-07 06:40:25,512 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 63 [2020-11-07 06:40:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:25,513 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2020-11-07 06:40:25,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 06:40:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2020-11-07 06:40:25,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 06:40:25,519 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:25,519 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:25,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:40:25,521 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:25,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:25,522 INFO L82 PathProgramCache]: Analyzing trace with hash 152623083, now seen corresponding path program 1 times [2020-11-07 06:40:25,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:25,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1363731213] [2020-11-07 06:40:25,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:25,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 06:40:25,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1363731213] [2020-11-07 06:40:25,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:40:25,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 06:40:25,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043776802] [2020-11-07 06:40:25,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:40:25,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:25,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:40:25,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:40:25,675 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2020-11-07 06:40:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:25,912 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2020-11-07 06:40:25,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 06:40:25,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2020-11-07 06:40:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:25,914 INFO L225 Difference]: With dead ends: 101 [2020-11-07 06:40:25,917 INFO L226 Difference]: Without dead ends: 74 [2020-11-07 06:40:25,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:40:25,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-07 06:40:25,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-11-07 06:40:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-07 06:40:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2020-11-07 06:40:25,959 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 65 [2020-11-07 06:40:25,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:25,959 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2020-11-07 06:40:25,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:40:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2020-11-07 06:40:25,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 06:40:25,962 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:25,962 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:25,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:40:25,963 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:25,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:25,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1618962260, now seen corresponding path program 4 times [2020-11-07 06:40:25,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:25,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1041206885] [2020-11-07 06:40:25,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:26,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:26,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1041206885] [2020-11-07 06:40:26,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:40:26,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-11-07 06:40:26,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072059322] [2020-11-07 06:40:26,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 06:40:26,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:26,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 06:40:26,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2020-11-07 06:40:26,629 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 25 states. [2020-11-07 06:40:29,554 WARN L194 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2020-11-07 06:40:30,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:30,280 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2020-11-07 06:40:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 06:40:30,281 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 73 [2020-11-07 06:40:30,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:30,283 INFO L225 Difference]: With dead ends: 74 [2020-11-07 06:40:30,283 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 06:40:30,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=219, Invalid=1421, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 06:40:30,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 06:40:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 06:40:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 06:40:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 06:40:30,286 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2020-11-07 06:40:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:30,286 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 06:40:30,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 06:40:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 06:40:30,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 06:40:30,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:40:30,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 06:40:30,826 WARN L194 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2020-11-07 06:40:31,734 WARN L194 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 43 [2020-11-07 06:40:31,945 WARN L194 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2020-11-07 06:40:32,098 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2020-11-07 06:40:32,329 WARN L194 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2020-11-07 06:40:34,673 WARN L194 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-11-07 06:40:35,984 WARN L194 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2020-11-07 06:40:38,301 WARN L194 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2020-11-07 06:40:38,526 WARN L194 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2020-11-07 06:40:39,333 WARN L194 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2020-11-07 06:40:39,343 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 12) the Hoare annotation is: true [2020-11-07 06:40:39,343 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 12) the Hoare annotation is: true [2020-11-07 06:40:39,343 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:40:39,343 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:40:39,343 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:40:39,343 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: true [2020-11-07 06:40:39,344 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:40:39,344 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 06:40:39,344 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 12) the Hoare annotation is: true [2020-11-07 06:40:39,344 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 06:40:39,344 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:40:39,344 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:40:39,344 INFO L262 CegarLoopResult]: 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)|)) [2020-11-07 06:40:39,344 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:40:39,344 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:40:39,345 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:40:39,345 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:40:39,345 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 06:40:39,345 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:40:39,345 INFO L266 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-11-07 06:40:39,345 INFO L266 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-11-07 06:40:39,345 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:40:39,345 INFO L266 CegarLoopResult]: For program point L15-3(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:40:39,346 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:40:39,346 INFO L262 CegarLoopResult]: At program point L35-3(line 35) the Hoare annotation is: (let ((.cse5 (+ (* 3 main_~i~0) main_~a~0 3)) (.cse4 (+ (* 3 main_~j~0) main_~b~0)) (.cse7 (+ main_~j~0 main_~b~0)) (.cse6 (+ main_~i~0 main_~a~0 1))) (let ((.cse0 (<= .cse7 .cse6)) (.cse1 (<= .cse5 .cse4)) (.cse2 (<= .cse6 .cse7)) (.cse3 (<= .cse4 .cse5))) (or (and (= main_~i~0 0) (= main_~b~0 0) (= main_~a~0 0) (= main_~j~0 1)) (= main_~flag~0 0) (and .cse0 (<= 4 main_~i~0) .cse1 .cse2 .cse3 (<= main_~i~0 (* 2 (div main_~i~0 2)))) (and (<= 2 main_~i~0) .cse0 .cse1 .cse2 (<= main_~i~0 2) .cse3)))) [2020-11-07 06:40:39,346 INFO L262 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (= main_~a~0 0) (= main_~b~0 0) (= main_~j~0 1)) [2020-11-07 06:40:39,346 INFO L262 CegarLoopResult]: At program point L35-4(lines 24 49) the Hoare annotation is: (or (= main_~flag~0 0) (let ((.cse1 (* 4294967296 (div main_~b~0 4294967296))) (.cse0 (+ (* 4294967296 (div main_~a~0 4294967296)) main_~b~0))) (and (< .cse0 (+ .cse1 main_~a~0 1)) (<= main_~a~0 main_~b~0) (<= (+ .cse1 main_~a~0) .cse0)))) [2020-11-07 06:40:39,346 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 06:40:39,347 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 24 49) the Hoare annotation is: true [2020-11-07 06:40:39,347 INFO L262 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (let ((.cse1 (+ main_~j~0 main_~b~0 1)) (.cse0 (+ main_~i~0 main_~a~0))) (let ((.cse5 (* 2 main_~i~0)) (.cse4 (<= .cse1 .cse0))) (or (let ((.cse3 (+ (* 2 main_~j~0) main_~b~0 2)) (.cse2 (+ .cse5 main_~a~0))) (and (<= .cse0 .cse1) (<= .cse2 .cse3) (<= 4 main_~i~0) (<= main_~i~0 (* 2 (div main_~i~0 2))) .cse4 (<= .cse3 .cse2))) (and (<= (+ .cse5 main_~j~0 main_~a~0) (+ main_~b~0 5)) (<= (+ main_~b~0 7) (+ (* 3 main_~i~0) main_~j~0 main_~a~0)) .cse4 (= main_~j~0 1)) (= main_~flag~0 0)))) [2020-11-07 06:40:39,347 INFO L262 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (let ((.cse5 (+ (* 3 main_~i~0) main_~a~0 3)) (.cse4 (+ (* 3 main_~j~0) main_~b~0)) (.cse7 (+ main_~j~0 main_~b~0)) (.cse6 (+ main_~i~0 main_~a~0 1))) (let ((.cse0 (<= .cse7 .cse6)) (.cse1 (<= .cse5 .cse4)) (.cse2 (<= .cse6 .cse7)) (.cse3 (<= .cse4 .cse5))) (or (and (= main_~i~0 0) (= main_~b~0 0) (= main_~a~0 0) (= main_~j~0 1)) (= main_~flag~0 0) (and .cse0 (<= 4 main_~i~0) .cse1 .cse2 .cse3 (<= main_~i~0 (* 2 (div main_~i~0 2)))) (and (<= 2 main_~i~0) .cse0 .cse1 .cse2 (<= main_~i~0 2) .cse3)))) [2020-11-07 06:40:39,347 INFO L262 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse7 (* 3 main_~i~0))) (let ((.cse6 (+ .cse7 main_~a~0 3)) (.cse5 (+ (* 3 main_~j~0) main_~b~0))) (let ((.cse0 (<= (+ .cse7 |main_#t~post5| 3) .cse5)) (.cse1 (<= (+ main_~i~0 |main_#t~post5| 1) (+ main_~j~0 main_~b~0))) (.cse2 (<= .cse6 .cse5)) (.cse3 (<= (+ (* 2 main_~j~0) main_~b~0) (+ (* 2 main_~i~0) |main_#t~post5| 2))) (.cse4 (<= .cse5 .cse6))) (or (and (= main_~i~0 0) (= |main_#t~post5| 0) (= main_~b~0 0) (= main_~a~0 0) (= main_~j~0 1)) (= main_~flag~0 0) (and .cse0 .cse1 (<= 4 main_~i~0) .cse2 .cse3 .cse4 (<= main_~i~0 (* 2 (div main_~i~0 2)))) (and (<= 2 main_~i~0) .cse0 .cse1 .cse2 (<= main_~i~0 2) .cse3 .cse4))))) [2020-11-07 06:40:39,348 INFO L262 CegarLoopResult]: At program point L36-2(line 36) the Hoare annotation is: (let ((.cse6 (* 2 main_~i~0))) (let ((.cse7 (+ .cse6 main_~a~0 1)) (.cse5 (+ (* 2 main_~j~0) main_~b~0))) (let ((.cse0 (<= (+ (* 3 main_~i~0) |main_#t~post5| 3) (+ (* 3 main_~j~0) main_~b~0))) (.cse1 (<= (+ main_~i~0 |main_#t~post5| 1) (+ main_~j~0 main_~b~0))) (.cse2 (<= .cse7 .cse5)) (.cse3 (<= .cse5 .cse7)) (.cse4 (<= .cse5 (+ .cse6 |main_#t~post5| 2)))) (or (= main_~flag~0 0) (and (<= main_~a~0 1) (= main_~i~0 0) (= |main_#t~post5| 0) (= main_~b~0 0) (<= 1 main_~a~0) (= main_~j~0 1)) (and (<= 2 main_~i~0) .cse0 .cse1 .cse2 .cse3 (<= main_~i~0 2) .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= 4 main_~i~0) .cse4 (<= main_~i~0 (* 2 (div main_~i~0 2)))))))) [2020-11-07 06:40:39,348 INFO L262 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (= main_~a~0 0) [2020-11-07 06:40:39,348 INFO L269 CegarLoopResult]: At program point L45(lines 45 47) the Hoare annotation is: true [2020-11-07 06:40:39,348 INFO L262 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (let ((.cse5 (+ (* 2 main_~i~0) main_~a~0 1)) (.cse4 (+ (* 2 main_~j~0) main_~b~0)) (.cse7 (+ main_~i~0 main_~a~0)) (.cse6 (+ main_~j~0 main_~b~0))) (let ((.cse0 (<= .cse7 .cse6)) (.cse1 (<= .cse6 .cse7)) (.cse2 (<= .cse5 .cse4)) (.cse3 (<= .cse4 .cse5))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 4 main_~i~0) (<= main_~i~0 (* 2 (div main_~i~0 2)))) (and (<= 2 main_~i~0) .cse0 .cse1 .cse2 .cse3 (<= main_~i~0 2)) (= main_~flag~0 0) (and (<= main_~a~0 1) (= main_~i~0 0) (= main_~b~0 0) (<= 1 main_~a~0) (= main_~j~0 1))))) [2020-11-07 06:40:39,348 INFO L262 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (= main_~flag~0 0) [2020-11-07 06:40:39,349 INFO L262 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (= main_~a~0 0) (= main_~b~0 0)) [2020-11-07 06:40:39,349 INFO L269 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-11-07 06:40:39,349 INFO L269 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-11-07 06:40:39,349 INFO L269 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: true [2020-11-07 06:40:39,349 INFO L262 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse1 (* 4294967296 (div main_~b~0 4294967296))) (.cse0 (+ (* 4294967296 (div main_~a~0 4294967296)) main_~b~0))) (and (< .cse0 (+ .cse1 main_~a~0 1)) (<= main_~a~0 main_~b~0) (<= (+ .cse1 main_~a~0) .cse0))) [2020-11-07 06:40:39,349 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 24 49) the Hoare annotation is: true [2020-11-07 06:40:39,349 INFO L262 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (= main_~flag~0 0) [2020-11-07 06:40:39,350 INFO L262 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: (= main_~flag~0 0) [2020-11-07 06:40:39,350 INFO L262 CegarLoopResult]: At program point L42-2(line 42) the Hoare annotation is: (= main_~flag~0 0) [2020-11-07 06:40:39,350 INFO L262 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (let ((.cse7 (+ (* 3 main_~i~0) main_~a~0 3)) (.cse6 (+ (* 3 main_~j~0) main_~b~0)) (.cse9 (+ main_~j~0 main_~b~0)) (.cse8 (+ main_~i~0 main_~a~0 1))) (let ((.cse2 (<= .cse9 .cse8)) (.cse3 (<= .cse7 .cse6)) (.cse4 (<= .cse8 .cse9)) (.cse5 (<= .cse6 .cse7))) (or (= main_~flag~0 0) (let ((.cse1 (+ main_~i~0 main_~b~0 1)) (.cse0 (+ main_~j~0 main_~a~0))) (and (= main_~i~0 0) (<= .cse0 .cse1) (<= .cse1 .cse0) (= main_~j~0 1))) (and .cse2 (<= 4 main_~i~0) .cse3 .cse4 .cse5 (<= main_~i~0 (* 2 (div main_~i~0 2)))) (and (<= 2 main_~i~0) .cse2 .cse3 .cse4 (<= main_~i~0 2) .cse5)))) [2020-11-07 06:40:39,350 INFO L262 CegarLoopResult]: At program point L30(lines 30 34) the Hoare annotation is: (and (= main_~a~0 0) (= main_~b~0 0) (= main_~j~0 1)) [2020-11-07 06:40:39,350 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 24 49) the Hoare annotation is: true [2020-11-07 06:40:39,350 INFO L269 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-11-07 06:40:39,351 INFO L269 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-11-07 06:40:39,351 INFO L269 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: true [2020-11-07 06:40:39,351 INFO L262 CegarLoopResult]: At program point L39(lines 39 43) the Hoare annotation is: (let ((.cse1 (+ main_~j~0 main_~b~0 1)) (.cse0 (+ main_~i~0 main_~a~0))) (let ((.cse5 (* 2 main_~i~0)) (.cse4 (<= .cse1 .cse0))) (or (let ((.cse3 (+ (* 2 main_~j~0) main_~b~0 2)) (.cse2 (+ .cse5 main_~a~0))) (and (<= .cse0 .cse1) (<= .cse2 .cse3) (<= 4 main_~i~0) (<= main_~i~0 (* 2 (div main_~i~0 2))) .cse4 (<= .cse3 .cse2))) (and (<= (+ .cse5 main_~j~0 main_~a~0) (+ main_~b~0 5)) (<= (+ main_~b~0 7) (+ (* 3 main_~i~0) main_~j~0 main_~a~0)) .cse4 (= main_~j~0 1)) (= main_~flag~0 0)))) [2020-11-07 06:40:39,351 INFO L262 CegarLoopResult]: At program point L39-2(lines 24 49) the Hoare annotation is: (let ((.cse5 (+ (* 3 main_~i~0) main_~a~0 3)) (.cse4 (+ (* 3 main_~j~0) main_~b~0)) (.cse7 (+ main_~j~0 main_~b~0)) (.cse6 (+ main_~i~0 main_~a~0 1))) (let ((.cse0 (<= .cse7 .cse6)) (.cse1 (<= .cse5 .cse4)) (.cse2 (<= .cse6 .cse7)) (.cse3 (<= .cse4 .cse5))) (or (and (= main_~i~0 0) (= main_~a~0 0) (= main_~b~0 0) (= main_~j~0 1)) (= main_~flag~0 0) (and .cse0 (<= 4 main_~i~0) .cse1 .cse2 .cse3 (<= main_~i~0 (* 2 (div main_~i~0 2)))) (and (<= 2 main_~i~0) .cse0 .cse1 .cse2 (<= main_~i~0 2) .cse3)))) [2020-11-07 06:40:39,352 INFO L262 CegarLoopResult]: At program point L35(lines 35 44) the Hoare annotation is: (let ((.cse5 (+ (* 3 main_~i~0) main_~a~0 3)) (.cse4 (+ (* 3 main_~j~0) main_~b~0)) (.cse7 (+ main_~j~0 main_~b~0)) (.cse6 (+ main_~i~0 main_~a~0 1))) (let ((.cse0 (<= .cse7 .cse6)) (.cse1 (<= .cse5 .cse4)) (.cse2 (<= .cse6 .cse7)) (.cse3 (<= .cse4 .cse5))) (or (and (= main_~i~0 0) (= main_~a~0 0) (= main_~b~0 0) (= main_~j~0 1)) (= main_~flag~0 0) (and .cse0 (<= 4 main_~i~0) .cse1 .cse2 .cse3 (<= main_~i~0 (* 2 (div main_~i~0 2)))) (and (<= 2 main_~i~0) .cse0 .cse1 .cse2 (<= main_~i~0 2) .cse3)))) [2020-11-07 06:40:39,352 INFO L262 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (or (= main_~flag~0 0) (let ((.cse1 (* 4294967296 (div main_~b~0 4294967296))) (.cse0 (+ (* 4294967296 (div main_~a~0 4294967296)) main_~b~0))) (and (< .cse0 (+ .cse1 main_~a~0 1)) (<= main_~a~0 main_~b~0) (<= (+ .cse1 main_~a~0) .cse0)))) [2020-11-07 06:40:39,352 INFO L269 CegarLoopResult]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2020-11-07 06:40:39,352 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2020-11-07 06:40:39,352 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2020-11-07 06:40:39,352 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:40:39,353 INFO L262 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:40:39,353 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:40:39,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:40:39 BoogieIcfgContainer [2020-11-07 06:40:39,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:40:39,369 INFO L168 Benchmark]: Toolchain (without parser) took 21299.62 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 128.4 MB in the beginning and 119.9 MB in the end (delta: 8.5 MB). Peak memory consumption was 148.1 MB. Max. memory is 8.0 GB. [2020-11-07 06:40:39,370 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 125.8 MB. Free memory was 102.5 MB in the beginning and 102.4 MB in the end (delta: 122.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:40:39,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.08 ms. Allocated memory is still 151.0 MB. Free memory was 127.7 MB in the beginning and 117.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:40:39,371 INFO L168 Benchmark]: Boogie Preprocessor took 42.98 ms. Allocated memory is still 151.0 MB. Free memory was 117.7 MB in the beginning and 116.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:40:39,372 INFO L168 Benchmark]: RCFGBuilder took 482.70 ms. Allocated memory is still 151.0 MB. Free memory was 116.0 MB in the beginning and 131.3 MB in the end (delta: -15.4 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. [2020-11-07 06:40:39,373 INFO L168 Benchmark]: TraceAbstraction took 20467.59 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 131.2 MB in the beginning and 119.9 MB in the end (delta: 11.4 MB). Peak memory consumption was 150.8 MB. Max. memory is 8.0 GB. [2020-11-07 06:40:39,376 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.35 ms. Allocated memory is still 125.8 MB. Free memory was 102.5 MB in the beginning and 102.4 MB in the end (delta: 122.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 289.08 ms. Allocated memory is still 151.0 MB. Free memory was 127.7 MB in the beginning and 117.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.98 ms. Allocated memory is still 151.0 MB. Free memory was 117.7 MB in the beginning and 116.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 482.70 ms. Allocated memory is still 151.0 MB. Free memory was 116.0 MB in the beginning and 131.3 MB in the end (delta: -15.4 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 20467.59 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 131.2 MB in the beginning and 119.9 MB in the end (delta: 11.4 MB). Peak memory consumption was 150.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 12]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - 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: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.3s, OverallIterations: 8, TraceHistogramMax: 5, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 348 SDtfs, 585 SDslu, 755 SDs, 0 SdLazy, 1792 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 147 PreInvPairs, 229 NumberOfFragments, 1402 HoareAnnotationTreeSize, 147 FomulaSimplifications, 6557 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 57 FomulaSimplificationsInter, 2511 FormulaSimplificationTreeSizeReductionInter, 8.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 394 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 205796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 25/154 InterpolantCoveringCapability, 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...