java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 20:46:42,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 20:46:42,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 20:46:42,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 20:46:42,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 20:46:42,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 20:46:42,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 20:46:42,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 20:46:42,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 20:46:42,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 20:46:42,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 20:46:42,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 20:46:42,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 20:46:42,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 20:46:42,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 20:46:42,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 20:46:42,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 20:46:42,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 20:46:42,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 20:46:42,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 20:46:42,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 20:46:42,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 20:46:42,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 20:46:42,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 20:46:42,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 20:46:42,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 20:46:42,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 20:46:42,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 20:46:42,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 20:46:42,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 20:46:42,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 20:46:42,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 20:46:42,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 20:46:42,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 20:46:42,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 20:46:42,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 20:46:42,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 20:46:42,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 20:46:42,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 20:46:42,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 20:46:42,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 20:46:42,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 20:46:42,548 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 20:46:42,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 20:46:42,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 20:46:42,549 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 20:46:42,549 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 20:46:42,550 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 20:46:42,550 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 20:46:42,550 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 20:46:42,550 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 20:46:42,550 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 20:46:42,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 20:46:42,551 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 20:46:42,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 20:46:42,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 20:46:42,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 20:46:42,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 20:46:42,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 20:46:42,552 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 20:46:42,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 20:46:42,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 20:46:42,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 20:46:42,553 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 20:46:42,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 20:46:42,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 20:46:42,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 20:46:42,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 20:46:42,554 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 20:46:42,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 20:46:42,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 20:46:42,555 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 20:46:42,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 20:46:42,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 20:46:42,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 20:46:42,604 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 20:46:42,604 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 20:46:42,605 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label50.c [2019-10-02 20:46:42,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79d70655/4eeae8fd9dd14e91a25eb6a0d7e2a9d9/FLAG074665edf [2019-10-02 20:46:43,196 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 20:46:43,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label50.c [2019-10-02 20:46:43,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79d70655/4eeae8fd9dd14e91a25eb6a0d7e2a9d9/FLAG074665edf [2019-10-02 20:46:43,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79d70655/4eeae8fd9dd14e91a25eb6a0d7e2a9d9 [2019-10-02 20:46:43,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 20:46:43,463 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 20:46:43,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 20:46:43,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 20:46:43,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 20:46:43,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:46:43" (1/1) ... [2019-10-02 20:46:43,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e611eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:46:43, skipping insertion in model container [2019-10-02 20:46:43,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:46:43" (1/1) ... [2019-10-02 20:46:43,484 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 20:46:43,557 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 20:46:44,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 20:46:44,204 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 20:46:44,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 20:46:44,442 INFO L192 MainTranslator]: Completed translation [2019-10-02 20:46:44,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:46:44 WrapperNode [2019-10-02 20:46:44,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 20:46:44,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 20:46:44,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 20:46:44,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 20:46:44,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:46:44" (1/1) ... [2019-10-02 20:46:44,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:46:44" (1/1) ... [2019-10-02 20:46:44,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:46:44" (1/1) ... [2019-10-02 20:46:44,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:46:44" (1/1) ... [2019-10-02 20:46:44,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:46:44" (1/1) ... [2019-10-02 20:46:44,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:46:44" (1/1) ... [2019-10-02 20:46:44,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:46:44" (1/1) ... [2019-10-02 20:46:44,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 20:46:44,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 20:46:44,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 20:46:44,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 20:46:44,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:46:44" (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 [2019-10-02 20:46:44,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 20:46:44,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 20:46:44,664 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 20:46:44,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 20:46:44,664 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 20:46:44,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 20:46:44,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 20:46:44,665 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 20:46:44,665 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 20:46:44,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 20:46:44,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 20:46:46,058 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 20:46:46,059 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 20:46:46,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:46:46 BoogieIcfgContainer [2019-10-02 20:46:46,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 20:46:46,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 20:46:46,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 20:46:46,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 20:46:46,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 08:46:43" (1/3) ... [2019-10-02 20:46:46,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b95bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:46:46, skipping insertion in model container [2019-10-02 20:46:46,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:46:44" (2/3) ... [2019-10-02 20:46:46,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b95bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:46:46, skipping insertion in model container [2019-10-02 20:46:46,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:46:46" (3/3) ... [2019-10-02 20:46:46,069 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label50.c [2019-10-02 20:46:46,079 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 20:46:46,089 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 20:46:46,107 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 20:46:46,149 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 20:46:46,150 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 20:46:46,150 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 20:46:46,150 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 20:46:46,150 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 20:46:46,151 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 20:46:46,151 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 20:46:46,151 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 20:46:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-10-02 20:46:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 20:46:46,204 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:46:46,205 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:46:46,207 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:46:46,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:46:46,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1557712066, now seen corresponding path program 1 times [2019-10-02 20:46:46,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:46:46,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:46:46,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:46:46,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:46:46,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:46:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:46:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:46:46,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:46:46,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 20:46:46,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:46:46,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 20:46:46,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 20:46:46,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:46:46,654 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-10-02 20:46:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:46:47,946 INFO L93 Difference]: Finished difference Result 440 states and 711 transitions. [2019-10-02 20:46:47,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 20:46:47,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-02 20:46:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:46:47,966 INFO L225 Difference]: With dead ends: 440 [2019-10-02 20:46:47,966 INFO L226 Difference]: Without dead ends: 372 [2019-10-02 20:46:47,968 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:46:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-10-02 20:46:48,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-10-02 20:46:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-02 20:46:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-10-02 20:46:48,056 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 43 [2019-10-02 20:46:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:46:48,057 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-10-02 20:46:48,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 20:46:48,057 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-10-02 20:46:48,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 20:46:48,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:46:48,067 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2019-10-02 20:46:48,067 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:46:48,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:46:48,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1883069890, now seen corresponding path program 1 times [2019-10-02 20:46:48,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:46:48,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:46:48,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:46:48,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:46:48,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:46:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:46:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:46:48,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:46:48,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 20:46:48,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:46:48,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 20:46:48,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 20:46:48,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 20:46:48,360 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-10-02 20:46:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:46:49,760 INFO L93 Difference]: Finished difference Result 570 states and 828 transitions. [2019-10-02 20:46:49,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 20:46:49,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-10-02 20:46:49,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:46:49,766 INFO L225 Difference]: With dead ends: 570 [2019-10-02 20:46:49,766 INFO L226 Difference]: Without dead ends: 570 [2019-10-02 20:46:49,767 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 20:46:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-02 20:46:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 562. [2019-10-02 20:46:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-02 20:46:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 814 transitions. [2019-10-02 20:46:49,803 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 814 transitions. Word has length 129 [2019-10-02 20:46:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:46:49,804 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 814 transitions. [2019-10-02 20:46:49,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 20:46:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 814 transitions. [2019-10-02 20:46:49,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 20:46:49,810 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:46:49,810 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2019-10-02 20:46:49,810 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:46:49,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:46:49,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1079220531, now seen corresponding path program 1 times [2019-10-02 20:46:49,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:46:49,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:46:49,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:46:49,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:46:49,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:46:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:46:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:46:49,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:46:49,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 20:46:49,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:46:49,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 20:46:49,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 20:46:49,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 20:46:49,915 INFO L87 Difference]: Start difference. First operand 562 states and 814 transitions. Second operand 4 states. [2019-10-02 20:46:51,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:46:51,390 INFO L93 Difference]: Finished difference Result 1664 states and 2308 transitions. [2019-10-02 20:46:51,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 20:46:51,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 20:46:51,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:46:51,403 INFO L225 Difference]: With dead ends: 1664 [2019-10-02 20:46:51,403 INFO L226 Difference]: Without dead ends: 1664 [2019-10-02 20:46:51,403 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 20:46:51,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2019-10-02 20:46:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1664. [2019-10-02 20:46:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-10-02 20:46:51,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2308 transitions. [2019-10-02 20:46:51,466 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2308 transitions. Word has length 138 [2019-10-02 20:46:51,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:46:51,467 INFO L475 AbstractCegarLoop]: Abstraction has 1664 states and 2308 transitions. [2019-10-02 20:46:51,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 20:46:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2308 transitions. [2019-10-02 20:46:51,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-02 20:46:51,477 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:46:51,477 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 20:46:51,478 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:46:51,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:46:51,478 INFO L82 PathProgramCache]: Analyzing trace with hash 762391661, now seen corresponding path program 1 times [2019-10-02 20:46:51,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:46:51,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:46:51,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:46:51,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:46:51,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:46:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:46:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 145 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:46:52,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:46:52,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:46:52,391 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 275 with the following transitions: [2019-10-02 20:46:52,393 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:46:52,441 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:46:52,442 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:47:04,474 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:47:04,476 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Performed 287 root evaluator evaluations with a maximum evaluation depth of 13. Performed 287 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Never found a fixpoint. Largest state had 24 variables. [2019-10-02 20:47:04,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:47:04,480 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:47:17,824 INFO L227 lantSequenceWeakener]: Weakened 255 states. On average, predicates are now at 77.83% of their original sizes. [2019-10-02 20:47:17,825 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:47:17,909 INFO L420 sIntCurrentIteration]: We unified 273 AI predicates to 273 [2019-10-02 20:47:17,910 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:47:17,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:47:17,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2019-10-02 20:47:17,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:47:17,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 20:47:17,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 20:47:17,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-10-02 20:47:17,913 INFO L87 Difference]: Start difference. First operand 1664 states and 2308 transitions. Second operand 11 states. [2019-10-02 20:48:54,511 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:51:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:51:14,583 INFO L93 Difference]: Finished difference Result 1850 states and 2505 transitions. [2019-10-02 20:51:14,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 20:51:14,583 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 274 [2019-10-02 20:51:14,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:51:14,593 INFO L225 Difference]: With dead ends: 1850 [2019-10-02 20:51:14,594 INFO L226 Difference]: Without dead ends: 1850 [2019-10-02 20:51:14,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-10-02 20:51:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2019-10-02 20:51:14,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1846. [2019-10-02 20:51:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1846 states. [2019-10-02 20:51:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2498 transitions. [2019-10-02 20:51:14,646 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2498 transitions. Word has length 274 [2019-10-02 20:51:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:51:14,647 INFO L475 AbstractCegarLoop]: Abstraction has 1846 states and 2498 transitions. [2019-10-02 20:51:14,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 20:51:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2498 transitions. [2019-10-02 20:51:14,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-10-02 20:51:14,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:51:14,654 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 20:51:14,654 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:51:14,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:51:14,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1515376597, now seen corresponding path program 1 times [2019-10-02 20:51:14,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:51:14,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:51:14,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:51:14,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:51:14,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:51:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:51:15,407 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 194 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 20:51:15,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:51:15,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:51:15,408 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 359 with the following transitions: [2019-10-02 20:51:15,409 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:51:15,415 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:51:15,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:51:28,793 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:51:28,795 INFO L272 AbstractInterpreter]: Visited 128 different actions 251 times. Merged at 4 different actions 5 times. Never widened. Performed 505 root evaluator evaluations with a maximum evaluation depth of 13. Performed 505 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 20:51:28,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:51:28,795 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:51:34,982 INFO L227 lantSequenceWeakener]: Weakened 355 states. On average, predicates are now at 77.61% of their original sizes. [2019-10-02 20:51:34,983 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:51:35,062 INFO L420 sIntCurrentIteration]: We unified 357 AI predicates to 357 [2019-10-02 20:51:35,063 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:51:35,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:51:35,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2019-10-02 20:51:35,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:51:35,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 20:51:35,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 20:51:35,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-02 20:51:35,065 INFO L87 Difference]: Start difference. First operand 1846 states and 2498 transitions. Second operand 11 states. [2019-10-02 20:52:08,565 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:52:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:52:36,414 INFO L93 Difference]: Finished difference Result 2062 states and 2714 transitions. [2019-10-02 20:52:36,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 20:52:36,414 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 358 [2019-10-02 20:52:36,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:52:36,423 INFO L225 Difference]: With dead ends: 2062 [2019-10-02 20:52:36,423 INFO L226 Difference]: Without dead ends: 1847 [2019-10-02 20:52:36,424 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:52:36,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2019-10-02 20:52:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1846. [2019-10-02 20:52:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1846 states. [2019-10-02 20:52:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2492 transitions. [2019-10-02 20:52:36,475 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2492 transitions. Word has length 358 [2019-10-02 20:52:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:52:36,476 INFO L475 AbstractCegarLoop]: Abstraction has 1846 states and 2492 transitions. [2019-10-02 20:52:36,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 20:52:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2492 transitions. [2019-10-02 20:52:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-10-02 20:52:36,484 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:52:36,484 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 20:52:36,485 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:52:36,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:52:36,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1878531777, now seen corresponding path program 1 times [2019-10-02 20:52:36,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:52:36,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:52:36,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:52:36,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:52:36,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:52:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:52:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 165 proven. 222 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 20:52:37,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:52:37,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:52:37,086 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 385 with the following transitions: [2019-10-02 20:52:37,086 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:52:37,092 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:52:37,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:52:55,137 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:52:55,138 INFO L272 AbstractInterpreter]: Visited 128 different actions 251 times. Merged at 4 different actions 5 times. Never widened. Performed 593 root evaluator evaluations with a maximum evaluation depth of 13. Performed 593 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 20:52:55,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:52:55,139 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:53:11,194 INFO L227 lantSequenceWeakener]: Weakened 381 states. On average, predicates are now at 77.59% of their original sizes. [2019-10-02 20:53:11,195 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:53:11,271 INFO L420 sIntCurrentIteration]: We unified 383 AI predicates to 383 [2019-10-02 20:53:11,271 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:53:11,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:53:11,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2019-10-02 20:53:11,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:53:11,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 20:53:11,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 20:53:11,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-02 20:53:11,273 INFO L87 Difference]: Start difference. First operand 1846 states and 2492 transitions. Second operand 11 states. [2019-10-02 20:53:53,747 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:55:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:55:37,907 INFO L93 Difference]: Finished difference Result 2032 states and 2685 transitions. [2019-10-02 20:55:37,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 20:55:37,907 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 384 [2019-10-02 20:55:37,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:55:37,917 INFO L225 Difference]: With dead ends: 2032 [2019-10-02 20:55:37,917 INFO L226 Difference]: Without dead ends: 2032 [2019-10-02 20:55:37,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-10-02 20:55:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-10-02 20:55:37,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 2030. [2019-10-02 20:55:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2030 states. [2019-10-02 20:55:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2683 transitions. [2019-10-02 20:55:37,968 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2683 transitions. Word has length 384 [2019-10-02 20:55:37,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:55:37,969 INFO L475 AbstractCegarLoop]: Abstraction has 2030 states and 2683 transitions. [2019-10-02 20:55:37,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 20:55:37,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2683 transitions. [2019-10-02 20:55:37,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2019-10-02 20:55:37,980 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:55:37,981 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 20:55:37,981 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:55:37,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:55:37,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1232328638, now seen corresponding path program 1 times [2019-10-02 20:55:37,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:55:37,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:55:37,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:55:37,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:55:37,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:55:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:55:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 250 proven. 483 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 20:55:39,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:55:39,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:55:39,149 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 472 with the following transitions: [2019-10-02 20:55:39,151 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:55:39,157 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:55:39,157 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:56:11,110 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:56:11,111 INFO L272 AbstractInterpreter]: Visited 129 different actions 503 times. Merged at 6 different actions 17 times. Never widened. Performed 1014 root evaluator evaluations with a maximum evaluation depth of 13. Performed 1014 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 20:56:11,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:56:11,111 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:56:21,470 INFO L227 lantSequenceWeakener]: Weakened 468 states. On average, predicates are now at 77.54% of their original sizes. [2019-10-02 20:56:21,471 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:56:21,570 INFO L420 sIntCurrentIteration]: We unified 470 AI predicates to 470 [2019-10-02 20:56:21,570 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:56:21,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:56:21,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 26 [2019-10-02 20:56:21,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:56:21,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 20:56:21,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 20:56:21,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-10-02 20:56:21,572 INFO L87 Difference]: Start difference. First operand 2030 states and 2683 transitions. Second operand 12 states. [2019-10-02 20:56:57,521 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:58:34,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:58:34,334 INFO L93 Difference]: Finished difference Result 2247 states and 2900 transitions. [2019-10-02 20:58:34,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 20:58:34,335 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 471 [2019-10-02 20:58:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:58:34,343 INFO L225 Difference]: With dead ends: 2247 [2019-10-02 20:58:34,344 INFO L226 Difference]: Without dead ends: 2032 [2019-10-02 20:58:34,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2019-10-02 20:58:34,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-10-02 20:58:34,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 2030. [2019-10-02 20:58:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2030 states. [2019-10-02 20:58:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2677 transitions. [2019-10-02 20:58:34,393 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2677 transitions. Word has length 471 [2019-10-02 20:58:34,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:58:34,394 INFO L475 AbstractCegarLoop]: Abstraction has 2030 states and 2677 transitions. [2019-10-02 20:58:34,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 20:58:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2677 transitions. [2019-10-02 20:58:34,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-10-02 20:58:34,405 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:58:34,405 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:58:34,406 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:58:34,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:58:34,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1555619278, now seen corresponding path program 1 times [2019-10-02 20:58:34,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:58:34,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:58:34,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:58:34,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:58:34,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:58:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:58:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 372 proven. 112 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-02 20:58:35,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:58:35,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:58:35,011 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 494 with the following transitions: [2019-10-02 20:58:35,012 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:58:35,016 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:58:35,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:58:50,983 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:59:27,513 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:59:27,514 INFO L272 AbstractInterpreter]: Visited 129 different actions 628 times. Merged at 6 different actions 23 times. Never widened. Performed 1217 root evaluator evaluations with a maximum evaluation depth of 22. Performed 1217 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 5 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 20:59:27,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:59:27,514 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:59:40,985 INFO L227 lantSequenceWeakener]: Weakened 490 states. On average, predicates are now at 77.53% of their original sizes. [2019-10-02 20:59:40,985 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:59:41,047 INFO L420 sIntCurrentIteration]: We unified 492 AI predicates to 492 [2019-10-02 20:59:41,047 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:59:41,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:59:41,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2019-10-02 20:59:41,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:59:41,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 20:59:41,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 20:59:41,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 20:59:41,049 INFO L87 Difference]: Start difference. First operand 2030 states and 2677 transitions. Second operand 10 states.