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_label12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 17:19:17,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 17:19:17,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 17:19:17,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 17:19:17,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 17:19:17,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 17:19:17,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 17:19:17,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 17:19:17,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 17:19:17,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 17:19:17,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 17:19:17,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 17:19:17,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 17:19:17,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 17:19:17,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 17:19:17,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 17:19:17,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 17:19:17,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 17:19:17,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 17:19:17,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 17:19:17,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 17:19:17,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 17:19:17,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 17:19:17,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 17:19:17,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 17:19:17,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 17:19:17,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 17:19:17,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 17:19:17,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 17:19:17,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 17:19:17,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 17:19:17,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 17:19:17,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 17:19:17,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 17:19:17,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 17:19:17,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 17:19:17,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 17:19:17,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 17:19:17,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 17:19:17,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 17:19:17,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 17:19:17,674 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:19:17,689 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 17:19:17,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 17:19:17,690 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 17:19:17,690 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 17:19:17,690 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 17:19:17,691 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 17:19:17,691 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 17:19:17,691 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 17:19:17,691 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 17:19:17,691 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 17:19:17,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 17:19:17,692 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 17:19:17,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 17:19:17,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 17:19:17,693 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 17:19:17,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 17:19:17,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 17:19:17,693 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 17:19:17,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 17:19:17,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 17:19:17,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 17:19:17,694 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 17:19:17,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 17:19:17,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 17:19:17,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 17:19:17,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 17:19:17,695 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 17:19:17,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 17:19:17,696 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 17:19:17,696 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 17:19:17,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 17:19:17,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 17:19:17,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 17:19:17,752 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 17:19:17,752 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 17:19:17,753 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label12.c [2019-10-02 17:19:17,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e53acb2/f9f08b38d8a44cbeb508afa3ca521d65/FLAGe5326db34 [2019-10-02 17:19:18,374 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 17:19:18,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label12.c [2019-10-02 17:19:18,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e53acb2/f9f08b38d8a44cbeb508afa3ca521d65/FLAGe5326db34 [2019-10-02 17:19:18,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e53acb2/f9f08b38d8a44cbeb508afa3ca521d65 [2019-10-02 17:19:18,661 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 17:19:18,663 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 17:19:18,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 17:19:18,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 17:19:18,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 17:19:18,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:19:18" (1/1) ... [2019-10-02 17:19:18,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a23b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:18, skipping insertion in model container [2019-10-02 17:19:18,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:19:18" (1/1) ... [2019-10-02 17:19:18,680 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 17:19:18,723 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 17:19:19,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:19:19,318 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 17:19:19,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:19:19,485 INFO L192 MainTranslator]: Completed translation [2019-10-02 17:19:19,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:19 WrapperNode [2019-10-02 17:19:19,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 17:19:19,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 17:19:19,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 17:19:19,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 17:19:19,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:19" (1/1) ... [2019-10-02 17:19:19,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:19" (1/1) ... [2019-10-02 17:19:19,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:19" (1/1) ... [2019-10-02 17:19:19,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:19" (1/1) ... [2019-10-02 17:19:19,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:19" (1/1) ... [2019-10-02 17:19:19,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:19" (1/1) ... [2019-10-02 17:19:19,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:19" (1/1) ... [2019-10-02 17:19:19,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 17:19:19,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 17:19:19,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 17:19:19,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 17:19:19,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:19" (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:19:19,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 17:19:19,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 17:19:19,704 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 17:19:19,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 17:19:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 17:19:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 17:19:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 17:19:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 17:19:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 17:19:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 17:19:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 17:19:21,051 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 17:19:21,052 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 17:19:21,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:19:21 BoogieIcfgContainer [2019-10-02 17:19:21,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 17:19:21,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 17:19:21,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 17:19:21,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 17:19:21,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 05:19:18" (1/3) ... [2019-10-02 17:19:21,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b81f0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:19:21, skipping insertion in model container [2019-10-02 17:19:21,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:19" (2/3) ... [2019-10-02 17:19:21,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b81f0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:19:21, skipping insertion in model container [2019-10-02 17:19:21,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:19:21" (3/3) ... [2019-10-02 17:19:21,065 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label12.c [2019-10-02 17:19:21,077 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 17:19:21,089 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 17:19:21,107 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 17:19:21,148 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 17:19:21,149 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 17:19:21,149 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 17:19:21,149 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 17:19:21,149 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 17:19:21,150 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 17:19:21,150 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 17:19:21,150 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 17:19:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 17:19:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 17:19:21,214 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:21,215 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] [2019-10-02 17:19:21,218 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:21,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:21,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1251139866, now seen corresponding path program 1 times [2019-10-02 17:19:21,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:21,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:21,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:21,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:21,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:21,740 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:19:21,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:21,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:19:21,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:21,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:19:21,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:19:21,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:19:21,767 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 17:19:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:22,690 INFO L93 Difference]: Finished difference Result 388 states and 554 transitions. [2019-10-02 17:19:22,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:19:22,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-10-02 17:19:22,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:22,710 INFO L225 Difference]: With dead ends: 388 [2019-10-02 17:19:22,711 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:19:22,712 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:19:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:19:22,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:19:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:19:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-02 17:19:22,784 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 124 [2019-10-02 17:19:22,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:22,785 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-02 17:19:22,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:19:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-02 17:19:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 17:19:22,790 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:22,790 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] [2019-10-02 17:19:22,791 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:22,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1267937665, now seen corresponding path program 1 times [2019-10-02 17:19:22,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:22,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:22,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:22,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:22,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:23,190 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:19:23,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:23,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:19:23,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:23,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:19:23,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:19:23,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:19:23,193 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-02 17:19:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:23,948 INFO L93 Difference]: Finished difference Result 407 states and 552 transitions. [2019-10-02 17:19:23,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:19:23,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-10-02 17:19:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:23,952 INFO L225 Difference]: With dead ends: 407 [2019-10-02 17:19:23,952 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:19:23,953 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:19:23,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:19:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:19:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:19:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-02 17:19:23,975 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 132 [2019-10-02 17:19:23,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:23,976 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-02 17:19:23,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:19:23,976 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-02 17:19:23,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 17:19:23,980 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:23,980 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] [2019-10-02 17:19:23,980 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:23,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:23,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1536784181, now seen corresponding path program 1 times [2019-10-02 17:19:23,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:23,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:23,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:23,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:23,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:24,352 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:19:24,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:24,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:19:24,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:24,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:19:24,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:19:24,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:19:24,355 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-02 17:19:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:25,026 INFO L93 Difference]: Finished difference Result 403 states and 544 transitions. [2019-10-02 17:19:25,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:19:25,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-02 17:19:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:25,030 INFO L225 Difference]: With dead ends: 403 [2019-10-02 17:19:25,030 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:19:25,030 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:19:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:19:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:19:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:19:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-02 17:19:25,050 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 138 [2019-10-02 17:19:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:25,051 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-02 17:19:25,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:19:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-02 17:19:25,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 17:19:25,057 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:25,062 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] [2019-10-02 17:19:25,063 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:25,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:25,063 INFO L82 PathProgramCache]: Analyzing trace with hash -564169218, now seen corresponding path program 1 times [2019-10-02 17:19:25,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:25,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:25,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:25,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:25,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:25,177 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:19:25,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:25,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:19:25,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:25,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:19:25,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:19:25,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:19:25,179 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-02 17:19:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:25,893 INFO L93 Difference]: Finished difference Result 637 states and 894 transitions. [2019-10-02 17:19:25,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:19:25,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-10-02 17:19:25,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:25,899 INFO L225 Difference]: With dead ends: 637 [2019-10-02 17:19:25,899 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 17:19:25,900 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:19:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 17:19:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-02 17:19:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:19:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2019-10-02 17:19:25,930 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 146 [2019-10-02 17:19:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:25,931 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2019-10-02 17:19:25,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:19:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2019-10-02 17:19:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 17:19:25,934 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:25,935 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] [2019-10-02 17:19:25,935 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:25,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:25,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1274835258, now seen corresponding path program 1 times [2019-10-02 17:19:25,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:25,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:25,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:25,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:25,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:26,146 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:19:26,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:26,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:19:26,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:26,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:19:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:19:26,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:19:26,148 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2019-10-02 17:19:26,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:26,839 INFO L93 Difference]: Finished difference Result 710 states and 957 transitions. [2019-10-02 17:19:26,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:19:26,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-02 17:19:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:26,845 INFO L225 Difference]: With dead ends: 710 [2019-10-02 17:19:26,845 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 17:19:26,846 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:19:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 17:19:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 17:19:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:19:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2019-10-02 17:19:26,864 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 148 [2019-10-02 17:19:26,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:26,864 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2019-10-02 17:19:26,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:19:26,864 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2019-10-02 17:19:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 17:19:26,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:26,867 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] [2019-10-02 17:19:26,868 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:26,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1427723146, now seen corresponding path program 1 times [2019-10-02 17:19:26,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:26,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:26,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:26,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:26,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:27,088 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:19:27,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:27,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:19:27,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:27,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:19:27,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:19:27,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:19:27,090 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2019-10-02 17:19:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:27,799 INFO L93 Difference]: Finished difference Result 712 states and 947 transitions. [2019-10-02 17:19:27,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:19:27,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-02 17:19:27,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:27,803 INFO L225 Difference]: With dead ends: 712 [2019-10-02 17:19:27,803 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 17:19:27,803 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:19:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 17:19:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 17:19:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:19:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2019-10-02 17:19:27,820 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 150 [2019-10-02 17:19:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:27,820 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2019-10-02 17:19:27,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:19:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2019-10-02 17:19:27,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 17:19:27,823 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:27,824 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] [2019-10-02 17:19:27,824 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:27,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:27,825 INFO L82 PathProgramCache]: Analyzing trace with hash 392356590, now seen corresponding path program 1 times [2019-10-02 17:19:27,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:27,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:27,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:27,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:27,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:27,925 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:19:27,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:27,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:19:27,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:27,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:19:27,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:19:27,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:19:27,934 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2019-10-02 17:19:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:28,816 INFO L93 Difference]: Finished difference Result 1238 states and 1704 transitions. [2019-10-02 17:19:28,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:19:28,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2019-10-02 17:19:28,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:28,825 INFO L225 Difference]: With dead ends: 1238 [2019-10-02 17:19:28,825 INFO L226 Difference]: Without dead ends: 1238 [2019-10-02 17:19:28,826 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:19:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-02 17:19:28,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-02 17:19:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 17:19:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1637 transitions. [2019-10-02 17:19:28,863 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1637 transitions. Word has length 154 [2019-10-02 17:19:28,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:28,864 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1637 transitions. [2019-10-02 17:19:28,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:19:28,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1637 transitions. [2019-10-02 17:19:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 17:19:28,869 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:28,869 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] [2019-10-02 17:19:28,870 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:28,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:28,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1102274855, now seen corresponding path program 1 times [2019-10-02 17:19:28,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:28,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:28,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:28,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:28,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:19:29,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 17:19:29,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 17:19:29,033 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2019-10-02 17:19:29,036 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], [671], [673], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-10-02 17:19:29,149 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 17:19:29,149 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 17:30:23,745 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 17:30:23,748 INFO L272 AbstractInterpreter]: Visited 128 different actions 376 times. Merged at 6 different actions 12 times. Never widened. Performed 862 root evaluator evaluations with a maximum evaluation depth of 18. Performed 862 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:30:23,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:30:23,753 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 17:33:51,817 INFO L227 lantSequenceWeakener]: Weakened 156 states. On average, predicates are now at 81% of their original sizes. [2019-10-02 17:33:51,817 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 17:33:51,923 INFO L420 sIntCurrentIteration]: We unified 158 AI predicates to 158 [2019-10-02 17:33:51,923 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 17:33:51,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 17:33:51,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2019-10-02 17:33:51,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:33:51,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 17:33:51,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 17:33:51,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-02 17:33:51,926 INFO L87 Difference]: Start difference. First operand 1218 states and 1637 transitions. Second operand 11 states.