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/Problem16_label53.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 21:44:11,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 21:44:11,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 21:44:11,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 21:44:11,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 21:44:11,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 21:44:11,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 21:44:11,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 21:44:11,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 21:44:11,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 21:44:11,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 21:44:11,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 21:44:11,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 21:44:11,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 21:44:11,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 21:44:11,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 21:44:11,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 21:44:11,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 21:44:11,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 21:44:11,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 21:44:11,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 21:44:11,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 21:44:11,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 21:44:11,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 21:44:11,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 21:44:11,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 21:44:11,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 21:44:11,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 21:44:11,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 21:44:11,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 21:44:11,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 21:44:11,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 21:44:11,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 21:44:11,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 21:44:11,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 21:44:11,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 21:44:11,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 21:44:11,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 21:44:11,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 21:44:11,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 21:44:11,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 21:44:11,267 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 21:44:11,294 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 21:44:11,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 21:44:11,296 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 21:44:11,296 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 21:44:11,297 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 21:44:11,297 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 21:44:11,297 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 21:44:11,297 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 21:44:11,297 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 21:44:11,298 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 21:44:11,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 21:44:11,300 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 21:44:11,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 21:44:11,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 21:44:11,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 21:44:11,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 21:44:11,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 21:44:11,301 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 21:44:11,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 21:44:11,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 21:44:11,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 21:44:11,303 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 21:44:11,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 21:44:11,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 21:44:11,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 21:44:11,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 21:44:11,306 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 21:44:11,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 21:44:11,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 21:44:11,307 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 21:44:11,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 21:44:11,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 21:44:11,358 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 21:44:11,359 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 21:44:11,360 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 21:44:11,361 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label53.c [2019-10-02 21:44:11,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b0228728/dc109aa9a85f490690e37852d02f0bdf/FLAG611bf5048 [2019-10-02 21:44:12,079 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 21:44:12,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label53.c [2019-10-02 21:44:12,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b0228728/dc109aa9a85f490690e37852d02f0bdf/FLAG611bf5048 [2019-10-02 21:44:12,257 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b0228728/dc109aa9a85f490690e37852d02f0bdf [2019-10-02 21:44:12,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 21:44:12,268 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 21:44:12,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 21:44:12,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 21:44:12,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 21:44:12,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 09:44:12" (1/1) ... [2019-10-02 21:44:12,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eff091d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:44:12, skipping insertion in model container [2019-10-02 21:44:12,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 09:44:12" (1/1) ... [2019-10-02 21:44:12,283 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 21:44:12,351 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 21:44:13,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 21:44:13,352 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 21:44:13,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 21:44:13,744 INFO L192 MainTranslator]: Completed translation [2019-10-02 21:44:13,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:44:13 WrapperNode [2019-10-02 21:44:13,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 21:44:13,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 21:44:13,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 21:44:13,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 21:44:13,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:44:13" (1/1) ... [2019-10-02 21:44:13,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:44:13" (1/1) ... [2019-10-02 21:44:13,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:44:13" (1/1) ... [2019-10-02 21:44:13,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:44:13" (1/1) ... [2019-10-02 21:44:13,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:44:13" (1/1) ... [2019-10-02 21:44:13,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:44:13" (1/1) ... [2019-10-02 21:44:13,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:44:13" (1/1) ... [2019-10-02 21:44:13,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 21:44:13,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 21:44:13,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 21:44:13,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 21:44:13,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:44:13" (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 21:44:14,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 21:44:14,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 21:44:14,001 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 21:44:14,001 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-02 21:44:14,002 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 21:44:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 21:44:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-02 21:44:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 21:44:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 21:44:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 21:44:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 21:44:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 21:44:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 21:44:16,502 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 21:44:16,503 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 21:44:16,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 09:44:16 BoogieIcfgContainer [2019-10-02 21:44:16,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 21:44:16,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 21:44:16,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 21:44:16,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 21:44:16,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 09:44:12" (1/3) ... [2019-10-02 21:44:16,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355843d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 09:44:16, skipping insertion in model container [2019-10-02 21:44:16,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:44:13" (2/3) ... [2019-10-02 21:44:16,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355843d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 09:44:16, skipping insertion in model container [2019-10-02 21:44:16,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 09:44:16" (3/3) ... [2019-10-02 21:44:16,513 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label53.c [2019-10-02 21:44:16,523 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 21:44:16,531 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 21:44:16,548 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 21:44:16,575 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 21:44:16,575 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 21:44:16,576 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 21:44:16,576 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 21:44:16,576 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 21:44:16,576 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 21:44:16,576 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 21:44:16,576 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 21:44:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-10-02 21:44:16,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 21:44:16,619 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:44:16,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 21:44:16,623 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:44:16,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:44:16,629 INFO L82 PathProgramCache]: Analyzing trace with hash -302324190, now seen corresponding path program 1 times [2019-10-02 21:44:16,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:44:16,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:44:16,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:44:16,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:44:16,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:44:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:44:16,917 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 21:44:16,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:44:16,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 21:44:16,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:44:16,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 21:44:16,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 21:44:16,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 21:44:16,944 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 3 states. [2019-10-02 21:44:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:44:21,312 INFO L93 Difference]: Finished difference Result 750 states and 1301 transitions. [2019-10-02 21:44:21,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 21:44:21,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-02 21:44:21,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:44:21,347 INFO L225 Difference]: With dead ends: 750 [2019-10-02 21:44:21,348 INFO L226 Difference]: Without dead ends: 682 [2019-10-02 21:44:21,352 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 21:44:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-10-02 21:44:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-10-02 21:44:21,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-10-02 21:44:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1184 transitions. [2019-10-02 21:44:21,456 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1184 transitions. Word has length 43 [2019-10-02 21:44:21,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:44:21,456 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1184 transitions. [2019-10-02 21:44:21,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 21:44:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1184 transitions. [2019-10-02 21:44:21,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-02 21:44:21,464 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:44:21,464 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 21:44:21,465 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:44:21,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:44:21,465 INFO L82 PathProgramCache]: Analyzing trace with hash 204114703, now seen corresponding path program 1 times [2019-10-02 21:44:21,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:44:21,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:44:21,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:44:21,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:44:21,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:44:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:44:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:44:21,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:44:21,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 21:44:21,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:44:21,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 21:44:21,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 21:44:21,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 21:44:21,730 INFO L87 Difference]: Start difference. First operand 682 states and 1184 transitions. Second operand 5 states. [2019-10-02 21:44:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:44:24,766 INFO L93 Difference]: Finished difference Result 1390 states and 2310 transitions. [2019-10-02 21:44:24,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 21:44:24,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-10-02 21:44:24,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:44:24,776 INFO L225 Difference]: With dead ends: 1390 [2019-10-02 21:44:24,776 INFO L226 Difference]: Without dead ends: 1390 [2019-10-02 21:44:24,777 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 21:44:24,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-10-02 21:44:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1372. [2019-10-02 21:44:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-10-02 21:44:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2268 transitions. [2019-10-02 21:44:24,832 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2268 transitions. Word has length 112 [2019-10-02 21:44:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:44:24,833 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 2268 transitions. [2019-10-02 21:44:24,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 21:44:24,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2268 transitions. [2019-10-02 21:44:24,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 21:44:24,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:44:24,837 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 21:44:24,837 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:44:24,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:44:24,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1530346758, now seen corresponding path program 1 times [2019-10-02 21:44:24,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:44:24,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:44:24,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:44:24,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:44:24,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:44:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:44:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:44:25,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:44:25,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 21:44:25,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:44:25,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 21:44:25,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 21:44:25,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 21:44:25,013 INFO L87 Difference]: Start difference. First operand 1372 states and 2268 transitions. Second operand 6 states. [2019-10-02 21:44:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:44:27,843 INFO L93 Difference]: Finished difference Result 2106 states and 3333 transitions. [2019-10-02 21:44:27,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 21:44:27,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-02 21:44:27,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:44:27,859 INFO L225 Difference]: With dead ends: 2106 [2019-10-02 21:44:27,860 INFO L226 Difference]: Without dead ends: 2106 [2019-10-02 21:44:27,864 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 21:44:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-10-02 21:44:27,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2081. [2019-10-02 21:44:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-10-02 21:44:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3263 transitions. [2019-10-02 21:44:27,947 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3263 transitions. Word has length 141 [2019-10-02 21:44:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:44:27,949 INFO L475 AbstractCegarLoop]: Abstraction has 2081 states and 3263 transitions. [2019-10-02 21:44:27,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 21:44:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3263 transitions. [2019-10-02 21:44:27,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 21:44:27,960 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:44:27,960 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 21:44:27,960 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:44:27,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:44:27,961 INFO L82 PathProgramCache]: Analyzing trace with hash 225402430, now seen corresponding path program 1 times [2019-10-02 21:44:27,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:44:27,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:44:27,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:44:27,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:44:27,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:44:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:44:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:44:28,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:44:28,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 21:44:28,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:44:28,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 21:44:28,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 21:44:28,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 21:44:28,185 INFO L87 Difference]: Start difference. First operand 2081 states and 3263 transitions. Second operand 6 states. [2019-10-02 21:44:30,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:44:30,686 INFO L93 Difference]: Finished difference Result 3168 states and 4216 transitions. [2019-10-02 21:44:30,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 21:44:30,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-02 21:44:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:44:30,701 INFO L225 Difference]: With dead ends: 3168 [2019-10-02 21:44:30,702 INFO L226 Difference]: Without dead ends: 3168 [2019-10-02 21:44:30,703 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 21:44:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3168 states. [2019-10-02 21:44:30,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3168 to 3142. [2019-10-02 21:44:30,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2019-10-02 21:44:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 4138 transitions. [2019-10-02 21:44:30,788 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 4138 transitions. Word has length 159 [2019-10-02 21:44:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:44:30,790 INFO L475 AbstractCegarLoop]: Abstraction has 3142 states and 4138 transitions. [2019-10-02 21:44:30,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 21:44:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 4138 transitions. [2019-10-02 21:44:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 21:44:30,793 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:44:30,793 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:44:30,794 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:44:30,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:44:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash -552626974, now seen corresponding path program 1 times [2019-10-02 21:44:30,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:44:30,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:44:30,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:44:30,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:44:30,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:44:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:44:31,063 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:44:31,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:44:31,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 21:44:31,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:44:31,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 21:44:31,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 21:44:31,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 21:44:31,065 INFO L87 Difference]: Start difference. First operand 3142 states and 4138 transitions. Second operand 4 states. [2019-10-02 21:44:34,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:44:34,170 INFO L93 Difference]: Finished difference Result 4511 states and 5709 transitions. [2019-10-02 21:44:34,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 21:44:34,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-10-02 21:44:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:44:34,190 INFO L225 Difference]: With dead ends: 4511 [2019-10-02 21:44:34,190 INFO L226 Difference]: Without dead ends: 4511 [2019-10-02 21:44:34,190 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 21:44:34,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4511 states. [2019-10-02 21:44:34,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4511 to 4511. [2019-10-02 21:44:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4511 states. [2019-10-02 21:44:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4511 states to 4511 states and 5709 transitions. [2019-10-02 21:44:34,278 INFO L78 Accepts]: Start accepts. Automaton has 4511 states and 5709 transitions. Word has length 225 [2019-10-02 21:44:34,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:44:34,279 INFO L475 AbstractCegarLoop]: Abstraction has 4511 states and 5709 transitions. [2019-10-02 21:44:34,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 21:44:34,279 INFO L276 IsEmpty]: Start isEmpty. Operand 4511 states and 5709 transitions. [2019-10-02 21:44:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-10-02 21:44:34,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:44:34,285 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 21:44:34,285 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:44:34,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:44:34,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1302984826, now seen corresponding path program 1 times [2019-10-02 21:44:34,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:44:34,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:44:34,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:44:34,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:44:34,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:44:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:44:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 210 proven. 69 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 21:44:35,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 21:44:35,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 21:44:35,187 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 342 with the following transitions: [2019-10-02 21:44:35,190 INFO L207 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [431], [433], [436], [444], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [672], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [796], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [912], [1552], [1556], [1565], [1569], [1571], [1578], [1579], [1580], [1582], [1583] [2019-10-02 21:44:35,241 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 21:44:35,242 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 21:44:43,408 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 21:44:43,410 INFO L272 AbstractInterpreter]: Visited 135 different actions 135 times. Never merged. Never widened. Performed 307 root evaluator evaluations with a maximum evaluation depth of 14. Performed 307 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Never found a fixpoint. Largest state had 24 variables. [2019-10-02 21:44:43,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:44:43,414 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 21:44:51,595 INFO L227 lantSequenceWeakener]: Weakened 317 states. On average, predicates are now at 77.72% of their original sizes. [2019-10-02 21:44:51,595 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 21:44:51,698 INFO L420 sIntCurrentIteration]: We unified 340 AI predicates to 340 [2019-10-02 21:44:51,698 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 21:44:51,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 21:44:51,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2019-10-02 21:44:51,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:44:51,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 21:44:51,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 21:44:51,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-10-02 21:44:51,702 INFO L87 Difference]: Start difference. First operand 4511 states and 5709 transitions. Second operand 12 states. [2019-10-02 21:45:09,528 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.