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/Problem02_label06.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 17:15:15,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 17:15:15,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 17:15:15,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 17:15:15,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 17:15:15,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 17:15:15,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 17:15:15,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 17:15:15,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 17:15:15,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 17:15:15,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 17:15:15,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 17:15:15,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 17:15:15,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 17:15:15,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 17:15:15,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 17:15:15,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 17:15:15,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 17:15:15,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 17:15:15,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 17:15:15,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 17:15:15,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 17:15:15,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 17:15:15,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 17:15:15,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 17:15:15,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 17:15:15,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 17:15:15,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 17:15:15,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 17:15:15,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 17:15:15,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 17:15:15,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 17:15:15,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 17:15:15,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 17:15:15,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 17:15:15,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 17:15:15,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 17:15:15,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 17:15:15,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 17:15:15,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 17:15:15,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 17:15:15,570 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 17:15:15,587 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 17:15:15,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 17:15:15,588 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 17:15:15,588 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 17:15:15,589 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 17:15:15,589 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 17:15:15,589 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 17:15:15,589 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 17:15:15,590 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 17:15:15,590 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 17:15:15,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 17:15:15,591 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 17:15:15,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 17:15:15,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 17:15:15,592 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 17:15:15,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 17:15:15,592 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 17:15:15,592 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 17:15:15,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 17:15:15,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 17:15:15,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 17:15:15,593 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 17:15:15,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 17:15:15,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 17:15:15,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 17:15:15,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 17:15:15,594 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 17:15:15,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 17:15:15,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 17:15:15,595 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 17:15:15,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 17:15:15,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 17:15:15,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 17:15:15,645 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 17:15:15,646 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 17:15:15,646 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06.c [2019-10-02 17:15:15,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1caec5f4f/f9e72ad415664260a83ed50580f409b1/FLAGb23958325 [2019-10-02 17:15:16,252 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 17:15:16,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label06.c [2019-10-02 17:15:16,271 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1caec5f4f/f9e72ad415664260a83ed50580f409b1/FLAGb23958325 [2019-10-02 17:15:16,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1caec5f4f/f9e72ad415664260a83ed50580f409b1 [2019-10-02 17:15:16,536 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 17:15:16,538 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 17:15:16,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 17:15:16,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 17:15:16,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 17:15:16,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:15:16" (1/1) ... [2019-10-02 17:15:16,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae0ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:16, skipping insertion in model container [2019-10-02 17:15:16,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:15:16" (1/1) ... [2019-10-02 17:15:16,558 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 17:15:16,626 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 17:15:17,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:15:17,206 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 17:15:17,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:15:17,357 INFO L192 MainTranslator]: Completed translation [2019-10-02 17:15:17,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:17 WrapperNode [2019-10-02 17:15:17,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 17:15:17,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 17:15:17,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 17:15:17,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 17:15:17,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:17" (1/1) ... [2019-10-02 17:15:17,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:17" (1/1) ... [2019-10-02 17:15:17,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:17" (1/1) ... [2019-10-02 17:15:17,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:17" (1/1) ... [2019-10-02 17:15:17,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:17" (1/1) ... [2019-10-02 17:15:17,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:17" (1/1) ... [2019-10-02 17:15:17,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:17" (1/1) ... [2019-10-02 17:15:17,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 17:15:17,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 17:15:17,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 17:15:17,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 17:15:17,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:17" (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 17:15:17,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 17:15:17,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 17:15:17,538 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 17:15:17,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 17:15:17,538 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 17:15:17,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 17:15:17,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 17:15:17,539 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 17:15:17,539 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 17:15:17,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 17:15:17,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 17:15:18,784 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 17:15:18,788 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 17:15:18,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:15:18 BoogieIcfgContainer [2019-10-02 17:15:18,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 17:15:18,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 17:15:18,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 17:15:18,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 17:15:18,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 05:15:16" (1/3) ... [2019-10-02 17:15:18,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d162fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:15:18, skipping insertion in model container [2019-10-02 17:15:18,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:17" (2/3) ... [2019-10-02 17:15:18,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d162fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:15:18, skipping insertion in model container [2019-10-02 17:15:18,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:15:18" (3/3) ... [2019-10-02 17:15:18,801 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label06.c [2019-10-02 17:15:18,813 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 17:15:18,826 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 17:15:18,845 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 17:15:18,885 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 17:15:18,886 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 17:15:18,886 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 17:15:18,886 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 17:15:18,886 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 17:15:18,886 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 17:15:18,887 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 17:15:18,887 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 17:15:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 17:15:18,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 17:15:18,953 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:18,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:15:18,958 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:18,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:18,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1121979298, now seen corresponding path program 1 times [2019-10-02 17:15:18,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:19,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:19,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:19,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:19,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:19,564 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 17:15:19,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:19,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:15:19,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:19,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:15:19,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:15:19,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:15:19,592 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 17:15:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:20,483 INFO L93 Difference]: Finished difference Result 388 states and 554 transitions. [2019-10-02 17:15:20,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:15:20,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-02 17:15:20,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:20,503 INFO L225 Difference]: With dead ends: 388 [2019-10-02 17:15:20,503 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:15:20,505 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:15:20,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:15:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:15:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:15:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-02 17:15:20,594 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 146 [2019-10-02 17:15:20,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:20,595 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-02 17:15:20,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:15:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-02 17:15:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 17:15:20,601 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:20,601 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 17:15:20,601 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash -74166087, now seen corresponding path program 1 times [2019-10-02 17:15:20,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:20,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:20,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:21,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:21,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:15:21,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:21,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:15:21,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:15:21,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:21,046 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-02 17:15:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:21,765 INFO L93 Difference]: Finished difference Result 407 states and 552 transitions. [2019-10-02 17:15:21,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:15:21,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-10-02 17:15:21,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:21,771 INFO L225 Difference]: With dead ends: 407 [2019-10-02 17:15:21,771 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:15:21,772 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:15:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:15:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:15:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-02 17:15:21,792 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 154 [2019-10-02 17:15:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:21,792 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-02 17:15:21,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:15:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-02 17:15:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 17:15:21,796 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:21,797 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 17:15:21,797 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:21,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:21,798 INFO L82 PathProgramCache]: Analyzing trace with hash 742954861, now seen corresponding path program 1 times [2019-10-02 17:15:21,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:21,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:21,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:21,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:21,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:22,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:22,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:15:22,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:22,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:15:22,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:15:22,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:22,104 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-02 17:15:22,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:22,808 INFO L93 Difference]: Finished difference Result 403 states and 544 transitions. [2019-10-02 17:15:22,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:15:22,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-02 17:15:22,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:22,813 INFO L225 Difference]: With dead ends: 403 [2019-10-02 17:15:22,813 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:15:22,814 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:15:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:15:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:15:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-02 17:15:22,830 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 160 [2019-10-02 17:15:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:22,831 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-02 17:15:22,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:15:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-02 17:15:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 17:15:22,834 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:22,834 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 17:15:22,835 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:22,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:22,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1806866058, now seen corresponding path program 1 times [2019-10-02 17:15:22,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:22,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:22,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:22,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:22,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:22,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:22,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:15:22,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:22,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:15:22,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:15:22,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:15:22,945 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-02 17:15:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:23,762 INFO L93 Difference]: Finished difference Result 637 states and 894 transitions. [2019-10-02 17:15:23,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:15:23,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-10-02 17:15:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:23,767 INFO L225 Difference]: With dead ends: 637 [2019-10-02 17:15:23,768 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 17:15:23,768 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 17:15:23,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 17:15:23,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-02 17:15:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:15:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2019-10-02 17:15:23,798 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 168 [2019-10-02 17:15:23,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:23,798 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2019-10-02 17:15:23,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:15:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2019-10-02 17:15:23,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 17:15:23,802 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:23,803 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:15:23,803 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:23,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:23,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1446244430, now seen corresponding path program 1 times [2019-10-02 17:15:23,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:23,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:23,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:23,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:23,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:23,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:23,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:15:23,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:23,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:15:24,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:15:24,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:24,000 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2019-10-02 17:15:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:24,701 INFO L93 Difference]: Finished difference Result 710 states and 957 transitions. [2019-10-02 17:15:24,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:15:24,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2019-10-02 17:15:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:24,706 INFO L225 Difference]: With dead ends: 710 [2019-10-02 17:15:24,706 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 17:15:24,707 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:24,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 17:15:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 17:15:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:15:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2019-10-02 17:15:24,727 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 170 [2019-10-02 17:15:24,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:24,727 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2019-10-02 17:15:24,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:15:24,728 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2019-10-02 17:15:24,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 17:15:24,731 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:24,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:15:24,731 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:24,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:24,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1864889838, now seen corresponding path program 1 times [2019-10-02 17:15:24,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:24,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:24,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:24,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:24,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:24,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:24,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:15:24,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:24,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:15:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:15:24,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:24,949 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2019-10-02 17:15:25,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:25,615 INFO L93 Difference]: Finished difference Result 712 states and 947 transitions. [2019-10-02 17:15:25,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:15:25,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-10-02 17:15:25,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:25,620 INFO L225 Difference]: With dead ends: 712 [2019-10-02 17:15:25,620 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 17:15:25,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:25,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 17:15:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 17:15:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:15:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2019-10-02 17:15:25,639 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 172 [2019-10-02 17:15:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:25,640 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2019-10-02 17:15:25,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:15:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2019-10-02 17:15:25,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 17:15:25,643 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:25,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:15:25,644 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:25,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:25,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1412924006, now seen corresponding path program 1 times [2019-10-02 17:15:25,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:25,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:25,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:25,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:25,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:25,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:25,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:15:25,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:25,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:15:25,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:15:25,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:15:25,751 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2019-10-02 17:15:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:26,594 INFO L93 Difference]: Finished difference Result 1238 states and 1704 transitions. [2019-10-02 17:15:26,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:15:26,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-10-02 17:15:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:26,602 INFO L225 Difference]: With dead ends: 1238 [2019-10-02 17:15:26,602 INFO L226 Difference]: Without dead ends: 1238 [2019-10-02 17:15:26,603 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 17:15:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-02 17:15:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-02 17:15:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 17:15:26,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1637 transitions. [2019-10-02 17:15:26,640 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1637 transitions. Word has length 176 [2019-10-02 17:15:26,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:26,640 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1637 transitions. [2019-10-02 17:15:26,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:15:26,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1637 transitions. [2019-10-02 17:15:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 17:15:26,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:26,646 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 17:15:26,646 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:26,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:26,647 INFO L82 PathProgramCache]: Analyzing trace with hash -788488225, now seen corresponding path program 1 times [2019-10-02 17:15:26,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:26,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:26,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:26,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:26,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:26,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 17:15:26,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 17:15:26,818 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2019-10-02 17:15:26,820 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-10-02 17:15:26,941 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 17:15:26,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 17:27:02,476 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 17:27:02,479 INFO L272 AbstractInterpreter]: Visited 150 different actions 442 times. Merged at 6 different actions 12 times. Never widened. Performed 950 root evaluator evaluations with a maximum evaluation depth of 18. Performed 950 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2019-10-02 17:27:02,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:27:02,484 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates