java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label49.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 21:43:01,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 21:43:01,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 21:43:01,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 21:43:01,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 21:43:01,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 21:43:01,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 21:43:01,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 21:43:01,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 21:43:01,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 21:43:01,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 21:43:01,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 21:43:01,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 21:43:01,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 21:43:01,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 21:43:01,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 21:43:01,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 21:43:01,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 21:43:01,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 21:43:01,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 21:43:01,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 21:43:01,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 21:43:01,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 21:43:01,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 21:43:01,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 21:43:01,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 21:43:01,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 21:43:01,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 21:43:01,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 21:43:01,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 21:43:01,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 21:43:01,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 21:43:01,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 21:43:01,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 21:43:01,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 21:43:01,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 21:43:01,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 21:43:01,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 21:43:01,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 21:43:01,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 21:43:01,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 21:43:01,911 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 21:43:01,953 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 21:43:01,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 21:43:01,953 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 21:43:01,954 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 21:43:01,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 21:43:01,958 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 21:43:01,958 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 21:43:01,958 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 21:43:01,958 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 21:43:01,958 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 21:43:01,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 21:43:01,959 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 21:43:01,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 21:43:01,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 21:43:01,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 21:43:01,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 21:43:01,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 21:43:01,963 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 21:43:01,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 21:43:01,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 21:43:01,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 21:43:01,964 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 21:43:01,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 21:43:01,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 21:43:01,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 21:43:01,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 21:43:01,965 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 21:43:01,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 21:43:01,966 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 21:43:01,966 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 21:43:02,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 21:43:02,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 21:43:02,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 21:43:02,043 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 21:43:02,043 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 21:43:02,044 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label49.c [2019-10-02 21:43:02,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a13ddda/b0cded1690464d53a55345609c09f6ed/FLAG94731b2be [2019-10-02 21:43:02,775 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 21:43:02,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label49.c [2019-10-02 21:43:02,798 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a13ddda/b0cded1690464d53a55345609c09f6ed/FLAG94731b2be [2019-10-02 21:43:02,932 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a13ddda/b0cded1690464d53a55345609c09f6ed [2019-10-02 21:43:02,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 21:43:02,944 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 21:43:02,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 21:43:02,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 21:43:02,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 21:43:02,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 09:43:02" (1/1) ... [2019-10-02 21:43:02,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d92a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:43:02, skipping insertion in model container [2019-10-02 21:43:02,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 09:43:02" (1/1) ... [2019-10-02 21:43:02,961 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 21:43:03,045 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 21:43:03,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 21:43:03,940 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 21:43:04,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 21:43:04,337 INFO L192 MainTranslator]: Completed translation [2019-10-02 21:43:04,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:43:04 WrapperNode [2019-10-02 21:43:04,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 21:43:04,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 21:43:04,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 21:43:04,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 21:43:04,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:43:04" (1/1) ... [2019-10-02 21:43:04,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:43:04" (1/1) ... [2019-10-02 21:43:04,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:43:04" (1/1) ... [2019-10-02 21:43:04,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:43:04" (1/1) ... [2019-10-02 21:43:04,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:43:04" (1/1) ... [2019-10-02 21:43:04,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:43:04" (1/1) ... [2019-10-02 21:43:04,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:43:04" (1/1) ... [2019-10-02 21:43:04,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 21:43:04,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 21:43:04,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 21:43:04,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 21:43:04,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:43:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 21:43:04,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 21:43:04,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 21:43:04,612 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 21:43:04,612 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-02 21:43:04,613 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 21:43:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 21:43:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-02 21:43:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 21:43:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 21:43:04,614 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 21:43:04,614 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 21:43:04,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 21:43:04,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 21:43:06,979 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 21:43:06,980 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 21:43:06,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 09:43:06 BoogieIcfgContainer [2019-10-02 21:43:06,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 21:43:06,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 21:43:06,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 21:43:06,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 21:43:06,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 09:43:02" (1/3) ... [2019-10-02 21:43:06,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35631068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 09:43:06, skipping insertion in model container [2019-10-02 21:43:06,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:43:04" (2/3) ... [2019-10-02 21:43:06,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35631068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 09:43:06, skipping insertion in model container [2019-10-02 21:43:06,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 09:43:06" (3/3) ... [2019-10-02 21:43:06,994 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label49.c [2019-10-02 21:43:07,006 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 21:43:07,021 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 21:43:07,039 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 21:43:07,072 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 21:43:07,072 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 21:43:07,072 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 21:43:07,072 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 21:43:07,072 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 21:43:07,072 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 21:43:07,073 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 21:43:07,073 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 21:43:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-10-02 21:43:07,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 21:43:07,122 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:43:07,123 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] [2019-10-02 21:43:07,125 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:43:07,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:43:07,131 INFO L82 PathProgramCache]: Analyzing trace with hash -971896627, now seen corresponding path program 1 times [2019-10-02 21:43:07,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:43:07,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:43:07,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:43:07,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:43:07,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:43:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:43:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:43:07,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:43:07,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 21:43:07,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:43:07,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 21:43:07,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 21:43:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 21:43:07,557 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 4 states. [2019-10-02 21:43:11,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:43:11,138 INFO L93 Difference]: Finished difference Result 1106 states and 1825 transitions. [2019-10-02 21:43:11,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 21:43:11,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-02 21:43:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:43:11,181 INFO L225 Difference]: With dead ends: 1106 [2019-10-02 21:43:11,181 INFO L226 Difference]: Without dead ends: 1019 [2019-10-02 21:43:11,183 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 21:43:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-10-02 21:43:11,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 682. [2019-10-02 21:43:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-10-02 21:43:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1148 transitions. [2019-10-02 21:43:11,296 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1148 transitions. Word has length 66 [2019-10-02 21:43:11,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:43:11,297 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1148 transitions. [2019-10-02 21:43:11,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 21:43:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1148 transitions. [2019-10-02 21:43:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 21:43:11,307 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:43:11,308 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 21:43:11,308 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:43:11,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:43:11,309 INFO L82 PathProgramCache]: Analyzing trace with hash -653341620, now seen corresponding path program 1 times [2019-10-02 21:43:11,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:43:11,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:43:11,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:43:11,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:43:11,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:43:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:43:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:43:11,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:43:11,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 21:43:11,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:43:11,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 21:43:11,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 21:43:11,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 21:43:11,578 INFO L87 Difference]: Start difference. First operand 682 states and 1148 transitions. Second operand 6 states. [2019-10-02 21:43:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:43:14,711 INFO L93 Difference]: Finished difference Result 1392 states and 2259 transitions. [2019-10-02 21:43:14,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 21:43:14,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-10-02 21:43:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:43:14,723 INFO L225 Difference]: With dead ends: 1392 [2019-10-02 21:43:14,724 INFO L226 Difference]: Without dead ends: 1392 [2019-10-02 21:43:14,725 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 21:43:14,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-10-02 21:43:14,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1374. [2019-10-02 21:43:14,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-10-02 21:43:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2217 transitions. [2019-10-02 21:43:14,815 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2217 transitions. Word has length 136 [2019-10-02 21:43:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:43:14,818 INFO L475 AbstractCegarLoop]: Abstraction has 1374 states and 2217 transitions. [2019-10-02 21:43:14,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 21:43:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2217 transitions. [2019-10-02 21:43:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 21:43:14,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:43:14,828 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 21:43:14,828 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:43:14,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:43:14,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1932739549, now seen corresponding path program 1 times [2019-10-02 21:43:14,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:43:14,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:43:14,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:43:14,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:43:14,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:43:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:43:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:43:15,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:43:15,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 21:43:15,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:43:15,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 21:43:15,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 21:43:15,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 21:43:15,054 INFO L87 Difference]: Start difference. First operand 1374 states and 2217 transitions. Second operand 5 states. [2019-10-02 21:43:17,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:43:17,846 INFO L93 Difference]: Finished difference Result 2095 states and 2832 transitions. [2019-10-02 21:43:17,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 21:43:17,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-10-02 21:43:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:43:17,864 INFO L225 Difference]: With dead ends: 2095 [2019-10-02 21:43:17,865 INFO L226 Difference]: Without dead ends: 2095 [2019-10-02 21:43:17,869 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 21:43:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2019-10-02 21:43:17,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 2079. [2019-10-02 21:43:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2019-10-02 21:43:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 2787 transitions. [2019-10-02 21:43:17,965 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 2787 transitions. Word has length 137 [2019-10-02 21:43:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:43:17,967 INFO L475 AbstractCegarLoop]: Abstraction has 2079 states and 2787 transitions. [2019-10-02 21:43:17,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 21:43:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 2787 transitions. [2019-10-02 21:43:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 21:43:17,970 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:43:17,971 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 21:43:17,971 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:43:17,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:43:17,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1687278437, now seen corresponding path program 1 times [2019-10-02 21:43:17,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:43:17,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:43:17,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:43:17,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:43:17,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:43:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:43:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:43:18,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:43:18,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 21:43:18,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:43:18,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 21:43:18,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 21:43:18,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 21:43:18,302 INFO L87 Difference]: Start difference. First operand 2079 states and 2787 transitions. Second operand 6 states. [2019-10-02 21:43:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:43:21,517 INFO L93 Difference]: Finished difference Result 4195 states and 5686 transitions. [2019-10-02 21:43:21,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 21:43:21,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 229 [2019-10-02 21:43:21,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:43:21,550 INFO L225 Difference]: With dead ends: 4195 [2019-10-02 21:43:21,551 INFO L226 Difference]: Without dead ends: 4195 [2019-10-02 21:43:21,552 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 21:43:21,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2019-10-02 21:43:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 4157. [2019-10-02 21:43:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4157 states. [2019-10-02 21:43:21,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4157 states to 4157 states and 5579 transitions. [2019-10-02 21:43:21,750 INFO L78 Accepts]: Start accepts. Automaton has 4157 states and 5579 transitions. Word has length 229 [2019-10-02 21:43:21,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:43:21,752 INFO L475 AbstractCegarLoop]: Abstraction has 4157 states and 5579 transitions. [2019-10-02 21:43:21,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 21:43:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 4157 states and 5579 transitions. [2019-10-02 21:43:21,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 21:43:21,757 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:43:21,757 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 21:43:21,758 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:43:21,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:43:21,759 INFO L82 PathProgramCache]: Analyzing trace with hash 914969597, now seen corresponding path program 1 times [2019-10-02 21:43:21,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:43:21,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:43:21,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:43:21,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:43:21,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:43:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:43:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:43:22,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:43:22,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 21:43:22,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:43:22,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 21:43:22,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 21:43:22,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 21:43:22,094 INFO L87 Difference]: Start difference. First operand 4157 states and 5579 transitions. Second operand 6 states. [2019-10-02 21:43:24,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:43:24,835 INFO L93 Difference]: Finished difference Result 5948 states and 7858 transitions. [2019-10-02 21:43:24,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 21:43:24,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-10-02 21:43:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:43:24,875 INFO L225 Difference]: With dead ends: 5948 [2019-10-02 21:43:24,875 INFO L226 Difference]: Without dead ends: 5948 [2019-10-02 21:43:24,876 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 21:43:24,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2019-10-02 21:43:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 5913. [2019-10-02 21:43:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5913 states. [2019-10-02 21:43:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5913 states to 5913 states and 7738 transitions. [2019-10-02 21:43:25,049 INFO L78 Accepts]: Start accepts. Automaton has 5913 states and 7738 transitions. Word has length 249 [2019-10-02 21:43:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:43:25,050 INFO L475 AbstractCegarLoop]: Abstraction has 5913 states and 7738 transitions. [2019-10-02 21:43:25,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 21:43:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 5913 states and 7738 transitions. [2019-10-02 21:43:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-02 21:43:25,055 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:43:25,055 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 21:43:25,055 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:43:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:43:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash -532122808, now seen corresponding path program 1 times [2019-10-02 21:43:25,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:43:25,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:43:25,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:43:25,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:43:25,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:43:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:43:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 177 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:43:25,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 21:43:25,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 21:43:25,489 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 266 with the following transitions: [2019-10-02 21:43:25,491 INFO L207 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [615], [617], [620], [628], [636], [644], [652], [660], [668], [673], [676], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [912], [1552], [1556], [1565], [1569], [1571], [1578], [1579], [1580], [1582], [1583] [2019-10-02 21:43:25,554 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 21:43:25,555 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 21:43:33,791 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 21:43:33,793 INFO L272 AbstractInterpreter]: Visited 134 different actions 134 times. Never merged. Never widened. Performed 305 root evaluator evaluations with a maximum evaluation depth of 14. Performed 305 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Never found a fixpoint. Largest state had 24 variables. [2019-10-02 21:43:33,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:43:33,798 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 21:43:40,113 INFO L227 lantSequenceWeakener]: Weakened 246 states. On average, predicates are now at 78.28% of their original sizes. [2019-10-02 21:43:40,114 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 21:43:40,219 INFO L420 sIntCurrentIteration]: We unified 264 AI predicates to 264 [2019-10-02 21:43:40,220 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 21:43:40,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 21:43:40,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2019-10-02 21:43:40,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:43:40,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 21:43:40,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 21:43:40,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-10-02 21:43:40,223 INFO L87 Difference]: Start difference. First operand 5913 states and 7738 transitions. Second operand 12 states. [2019-10-02 21:43:59,701 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.