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/Problem10_label58.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 19:19:53,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 19:19:53,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 19:19:53,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 19:19:53,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 19:19:53,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 19:19:53,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 19:19:53,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 19:19:53,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 19:19:53,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 19:19:53,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 19:19:53,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 19:19:53,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 19:19:53,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 19:19:53,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 19:19:53,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 19:19:53,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 19:19:53,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 19:19:53,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 19:19:53,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 19:19:53,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 19:19:53,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 19:19:53,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 19:19:53,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 19:19:53,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 19:19:53,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 19:19:53,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 19:19:53,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 19:19:53,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 19:19:53,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 19:19:53,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 19:19:53,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 19:19:53,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 19:19:53,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 19:19:53,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 19:19:53,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 19:19:53,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 19:19:53,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 19:19:53,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 19:19:53,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 19:19:53,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 19:19:53,618 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 19:19:53,633 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 19:19:53,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 19:19:53,634 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 19:19:53,634 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 19:19:53,635 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 19:19:53,635 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 19:19:53,635 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 19:19:53,636 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 19:19:53,636 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 19:19:53,636 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 19:19:53,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 19:19:53,637 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 19:19:53,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 19:19:53,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 19:19:53,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 19:19:53,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 19:19:53,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 19:19:53,638 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 19:19:53,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 19:19:53,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 19:19:53,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 19:19:53,639 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 19:19:53,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 19:19:53,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 19:19:53,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 19:19:53,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 19:19:53,640 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 19:19:53,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 19:19:53,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 19:19:53,640 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 19:19:53,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 19:19:53,702 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 19:19:53,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 19:19:53,707 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 19:19:53,707 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 19:19:53,708 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label58.c [2019-10-02 19:19:53,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9616918/0d4f4a8660b4450cae0458a566de7e12/FLAG1bea0ad30 [2019-10-02 19:19:54,328 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 19:19:54,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label58.c [2019-10-02 19:19:54,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9616918/0d4f4a8660b4450cae0458a566de7e12/FLAG1bea0ad30 [2019-10-02 19:19:54,620 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9616918/0d4f4a8660b4450cae0458a566de7e12 [2019-10-02 19:19:54,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 19:19:54,631 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 19:19:54,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 19:19:54,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 19:19:54,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 19:19:54,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 07:19:54" (1/1) ... [2019-10-02 19:19:54,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1bc691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:19:54, skipping insertion in model container [2019-10-02 19:19:54,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 07:19:54" (1/1) ... [2019-10-02 19:19:54,649 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 19:19:54,706 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 19:19:55,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 19:19:55,270 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 19:19:55,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 19:19:55,417 INFO L192 MainTranslator]: Completed translation [2019-10-02 19:19:55,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:19:55 WrapperNode [2019-10-02 19:19:55,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 19:19:55,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 19:19:55,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 19:19:55,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 19:19:55,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:19:55" (1/1) ... [2019-10-02 19:19:55,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:19:55" (1/1) ... [2019-10-02 19:19:55,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:19:55" (1/1) ... [2019-10-02 19:19:55,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:19:55" (1/1) ... [2019-10-02 19:19:55,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:19:55" (1/1) ... [2019-10-02 19:19:55,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:19:55" (1/1) ... [2019-10-02 19:19:55,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:19:55" (1/1) ... [2019-10-02 19:19:55,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 19:19:55,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 19:19:55,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 19:19:55,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 19:19:55,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:19:55" (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 19:19:55,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 19:19:55,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 19:19:55,611 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 19:19:55,611 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 19:19:55,611 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 19:19:55,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 19:19:55,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 19:19:55,612 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 19:19:55,612 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 19:19:55,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 19:19:55,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 19:19:56,927 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 19:19:56,928 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 19:19:56,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 07:19:56 BoogieIcfgContainer [2019-10-02 19:19:56,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 19:19:56,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 19:19:56,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 19:19:56,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 19:19:56,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 07:19:54" (1/3) ... [2019-10-02 19:19:56,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56553db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 07:19:56, skipping insertion in model container [2019-10-02 19:19:56,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:19:55" (2/3) ... [2019-10-02 19:19:56,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56553db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 07:19:56, skipping insertion in model container [2019-10-02 19:19:56,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 07:19:56" (3/3) ... [2019-10-02 19:19:56,938 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label58.c [2019-10-02 19:19:56,950 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 19:19:56,961 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 19:19:56,979 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 19:19:57,009 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 19:19:57,010 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 19:19:57,010 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 19:19:57,010 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 19:19:57,010 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 19:19:57,010 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 19:19:57,010 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 19:19:57,011 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 19:19:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2019-10-02 19:19:57,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 19:19:57,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:19:57,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 19:19:57,046 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:19:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:19:57,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1079521594, now seen corresponding path program 1 times [2019-10-02 19:19:57,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:19:57,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:19:57,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:19:57,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:19:57,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:19:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:19:57,285 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 19:19:57,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 19:19:57,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 19:19:57,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:19:57,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 19:19:57,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 19:19:57,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 19:19:57,314 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 4 states. [2019-10-02 19:19:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:19:58,869 INFO L93 Difference]: Finished difference Result 524 states and 782 transitions. [2019-10-02 19:19:58,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 19:19:58,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-02 19:19:58,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:19:58,890 INFO L225 Difference]: With dead ends: 524 [2019-10-02 19:19:58,891 INFO L226 Difference]: Without dead ends: 437 [2019-10-02 19:19:58,893 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 19:19:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-10-02 19:19:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-10-02 19:19:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-10-02 19:19:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 633 transitions. [2019-10-02 19:19:58,976 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 633 transitions. Word has length 19 [2019-10-02 19:19:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:19:58,976 INFO L475 AbstractCegarLoop]: Abstraction has 437 states and 633 transitions. [2019-10-02 19:19:58,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 19:19:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 633 transitions. [2019-10-02 19:19:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 19:19:58,981 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:19:58,981 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-10-02 19:19:58,982 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:19:58,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:19:58,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1696713450, now seen corresponding path program 1 times [2019-10-02 19:19:58,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:19:58,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:19:58,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:19:58,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:19:58,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:19:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:19:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 19:19:59,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 19:19:59,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 19:19:59,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:19:59,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 19:19:59,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 19:19:59,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 19:19:59,291 INFO L87 Difference]: Start difference. First operand 437 states and 633 transitions. Second operand 6 states. [2019-10-02 19:20:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:20:00,338 INFO L93 Difference]: Finished difference Result 898 states and 1344 transitions. [2019-10-02 19:20:00,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 19:20:00,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-02 19:20:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:20:00,354 INFO L225 Difference]: With dead ends: 898 [2019-10-02 19:20:00,354 INFO L226 Difference]: Without dead ends: 898 [2019-10-02 19:20:00,356 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 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 19:20:00,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2019-10-02 19:20:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 880. [2019-10-02 19:20:00,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2019-10-02 19:20:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1284 transitions. [2019-10-02 19:20:00,425 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1284 transitions. Word has length 93 [2019-10-02 19:20:00,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:20:00,426 INFO L475 AbstractCegarLoop]: Abstraction has 880 states and 1284 transitions. [2019-10-02 19:20:00,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 19:20:00,427 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1284 transitions. [2019-10-02 19:20:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 19:20:00,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:20:00,431 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-10-02 19:20:00,431 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:20:00,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:20:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1178531378, now seen corresponding path program 1 times [2019-10-02 19:20:00,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:20:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:20:00,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:20:00,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:20:00,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:20:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:20:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 19:20:00,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 19:20:00,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 19:20:00,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:20:00,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 19:20:00,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 19:20:00,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 19:20:00,605 INFO L87 Difference]: Start difference. First operand 880 states and 1284 transitions. Second operand 6 states. [2019-10-02 19:20:01,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:20:01,617 INFO L93 Difference]: Finished difference Result 1345 states and 1936 transitions. [2019-10-02 19:20:01,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 19:20:01,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-02 19:20:01,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:20:01,636 INFO L225 Difference]: With dead ends: 1345 [2019-10-02 19:20:01,636 INFO L226 Difference]: Without dead ends: 1345 [2019-10-02 19:20:01,637 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 19:20:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2019-10-02 19:20:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1039. [2019-10-02 19:20:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-10-02 19:20:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1451 transitions. [2019-10-02 19:20:01,680 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1451 transitions. Word has length 95 [2019-10-02 19:20:01,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:20:01,681 INFO L475 AbstractCegarLoop]: Abstraction has 1039 states and 1451 transitions. [2019-10-02 19:20:01,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 19:20:01,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1451 transitions. [2019-10-02 19:20:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 19:20:01,684 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:20:01,685 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 19:20:01,685 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:20:01,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:20:01,685 INFO L82 PathProgramCache]: Analyzing trace with hash -921580439, now seen corresponding path program 1 times [2019-10-02 19:20:01,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:20:01,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:20:01,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:20:01,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:20:01,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:20:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:20:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 19:20:01,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 19:20:01,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 19:20:01,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:20:01,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 19:20:01,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 19:20:01,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 19:20:01,775 INFO L87 Difference]: Start difference. First operand 1039 states and 1451 transitions. Second operand 4 states. [2019-10-02 19:20:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:20:02,845 INFO L93 Difference]: Finished difference Result 1327 states and 1706 transitions. [2019-10-02 19:20:02,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 19:20:02,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-02 19:20:02,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:20:02,861 INFO L225 Difference]: With dead ends: 1327 [2019-10-02 19:20:02,861 INFO L226 Difference]: Without dead ends: 1327 [2019-10-02 19:20:02,862 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 19:20:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2019-10-02 19:20:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2019-10-02 19:20:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1327 states. [2019-10-02 19:20:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1706 transitions. [2019-10-02 19:20:02,906 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1706 transitions. Word has length 98 [2019-10-02 19:20:02,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:20:02,907 INFO L475 AbstractCegarLoop]: Abstraction has 1327 states and 1706 transitions. [2019-10-02 19:20:02,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 19:20:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1706 transitions. [2019-10-02 19:20:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 19:20:02,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:20:02,917 INFO L411 BasicCegarLoop]: trace histogram [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, 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 19:20:02,917 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:20:02,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:20:02,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1133582729, now seen corresponding path program 1 times [2019-10-02 19:20:02,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:20:02,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:20:02,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:20:02,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:20:02,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:20:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:20:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 19:20:03,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 19:20:03,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 19:20:03,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:20:03,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 19:20:03,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 19:20:03,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 19:20:03,162 INFO L87 Difference]: Start difference. First operand 1327 states and 1706 transitions. Second operand 6 states. [2019-10-02 19:20:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:20:03,958 INFO L93 Difference]: Finished difference Result 1975 states and 2536 transitions. [2019-10-02 19:20:03,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 19:20:03,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-10-02 19:20:03,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:20:03,971 INFO L225 Difference]: With dead ends: 1975 [2019-10-02 19:20:03,971 INFO L226 Difference]: Without dead ends: 1975 [2019-10-02 19:20:03,972 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 19:20:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2019-10-02 19:20:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1784. [2019-10-02 19:20:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-10-02 19:20:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2199 transitions. [2019-10-02 19:20:04,030 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2199 transitions. Word has length 114 [2019-10-02 19:20:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:20:04,030 INFO L475 AbstractCegarLoop]: Abstraction has 1784 states and 2199 transitions. [2019-10-02 19:20:04,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 19:20:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2199 transitions. [2019-10-02 19:20:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 19:20:04,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:20:04,035 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 19:20:04,035 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:20:04,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:20:04,035 INFO L82 PathProgramCache]: Analyzing trace with hash -306672650, now seen corresponding path program 1 times [2019-10-02 19:20:04,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:20:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:20:04,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:20:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:20:04,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:20:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:20:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-02 19:20:04,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 19:20:04,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 19:20:04,217 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2019-10-02 19:20:04,220 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [61], [63], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [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], [538], [539], [543], [547], [551], [555], [559], [563], [567], [570], [792], [796], [805], [809], [811], [816], [817], [818], [820], [821] [2019-10-02 19:20:04,270 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 19:20:04,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 19:20:20,700 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 19:20:20,702 INFO L272 AbstractInterpreter]: Visited 93 different actions 93 times. Never merged. Never widened. Performed 130 root evaluator evaluations with a maximum evaluation depth of 16. Performed 130 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Never found a fixpoint. Largest state had 24 variables. [2019-10-02 19:20:20,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:20:20,706 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 19:20:40,289 INFO L227 lantSequenceWeakener]: Weakened 178 states. On average, predicates are now at 72.6% of their original sizes. [2019-10-02 19:20:40,290 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 19:20:40,325 INFO L420 sIntCurrentIteration]: We unified 186 AI predicates to 186 [2019-10-02 19:20:40,325 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 19:20:40,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 19:20:40,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2019-10-02 19:20:40,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:20:40,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 19:20:40,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 19:20:40,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-02 19:20:40,328 INFO L87 Difference]: Start difference. First operand 1784 states and 2199 transitions. Second operand 7 states. [2019-10-02 19:20:47,124 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 19:24:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:24:14,083 INFO L93 Difference]: Finished difference Result 1928 states and 2352 transitions. [2019-10-02 19:24:14,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 19:24:14,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 187 [2019-10-02 19:24:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:24:14,092 INFO L225 Difference]: With dead ends: 1928 [2019-10-02 19:24:14,092 INFO L226 Difference]: Without dead ends: 1928 [2019-10-02 19:24:14,093 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 19:24:14,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2019-10-02 19:24:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1927. [2019-10-02 19:24:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2019-10-02 19:24:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2351 transitions. [2019-10-02 19:24:14,137 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2351 transitions. Word has length 187 [2019-10-02 19:24:14,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:24:14,138 INFO L475 AbstractCegarLoop]: Abstraction has 1927 states and 2351 transitions. [2019-10-02 19:24:14,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 19:24:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2351 transitions. [2019-10-02 19:24:14,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 19:24:14,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:24:14,143 INFO L411 BasicCegarLoop]: trace histogram [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, 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 19:24:14,144 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:24:14,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:24:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash -908083558, now seen corresponding path program 1 times [2019-10-02 19:24:14,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:24:14,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:24:14,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:24:14,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:24:14,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:24:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:24:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-02 19:24:14,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 19:24:14,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 19:24:14,408 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2019-10-02 19:24:14,408 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [61], [63], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [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], [534], [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], [667], [671], [675], [679], [683], [687], [691], [695], [699], [702], [792], [796], [805], [809], [811], [816], [817], [818], [820], [821] [2019-10-02 19:24:14,426 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 19:24:14,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 19:24:25,591 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 19:25:28,263 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 19:25:28,264 INFO L272 AbstractInterpreter]: Visited 129 different actions 251 times. Merged at 3 different actions 3 times. Never widened. Performed 386 root evaluator evaluations with a maximum evaluation depth of 16. Performed 386 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 19:25:28,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:25:28,265 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 19:26:06,529 INFO L227 lantSequenceWeakener]: Weakened 216 states. On average, predicates are now at 72.67% of their original sizes. [2019-10-02 19:26:06,530 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 19:26:06,621 INFO L420 sIntCurrentIteration]: We unified 218 AI predicates to 218 [2019-10-02 19:26:06,621 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 19:26:06,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 19:26:06,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2019-10-02 19:26:06,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:26:06,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 19:26:06,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 19:26:06,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-02 19:26:06,624 INFO L87 Difference]: Start difference. First operand 1927 states and 2351 transitions. Second operand 11 states. [2019-10-02 19:30:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:30:08,165 INFO L93 Difference]: Finished difference Result 2094 states and 2519 transitions. [2019-10-02 19:30:08,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 19:30:08,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 219 [2019-10-02 19:30:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:30:08,175 INFO L225 Difference]: With dead ends: 2094 [2019-10-02 19:30:08,175 INFO L226 Difference]: Without dead ends: 1928 [2019-10-02 19:30:08,176 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 209 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 19:30:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2019-10-02 19:30:08,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1927. [2019-10-02 19:30:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2019-10-02 19:30:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2350 transitions. [2019-10-02 19:30:08,220 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2350 transitions. Word has length 219 [2019-10-02 19:30:08,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:30:08,221 INFO L475 AbstractCegarLoop]: Abstraction has 1927 states and 2350 transitions. [2019-10-02 19:30:08,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 19:30:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2350 transitions. [2019-10-02 19:30:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 19:30:08,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:30:08,226 INFO L411 BasicCegarLoop]: trace histogram [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, 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 19:30:08,226 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:30:08,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:30:08,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2002119170, now seen corresponding path program 1 times [2019-10-02 19:30:08,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:30:08,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:30:08,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:30:08,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:30:08,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:30:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:30:08,445 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-02 19:30:08,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 19:30:08,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 19:30:08,446 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 242 with the following transitions: [2019-10-02 19:30:08,447 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [61], [63], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [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], [570], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [805], [809], [811], [816], [817], [818], [820], [821] [2019-10-02 19:30:08,453 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 19:30:08,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 19:32:16,927 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 19:32:16,928 INFO L272 AbstractInterpreter]: Visited 142 different actions 278 times. Merged at 4 different actions 4 times. Never widened. Performed 488 root evaluator evaluations with a maximum evaluation depth of 16. Performed 488 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 19:32:16,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:32:16,928 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 19:33:40,660 INFO L227 lantSequenceWeakener]: Weakened 238 states. On average, predicates are now at 72.67% of their original sizes. [2019-10-02 19:33:40,660 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 19:33:40,838 INFO L420 sIntCurrentIteration]: We unified 240 AI predicates to 240 [2019-10-02 19:33:40,838 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 19:33:40,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 19:33:40,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [4] total 17 [2019-10-02 19:33:40,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:33:40,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 19:33:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 19:33:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-10-02 19:33:40,840 INFO L87 Difference]: Start difference. First operand 1927 states and 2350 transitions. Second operand 15 states. [2019-10-02 19:33:50,181 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.