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_label49.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.24-673a906-m
[2019-10-02 20:46:38,076 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-10-02 20:46:38,079 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-02 20:46:38,091 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-02 20:46:38,091 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-02 20:46:38,092 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-02 20:46:38,093 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-02 20:46:38,095 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-02 20:46:38,097 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-02 20:46:38,098 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-02 20:46:38,099 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-10-02 20:46:38,100 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-02 20:46:38,100 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-02 20:46:38,101 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-02 20:46:38,102 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-02 20:46:38,103 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-02 20:46:38,104 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-02 20:46:38,105 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-02 20:46:38,107 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-02 20:46:38,109 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-02 20:46:38,110 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-02 20:46:38,111 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-02 20:46:38,112 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-10-02 20:46:38,113 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-02 20:46:38,115 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-02 20:46:38,115 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-02 20:46:38,116 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-02 20:46:38,116 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-02 20:46:38,117 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-02 20:46:38,118 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-02 20:46:38,118 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-02 20:46:38,119 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-02 20:46:38,119 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-02 20:46:38,120 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-02 20:46:38,121 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-02 20:46:38,121 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-02 20:46:38,122 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-02 20:46:38,122 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-02 20:46:38,122 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-02 20:46:38,123 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-02 20:46:38,124 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-10-02 20:46:38,125 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:38,139 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-10-02 20:46:38,139 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-02 20:46:38,140 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2019-10-02 20:46:38,140 INFO  L138        SettingsManager]:  * Log level for plugins=info
[2019-10-02 20:46:38,141 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2019-10-02 20:46:38,141 INFO  L138        SettingsManager]:  * User list type=DISABLED
[2019-10-02 20:46:38,141 INFO  L138        SettingsManager]:  * Ignore calls to and inside polymorphic procedures=false
[2019-10-02 20:46:38,141 INFO  L138        SettingsManager]:  * Ignore calls to recursive procedures=false
[2019-10-02 20:46:38,142 INFO  L136        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2019-10-02 20:46:38,142 INFO  L138        SettingsManager]:  * Abstract domain=IntervalDomain
[2019-10-02 20:46:38,142 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-02 20:46:38,143 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-10-02 20:46:38,143 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-10-02 20:46:38,143 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-10-02 20:46:38,143 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-10-02 20:46:38,143 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-02 20:46:38,144 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-10-02 20:46:38,144 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-10-02 20:46:38,144 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-10-02 20:46:38,144 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-10-02 20:46:38,144 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-02 20:46:38,145 INFO  L138        SettingsManager]:  * Remove goto edges from RCFG=true
[2019-10-02 20:46:38,145 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-10-02 20:46:38,145 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-02 20:46:38,145 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-02 20:46:38,146 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-10-02 20:46:38,146 INFO  L138        SettingsManager]:  * Trace refinement strategy=TAIPAN
[2019-10-02 20:46:38,146 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-02 20:46:38,146 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-10-02 20:46:38,146 INFO  L138        SettingsManager]:  * Abstract interpretation Mode=USE_PREDICATES
[2019-10-02 20:46:38,175 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-02 20:46:38,188 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-02 20:46:38,192 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-02 20:46:38,193 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-10-02 20:46:38,194 INFO  L275        PluginConnector]: CDTParser initialized
[2019-10-02 20:46:38,194 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label49.c
[2019-10-02 20:46:38,262 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dbe74a56/d1829ea215fb48b5814f358d6aeb961f/FLAGe2e2c4797
[2019-10-02 20:46:38,824 INFO  L306              CDTParser]: Found 1 translation units.
[2019-10-02 20:46:38,825 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label49.c
[2019-10-02 20:46:38,851 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dbe74a56/d1829ea215fb48b5814f358d6aeb961f/FLAGe2e2c4797
[2019-10-02 20:46:39,102 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dbe74a56/d1829ea215fb48b5814f358d6aeb961f
[2019-10-02 20:46:39,112 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-02 20:46:39,114 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-02 20:46:39,115 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-02 20:46:39,115 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-02 20:46:39,118 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-02 20:46:39,119 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:46:39" (1/1) ...
[2019-10-02 20:46:39,122 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3143413b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:46:39, skipping insertion in model container
[2019-10-02 20:46:39,122 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:46:39" (1/1) ...
[2019-10-02 20:46:39,130 INFO  L142         MainTranslator]: Starting translation in SV-COMP mode 
[2019-10-02 20:46:39,197 INFO  L173         MainTranslator]: Built tables and reachable declarations
[2019-10-02 20:46:39,772 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-10-02 20:46:39,778 INFO  L188         MainTranslator]: Completed pre-run
[2019-10-02 20:46:39,906 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-10-02 20:46:39,933 INFO  L192         MainTranslator]: Completed translation
[2019-10-02 20:46:39,934 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:46:39 WrapperNode
[2019-10-02 20:46:39,934 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-02 20:46:39,935 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-02 20:46:39,936 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-02 20:46:39,936 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-10-02 20:46:39,955 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:39" (1/1) ...
[2019-10-02 20:46:39,958 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:39" (1/1) ...
[2019-10-02 20:46:40,001 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:39" (1/1) ...
[2019-10-02 20:46:40,002 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:39" (1/1) ...
[2019-10-02 20:46:40,063 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:39" (1/1) ...
[2019-10-02 20:46:40,090 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:39" (1/1) ...
[2019-10-02 20:46:40,096 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:39" (1/1) ...
[2019-10-02 20:46:40,105 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-02 20:46:40,105 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-02 20:46:40,106 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-10-02 20:46:40,106 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-10-02 20:46:40,107 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:46:39" (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:40,177 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-02 20:46:40,177 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-02 20:46:40,178 INFO  L138     BoogieDeclarations]: Found implementation of procedure calculate_output
[2019-10-02 20:46:40,178 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2019-10-02 20:46:40,178 INFO  L130     BoogieDeclarations]: Found specification of procedure calculate_output
[2019-10-02 20:46:40,178 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-02 20:46:40,178 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-02 20:46:40,179 INFO  L130     BoogieDeclarations]: Found specification of procedure exit
[2019-10-02 20:46:40,179 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2019-10-02 20:46:40,179 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-02 20:46:40,179 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-02 20:46:41,611 INFO  L278             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-02 20:46:41,611 INFO  L283             CfgBuilder]: Removed 1 assume(true) statements.
[2019-10-02 20:46:41,613 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:46:41 BoogieIcfgContainer
[2019-10-02 20:46:41,613 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-02 20:46:41,614 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-02 20:46:41,614 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-10-02 20:46:41,618 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-10-02 20:46:41,618 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 08:46:39" (1/3) ...
[2019-10-02 20:46:41,619 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467675d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:46:41, skipping insertion in model container
[2019-10-02 20:46:41,619 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:46:39" (2/3) ...
[2019-10-02 20:46:41,620 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467675d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:46:41, skipping insertion in model container
[2019-10-02 20:46:41,620 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:46:41" (3/3) ...
[2019-10-02 20:46:41,622 INFO  L109   eAbstractionObserver]: Analyzing ICFG Problem14_label49.c
[2019-10-02 20:46:41,632 INFO  L152   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-02 20:46:41,641 INFO  L164   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-10-02 20:46:41,659 INFO  L252      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-10-02 20:46:41,687 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2019-10-02 20:46:41,687 INFO  L378      AbstractCegarLoop]: Hoare is false
[2019-10-02 20:46:41,687 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-02 20:46:41,688 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-02 20:46:41,688 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-02 20:46:41,688 INFO  L382      AbstractCegarLoop]: Difference is false
[2019-10-02 20:46:41,688 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-02 20:46:41,688 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-02 20:46:41,717 INFO  L276                IsEmpty]: Start isEmpty. Operand 254 states.
[2019-10-02 20:46:41,732 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2019-10-02 20:46:41,732 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:46:41,733 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, 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:41,735 INFO  L418      AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:46:41,741 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:46:41,741 INFO  L82        PathProgramCache]: Analyzing trace with hash -989018502, now seen corresponding path program 1 times
[2019-10-02 20:46:41,744 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:46:41,794 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:46:41,794 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:46:41,794 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:46:41,795 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:46:41,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:46:42,122 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:42,125 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-02 20:46:42,126 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-02 20:46:42,126 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:46:42,132 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-02 20:46:42,148 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-02 20:46:42,149 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-02 20:46:42,151 INFO  L87              Difference]: Start difference. First operand 254 states. Second operand 4 states.
[2019-10-02 20:46:44,268 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:46:44,268 INFO  L93              Difference]: Finished difference Result 642 states and 895 transitions.
[2019-10-02 20:46:44,269 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-10-02 20:46:44,270 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 65
[2019-10-02 20:46:44,271 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:46:44,292 INFO  L225             Difference]: With dead ends: 642
[2019-10-02 20:46:44,292 INFO  L226             Difference]: Without dead ends: 554
[2019-10-02 20:46:44,294 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 20:46:44,311 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 554 states.
[2019-10-02 20:46:44,376 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554.
[2019-10-02 20:46:44,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 554 states.
[2019-10-02 20:46:44,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 776 transitions.
[2019-10-02 20:46:44,388 INFO  L78                 Accepts]: Start accepts. Automaton has 554 states and 776 transitions. Word has length 65
[2019-10-02 20:46:44,388 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:46:44,389 INFO  L475      AbstractCegarLoop]: Abstraction has 554 states and 776 transitions.
[2019-10-02 20:46:44,389 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-02 20:46:44,389 INFO  L276                IsEmpty]: Start isEmpty. Operand 554 states and 776 transitions.
[2019-10-02 20:46:44,400 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2019-10-02 20:46:44,400 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:46:44,401 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, 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]
[2019-10-02 20:46:44,401 INFO  L418      AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:46:44,402 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:46:44,402 INFO  L82        PathProgramCache]: Analyzing trace with hash -2034317014, now seen corresponding path program 1 times
[2019-10-02 20:46:44,403 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:46:44,405 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:46:44,405 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:46:44,405 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:46:44,405 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:46:44,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:46:44,639 INFO  L134       CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-02 20:46:44,640 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-02 20:46:44,640 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-02 20:46:44,640 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:46:44,642 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-02 20:46:44,642 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-02 20:46:44,643 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-02 20:46:44,643 INFO  L87              Difference]: Start difference. First operand 554 states and 776 transitions. Second operand 4 states.
[2019-10-02 20:46:46,305 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:46:46,305 INFO  L93              Difference]: Finished difference Result 1646 states and 2256 transitions.
[2019-10-02 20:46:46,306 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-10-02 20:46:46,306 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 177
[2019-10-02 20:46:46,307 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:46:46,319 INFO  L225             Difference]: With dead ends: 1646
[2019-10-02 20:46:46,320 INFO  L226             Difference]: Without dead ends: 1646
[2019-10-02 20:46:46,321 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:46,323 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1646 states.
[2019-10-02 20:46:46,389 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1464.
[2019-10-02 20:46:46,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1464 states.
[2019-10-02 20:46:46,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 1994 transitions.
[2019-10-02 20:46:46,399 INFO  L78                 Accepts]: Start accepts. Automaton has 1464 states and 1994 transitions. Word has length 177
[2019-10-02 20:46:46,400 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:46:46,400 INFO  L475      AbstractCegarLoop]: Abstraction has 1464 states and 1994 transitions.
[2019-10-02 20:46:46,401 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-02 20:46:46,401 INFO  L276                IsEmpty]: Start isEmpty. Operand 1464 states and 1994 transitions.
[2019-10-02 20:46:46,419 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 260
[2019-10-02 20:46:46,420 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:46:46,420 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,421 INFO  L418      AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:46:46,421 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:46:46,423 INFO  L82        PathProgramCache]: Analyzing trace with hash -1543638766, now seen corresponding path program 1 times
[2019-10-02 20:46:46,424 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:46:46,425 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:46:46,425 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:46:46,426 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:46:46,426 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:46:46,468 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:46:46,732 INFO  L134       CoverageAnalysis]: Checked inductivity of 199 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-02 20:46:46,733 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-10-02 20:46:46,733 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-10-02 20:46:46,734 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: 
[2019-10-02 20:46:46,736 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], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [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], [662], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977]
[2019-10-02 20:46:46,785 INFO  L148    AbstractInterpreter]: Using domain IntervalDomain
[2019-10-02 20:46:46,786 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-02 20:46:57,510 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-10-02 20:46:57,512 INFO  L272    AbstractInterpreter]: Visited 116 different actions 116 times. Never merged. Never widened. Performed 271 root evaluator evaluations with a maximum evaluation depth of 13. Performed 271 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:46:57,516 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:46:57,516 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-10-02 20:47:05,446 INFO  L227   lantSequenceWeakener]: Weakened 240 states. On average, predicates are now at 78.28% of their original sizes.
[2019-10-02 20:47:05,447 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-10-02 20:47:05,530 INFO  L420   sIntCurrentIteration]: We unified 258 AI predicates to 258
[2019-10-02 20:47:05,530 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-10-02 20:47:05,531 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-10-02 20:47:05,531 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15
[2019-10-02 20:47:05,531 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:47:05,532 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 11 states
[2019-10-02 20:47:05,532 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2019-10-02 20:47:05,533 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110
[2019-10-02 20:47:05,533 INFO  L87              Difference]: Start difference. First operand 1464 states and 1994 transitions. Second operand 11 states.
[2019-10-02 20:48:41,319 WARN  L79         EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.
[2019-10-02 20:50:07,469 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:50:07,470 INFO  L93              Difference]: Finished difference Result 1650 states and 2189 transitions.
[2019-10-02 20:50:07,470 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-10-02 20:50:07,470 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 259
[2019-10-02 20:50:07,470 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:50:07,479 INFO  L225             Difference]: With dead ends: 1650
[2019-10-02 20:50:07,480 INFO  L226             Difference]: Without dead ends: 1650
[2019-10-02 20:50:07,480 INFO  L640         BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 249 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:50:07,482 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1650 states.
[2019-10-02 20:50:07,520 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1646.
[2019-10-02 20:50:07,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1646 states.
[2019-10-02 20:50:07,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2183 transitions.
[2019-10-02 20:50:07,528 INFO  L78                 Accepts]: Start accepts. Automaton has 1646 states and 2183 transitions. Word has length 259
[2019-10-02 20:50:07,528 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:50:07,529 INFO  L475      AbstractCegarLoop]: Abstraction has 1646 states and 2183 transitions.
[2019-10-02 20:50:07,529 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2019-10-02 20:50:07,529 INFO  L276                IsEmpty]: Start isEmpty. Operand 1646 states and 2183 transitions.
[2019-10-02 20:50:07,536 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 344
[2019-10-02 20:50:07,537 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:50:07,537 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, 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, 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]
[2019-10-02 20:50:07,537 INFO  L418      AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:50:07,538 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:50:07,538 INFO  L82        PathProgramCache]: Analyzing trace with hash 717046090, now seen corresponding path program 1 times
[2019-10-02 20:50:07,538 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:50:07,540 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:50:07,540 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:50:07,540 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:50:07,540 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:50:07,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:50:08,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 424 backedges. 259 proven. 161 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2019-10-02 20:50:08,179 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-10-02 20:50:08,179 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-10-02 20:50:08,179 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 344 with the following transitions: 
[2019-10-02 20:50:08,180 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], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [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], [662], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977]
[2019-10-02 20:50:08,186 INFO  L148    AbstractInterpreter]: Using domain IntervalDomain
[2019-10-02 20:50:08,187 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-02 20:50:19,523 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-10-02 20:50:19,525 INFO  L272    AbstractInterpreter]: Visited 120 different actions 235 times. Merged at 4 different actions 5 times. Never widened. Performed 481 root evaluator evaluations with a maximum evaluation depth of 13. Performed 481 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:50:19,525 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:50:19,525 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-10-02 20:50:24,172 INFO  L227   lantSequenceWeakener]: Weakened 340 states. On average, predicates are now at 77.92% of their original sizes.
[2019-10-02 20:50:24,172 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-10-02 20:50:24,255 INFO  L420   sIntCurrentIteration]: We unified 342 AI predicates to 342
[2019-10-02 20:50:24,255 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-10-02 20:50:24,255 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-10-02 20:50:24,256 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21
[2019-10-02 20:50:24,256 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:50:24,256 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 11 states
[2019-10-02 20:50:24,257 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2019-10-02 20:50:24,257 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2019-10-02 20:50:24,257 INFO  L87              Difference]: Start difference. First operand 1646 states and 2183 transitions. Second operand 11 states.
[2019-10-02 20:50:57,102 WARN  L79         EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.
[2019-10-02 20:51:25,076 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:51:25,076 INFO  L93              Difference]: Finished difference Result 1862 states and 2410 transitions.
[2019-10-02 20:51:25,076 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2019-10-02 20:51:25,076 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 343
[2019-10-02 20:51:25,077 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:51:25,085 INFO  L225             Difference]: With dead ends: 1862
[2019-10-02 20:51:25,085 INFO  L226             Difference]: Without dead ends: 1862
[2019-10-02 20:51:25,086 INFO  L640         BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 333 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:51:25,088 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1862 states.
[2019-10-02 20:51:25,122 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1646.
[2019-10-02 20:51:25,123 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1646 states.
[2019-10-02 20:51:25,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2183 transitions.
[2019-10-02 20:51:25,128 INFO  L78                 Accepts]: Start accepts. Automaton has 1646 states and 2183 transitions. Word has length 343
[2019-10-02 20:51:25,129 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:51:25,129 INFO  L475      AbstractCegarLoop]: Abstraction has 1646 states and 2183 transitions.
[2019-10-02 20:51:25,129 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2019-10-02 20:51:25,129 INFO  L276                IsEmpty]: Start isEmpty. Operand 1646 states and 2183 transitions.
[2019-10-02 20:51:25,137 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 370
[2019-10-02 20:51:25,137 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:51:25,138 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, 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, 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]
[2019-10-02 20:51:25,138 INFO  L418      AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:51:25,138 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:51:25,138 INFO  L82        PathProgramCache]: Analyzing trace with hash 562327518, now seen corresponding path program 1 times
[2019-10-02 20:51:25,139 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:51:25,140 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:51:25,140 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:51:25,140 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:51:25,140 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:51:25,183 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:51:25,633 INFO  L134       CoverageAnalysis]: Checked inductivity of 450 backedges. 231 proven. 166 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked.
[2019-10-02 20:51:25,634 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-10-02 20:51:25,634 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-10-02 20:51:25,634 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 370 with the following transitions: 
[2019-10-02 20:51:25,635 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], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [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], [662], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977]
[2019-10-02 20:51:25,639 INFO  L148    AbstractInterpreter]: Using domain IntervalDomain
[2019-10-02 20:51:25,639 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-02 20:51:40,910 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-10-02 20:51:40,911 INFO  L272    AbstractInterpreter]: Visited 120 different actions 235 times. Merged at 4 different actions 5 times. Never widened. Performed 561 root evaluator evaluations with a maximum evaluation depth of 13. Performed 561 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:40,911 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:51:40,911 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-10-02 20:51:52,435 INFO  L227   lantSequenceWeakener]: Weakened 366 states. On average, predicates are now at 77.87% of their original sizes.
[2019-10-02 20:51:52,435 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-10-02 20:51:52,505 INFO  L420   sIntCurrentIteration]: We unified 368 AI predicates to 368
[2019-10-02 20:51:52,505 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-10-02 20:51:52,506 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-10-02 20:51:52,506 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17
[2019-10-02 20:51:52,506 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:51:52,507 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 11 states
[2019-10-02 20:51:52,507 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2019-10-02 20:51:52,507 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2019-10-02 20:51:52,507 INFO  L87              Difference]: Start difference. First operand 1646 states and 2183 transitions. Second operand 11 states.
[2019-10-02 20:52:34,839 WARN  L79         EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.
[2019-10-02 20:54:16,734 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:54:16,734 INFO  L93              Difference]: Finished difference Result 2014 states and 2573 transitions.
[2019-10-02 20:54:16,734 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2019-10-02 20:54:16,735 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 369
[2019-10-02 20:54:16,736 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:54:16,744 INFO  L225             Difference]: With dead ends: 2014
[2019-10-02 20:54:16,744 INFO  L226             Difference]: Without dead ends: 2014
[2019-10-02 20:54:16,745 INFO  L640         BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 359 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:54:16,750 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2014 states.
[2019-10-02 20:54:16,785 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2012.
[2019-10-02 20:54:16,785 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2012 states.
[2019-10-02 20:54:16,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2571 transitions.
[2019-10-02 20:54:16,792 INFO  L78                 Accepts]: Start accepts. Automaton has 2012 states and 2571 transitions. Word has length 369
[2019-10-02 20:54:16,792 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:54:16,793 INFO  L475      AbstractCegarLoop]: Abstraction has 2012 states and 2571 transitions.
[2019-10-02 20:54:16,793 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2019-10-02 20:54:16,793 INFO  L276                IsEmpty]: Start isEmpty. Operand 2012 states and 2571 transitions.
[2019-10-02 20:54:16,801 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 396
[2019-10-02 20:54:16,801 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:54:16,802 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-02 20:54:16,802 INFO  L418      AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:54:16,802 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:54:16,803 INFO  L82        PathProgramCache]: Analyzing trace with hash -100424438, now seen corresponding path program 1 times
[2019-10-02 20:54:16,803 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:54:16,804 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:54:16,804 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:54:16,805 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:54:16,805 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:54:16,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:54:17,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 502 backedges. 310 proven. 124 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked.
[2019-10-02 20:54:17,268 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-10-02 20:54:17,268 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-10-02 20:54:17,268 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 396 with the following transitions: 
[2019-10-02 20:54:17,270 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], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [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], [662], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977]
[2019-10-02 20:54:17,278 INFO  L148    AbstractInterpreter]: Using domain IntervalDomain
[2019-10-02 20:54:17,279 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-02 20:54:31,360 WARN  L79         EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.
[2019-10-02 20:54:59,282 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-10-02 20:54:59,283 INFO  L272    AbstractInterpreter]: Visited 120 different actions 584 times. Merged at 6 different actions 24 times. Never widened. Performed 1149 root evaluator evaluations with a maximum evaluation depth of 22. Performed 1149 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 5 fixpoints after 2 different actions. Largest state had 24 variables.
[2019-10-02 20:54:59,283 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:54:59,283 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-10-02 20:55:09,107 INFO  L227   lantSequenceWeakener]: Weakened 392 states. On average, predicates are now at 77.83% of their original sizes.
[2019-10-02 20:55:09,108 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-10-02 20:55:09,179 INFO  L420   sIntCurrentIteration]: We unified 394 AI predicates to 394
[2019-10-02 20:55:09,179 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-10-02 20:55:09,179 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-10-02 20:55:09,179 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15
[2019-10-02 20:55:09,180 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:55:09,180 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 10 states
[2019-10-02 20:55:09,181 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2019-10-02 20:55:09,181 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2019-10-02 20:55:09,181 INFO  L87              Difference]: Start difference. First operand 2012 states and 2571 transitions. Second operand 10 states.
[2019-10-02 20:57:08,554 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:57:08,554 INFO  L93              Difference]: Finished difference Result 2203 states and 2799 transitions.
[2019-10-02 20:57:08,555 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2019-10-02 20:57:08,555 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 395
[2019-10-02 20:57:08,556 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:57:08,565 INFO  L225             Difference]: With dead ends: 2203
[2019-10-02 20:57:08,565 INFO  L226             Difference]: Without dead ends: 2203
[2019-10-02 20:57:08,566 INFO  L640         BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306
[2019-10-02 20:57:08,568 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2203 states.
[2019-10-02 20:57:08,607 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2198.
[2019-10-02 20:57:08,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2198 states.
[2019-10-02 20:57:08,614 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 2794 transitions.
[2019-10-02 20:57:08,614 INFO  L78                 Accepts]: Start accepts. Automaton has 2198 states and 2794 transitions. Word has length 395
[2019-10-02 20:57:08,615 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:57:08,615 INFO  L475      AbstractCegarLoop]: Abstraction has 2198 states and 2794 transitions.
[2019-10-02 20:57:08,615 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2019-10-02 20:57:08,616 INFO  L276                IsEmpty]: Start isEmpty. Operand 2198 states and 2794 transitions.
[2019-10-02 20:57:08,626 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 454
[2019-10-02 20:57:08,626 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:57:08,627 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-02 20:57:08,627 INFO  L418      AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:57:08,627 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:57:08,627 INFO  L82        PathProgramCache]: Analyzing trace with hash -568173034, now seen corresponding path program 1 times
[2019-10-02 20:57:08,628 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:57:08,629 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:57:08,629 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:57:08,629 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:57:08,629 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:57:08,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:57:09,083 INFO  L134       CoverageAnalysis]: Checked inductivity of 759 backedges. 322 proven. 191 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked.
[2019-10-02 20:57:09,083 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-10-02 20:57:09,084 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-10-02 20:57:09,084 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 454 with the following transitions: 
[2019-10-02 20:57:09,084 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], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [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], [658], [659], [662], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977]
[2019-10-02 20:57:09,087 INFO  L148    AbstractInterpreter]: Using domain IntervalDomain
[2019-10-02 20:57:09,088 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-02 20:57:29,592 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-10-02 20:57:29,593 INFO  L272    AbstractInterpreter]: Visited 121 different actions 475 times. Merged at 6 different actions 21 times. Never widened. Performed 848 root evaluator evaluations with a maximum evaluation depth of 13. Performed 848 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 5 fixpoints after 2 different actions. Largest state had 24 variables.
[2019-10-02 20:57:29,593 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:57:29,593 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-10-02 20:57:35,020 INFO  L227   lantSequenceWeakener]: Weakened 450 states. On average, predicates are now at 77.77% of their original sizes.
[2019-10-02 20:57:35,020 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-10-02 20:57:35,091 INFO  L420   sIntCurrentIteration]: We unified 452 AI predicates to 452
[2019-10-02 20:57:35,091 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-10-02 20:57:35,091 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-10-02 20:57:35,091 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14
[2019-10-02 20:57:35,092 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:57:35,092 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 10 states
[2019-10-02 20:57:35,093 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2019-10-02 20:57:35,093 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2019-10-02 20:57:35,093 INFO  L87              Difference]: Start difference. First operand 2198 states and 2794 transitions. Second operand 10 states.
[2019-10-02 20:58:11,659 WARN  L79         EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.
[2019-10-02 20:59:13,999 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:59:14,000 INFO  L93              Difference]: Finished difference Result 2388 states and 2997 transitions.
[2019-10-02 20:59:14,000 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2019-10-02 20:59:14,000 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 453
[2019-10-02 20:59:14,001 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:59:14,008 INFO  L225             Difference]: With dead ends: 2388
[2019-10-02 20:59:14,009 INFO  L226             Difference]: Without dead ends: 2388
[2019-10-02 20:59:14,009 INFO  L640         BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272
[2019-10-02 20:59:14,012 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2388 states.
[2019-10-02 20:59:14,050 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2384.
[2019-10-02 20:59:14,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2384 states.
[2019-10-02 20:59:14,057 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 2993 transitions.
[2019-10-02 20:59:14,057 INFO  L78                 Accepts]: Start accepts. Automaton has 2384 states and 2993 transitions. Word has length 453
[2019-10-02 20:59:14,058 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:59:14,058 INFO  L475      AbstractCegarLoop]: Abstraction has 2384 states and 2993 transitions.
[2019-10-02 20:59:14,058 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2019-10-02 20:59:14,058 INFO  L276                IsEmpty]: Start isEmpty. Operand 2384 states and 2993 transitions.
[2019-10-02 20:59:14,065 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 480
[2019-10-02 20:59:14,065 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:59:14,066 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-02 20:59:14,066 INFO  L418      AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:59:14,066 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:59:14,066 INFO  L82        PathProgramCache]: Analyzing trace with hash -1844358318, now seen corresponding path program 1 times
[2019-10-02 20:59:14,067 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:59:14,068 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:59:14,068 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:59:14,068 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:59:14,068 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:59:14,119 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:59:14,472 INFO  L134       CoverageAnalysis]: Checked inductivity of 812 backedges. 539 proven. 2 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked.
[2019-10-02 20:59:14,473 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-10-02 20:59:14,473 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-10-02 20:59:14,473 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 480 with the following transitions: 
[2019-10-02 20:59:14,474 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], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [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], [654], [655], [658], [659], [662], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977]
[2019-10-02 20:59:14,478 INFO  L148    AbstractInterpreter]: Using domain IntervalDomain
[2019-10-02 20:59:14,478 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-02 20:59:34,326 WARN  L79         EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.
[2019-10-02 20:59:55,955 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-10-02 20:59:55,956 INFO  L272    AbstractInterpreter]: Visited 121 different actions 725 times. Merged at 7 different actions 49 times. Widened at 1 different actions 1 times. Performed 1294 root evaluator evaluations with a maximum evaluation depth of 22. Performed 1294 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 11 fixpoints after 3 different actions. Largest state had 24 variables.
[2019-10-02 20:59:55,957 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:59:55,957 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-10-02 21:00:03,957 INFO  L227   lantSequenceWeakener]: Weakened 476 states. On average, predicates are now at 77.74% of their original sizes.
[2019-10-02 21:00:03,959 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-10-02 21:00:04,030 INFO  L420   sIntCurrentIteration]: We unified 478 AI predicates to 478
[2019-10-02 21:00:04,031 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-10-02 21:00:04,031 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-10-02 21:00:04,032 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14
[2019-10-02 21:00:04,032 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 21:00:04,033 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 10 states
[2019-10-02 21:00:04,033 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2019-10-02 21:00:04,034 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2019-10-02 21:00:04,034 INFO  L87              Difference]: Start difference. First operand 2384 states and 2993 transitions. Second operand 10 states.