java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label42_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 07:09:37,956 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 07:09:37,958 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 07:09:37,971 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 07:09:37,971 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 07:09:37,972 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 07:09:37,974 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 07:09:37,975 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 07:09:37,977 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 07:09:37,978 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 07:09:37,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 07:09:37,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 07:09:37,980 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 07:09:37,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 07:09:37,983 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 07:09:37,984 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 07:09:37,984 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 07:09:37,987 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 07:09:37,995 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 07:09:37,999 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 07:09:38,002 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 07:09:38,005 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 07:09:38,010 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 07:09:38,010 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 07:09:38,011 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 07:09:38,011 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 07:09:38,012 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 07:09:38,013 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 07:09:38,014 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 07:09:38,015 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 07:09:38,015 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 07:09:38,016 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 07:09:38,016 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 07:09:38,016 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 07:09:38,017 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 07:09:38,018 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 07:09:38,018 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 07:09:38,033 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 07:09:38,033 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 07:09:38,035 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 07:09:38,035 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 07:09:38,036 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 07:09:38,036 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 07:09:38,036 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 07:09:38,036 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 07:09:38,036 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 07:09:38,036 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 07:09:38,037 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 07:09:38,037 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 07:09:38,037 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 07:09:38,037 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 07:09:38,040 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 07:09:38,040 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 07:09:38,042 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 07:09:38,043 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 07:09:38,043 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 07:09:38,043 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 07:09:38,043 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 07:09:38,043 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 07:09:38,044 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 07:09:38,044 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 07:09:38,044 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 07:09:38,045 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 07:09:38,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:09:38,045 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 07:09:38,045 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 07:09:38,045 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 07:09:38,046 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 07:09:38,046 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 07:09:38,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 07:09:38,046 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 07:09:38,047 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 07:09:38,047 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 07:09:38,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 07:09:38,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 07:09:38,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 07:09:38,130 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 07:09:38,131 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 07:09:38,131 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label42_true-unreach-call_false-termination.c [2018-11-07 07:09:38,200 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c790633/7809718fcb664ab1bd399f334bcc297d/FLAG5042acb2d [2018-11-07 07:09:38,861 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 07:09:38,862 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label42_true-unreach-call_false-termination.c [2018-11-07 07:09:38,880 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c790633/7809718fcb664ab1bd399f334bcc297d/FLAG5042acb2d [2018-11-07 07:09:38,900 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c790633/7809718fcb664ab1bd399f334bcc297d [2018-11-07 07:09:38,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 07:09:38,914 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 07:09:38,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 07:09:38,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 07:09:38,922 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 07:09:38,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:09:38" (1/1) ... [2018-11-07 07:09:38,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d73b804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:38, skipping insertion in model container [2018-11-07 07:09:38,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:09:38" (1/1) ... [2018-11-07 07:09:38,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 07:09:38,994 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 07:09:39,460 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:09:39,465 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 07:09:39,582 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:09:39,601 INFO L193 MainTranslator]: Completed translation [2018-11-07 07:09:39,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:39 WrapperNode [2018-11-07 07:09:39,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 07:09:39,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 07:09:39,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 07:09:39,603 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 07:09:39,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:39" (1/1) ... [2018-11-07 07:09:39,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:39" (1/1) ... [2018-11-07 07:09:39,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 07:09:39,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 07:09:39,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 07:09:39,732 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 07:09:39,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:39" (1/1) ... [2018-11-07 07:09:39,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:39" (1/1) ... [2018-11-07 07:09:39,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:39" (1/1) ... [2018-11-07 07:09:39,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:39" (1/1) ... [2018-11-07 07:09:39,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:39" (1/1) ... [2018-11-07 07:09:39,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:39" (1/1) ... [2018-11-07 07:09:39,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:39" (1/1) ... [2018-11-07 07:09:39,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 07:09:39,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 07:09:39,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 07:09:39,855 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 07:09:39,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:09:39,928 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 07:09:39,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 07:09:39,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 07:09:39,929 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 07:09:39,929 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 07:09:39,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 07:09:39,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 07:09:39,931 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 07:09:39,931 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 07:09:43,690 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 07:09:43,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:09:43 BoogieIcfgContainer [2018-11-07 07:09:43,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 07:09:43,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 07:09:43,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 07:09:43,696 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 07:09:43,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:09:38" (1/3) ... [2018-11-07 07:09:43,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bc7820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:09:43, skipping insertion in model container [2018-11-07 07:09:43,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:39" (2/3) ... [2018-11-07 07:09:43,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bc7820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:09:43, skipping insertion in model container [2018-11-07 07:09:43,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:09:43" (3/3) ... [2018-11-07 07:09:43,701 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label42_true-unreach-call_false-termination.c [2018-11-07 07:09:43,712 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 07:09:43,722 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 07:09:43,737 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 07:09:43,778 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 07:09:43,779 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 07:09:43,779 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 07:09:43,779 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 07:09:43,779 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 07:09:43,782 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 07:09:43,782 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 07:09:43,782 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 07:09:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 07:09:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 07:09:43,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:43,847 INFO L375 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] [2018-11-07 07:09:43,850 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:43,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:43,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1675819633, now seen corresponding path program 1 times [2018-11-07 07:09:43,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:43,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:43,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:43,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:43,907 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:44,472 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:09:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:44,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:44,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:09:44,537 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:44,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:09:44,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:09:44,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:09:44,562 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 07:09:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:46,464 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-07 07:09:46,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:09:46,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-11-07 07:09:46,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:46,485 INFO L225 Difference]: With dead ends: 621 [2018-11-07 07:09:46,486 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 07:09:46,493 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:09:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 07:09:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-07 07:09:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-07 07:09:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-07 07:09:46,571 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 107 [2018-11-07 07:09:46,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:46,572 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-07 07:09:46,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:09:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-07 07:09:46,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-07 07:09:46,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:46,579 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 07:09:46,580 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:46,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:46,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1274103906, now seen corresponding path program 1 times [2018-11-07 07:09:46,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:46,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:46,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:46,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:46,582 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:46,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:46,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:09:46,812 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:46,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:09:46,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:09:46,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:09:46,816 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 3 states. [2018-11-07 07:09:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:48,162 INFO L93 Difference]: Finished difference Result 1057 states and 1749 transitions. [2018-11-07 07:09:48,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:09:48,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-07 07:09:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:48,171 INFO L225 Difference]: With dead ends: 1057 [2018-11-07 07:09:48,171 INFO L226 Difference]: Without dead ends: 681 [2018-11-07 07:09:48,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:09:48,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-07 07:09:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 676. [2018-11-07 07:09:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-11-07 07:09:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1044 transitions. [2018-11-07 07:09:48,231 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1044 transitions. Word has length 116 [2018-11-07 07:09:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:48,232 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 1044 transitions. [2018-11-07 07:09:48,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:09:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1044 transitions. [2018-11-07 07:09:48,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-07 07:09:48,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:48,240 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 07:09:48,240 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:48,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:48,241 INFO L82 PathProgramCache]: Analyzing trace with hash 63225070, now seen corresponding path program 1 times [2018-11-07 07:09:48,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:48,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:48,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:48,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:48,243 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:48,631 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-11-07 07:09:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:48,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:48,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:09:48,751 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:48,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:09:48,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:09:48,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:09:48,753 INFO L87 Difference]: Start difference. First operand 676 states and 1044 transitions. Second operand 5 states. [2018-11-07 07:09:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:50,564 INFO L93 Difference]: Finished difference Result 1491 states and 2375 transitions. [2018-11-07 07:09:50,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:09:50,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-11-07 07:09:50,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:50,570 INFO L225 Difference]: With dead ends: 1491 [2018-11-07 07:09:50,570 INFO L226 Difference]: Without dead ends: 675 [2018-11-07 07:09:50,574 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:09:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-11-07 07:09:50,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2018-11-07 07:09:50,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-11-07 07:09:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1032 transitions. [2018-11-07 07:09:50,600 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1032 transitions. Word has length 122 [2018-11-07 07:09:50,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:50,601 INFO L480 AbstractCegarLoop]: Abstraction has 675 states and 1032 transitions. [2018-11-07 07:09:50,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:09:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1032 transitions. [2018-11-07 07:09:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 07:09:50,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:50,605 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 07:09:50,605 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:50,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1081888773, now seen corresponding path program 1 times [2018-11-07 07:09:50,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:50,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:50,607 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:50,845 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:09:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:51,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:51,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:09:51,085 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:51,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:09:51,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:09:51,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:09:51,086 INFO L87 Difference]: Start difference. First operand 675 states and 1032 transitions. Second operand 6 states. [2018-11-07 07:09:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:53,190 INFO L93 Difference]: Finished difference Result 1489 states and 2269 transitions. [2018-11-07 07:09:53,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:09:53,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2018-11-07 07:09:53,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:53,197 INFO L225 Difference]: With dead ends: 1489 [2018-11-07 07:09:53,197 INFO L226 Difference]: Without dead ends: 820 [2018-11-07 07:09:53,200 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:09:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2018-11-07 07:09:53,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 810. [2018-11-07 07:09:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2018-11-07 07:09:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1137 transitions. [2018-11-07 07:09:53,239 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1137 transitions. Word has length 130 [2018-11-07 07:09:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:53,239 INFO L480 AbstractCegarLoop]: Abstraction has 810 states and 1137 transitions. [2018-11-07 07:09:53,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:09:53,239 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1137 transitions. [2018-11-07 07:09:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 07:09:53,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:53,243 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-11-07 07:09:53,243 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:53,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:53,243 INFO L82 PathProgramCache]: Analyzing trace with hash 507940818, now seen corresponding path program 1 times [2018-11-07 07:09:53,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:53,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:53,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:53,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:53,245 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:53,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:09:53,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:09:53,497 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2018-11-07 07:09:53,499 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [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], [527], [529], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:09:53,549 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:09:53,549 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:09:54,124 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:09:54,125 INFO L272 AbstractInterpreter]: Visited 108 different actions 108 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-11-07 07:09:54,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:54,180 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:09:54,547 INFO L227 lantSequenceWeakener]: Weakened 130 states. On average, predicates are now at 80.78% of their original sizes. [2018-11-07 07:09:54,547 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:09:54,812 INFO L415 sIntCurrentIteration]: We unified 138 AI predicates to 138 [2018-11-07 07:09:54,812 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:09:54,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:09:54,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-07 07:09:54,813 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:54,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:09:54,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:09:54,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:09:54,815 INFO L87 Difference]: Start difference. First operand 810 states and 1137 transitions. Second operand 6 states. [2018-11-07 07:10:04,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:04,213 INFO L93 Difference]: Finished difference Result 1764 states and 2478 transitions. [2018-11-07 07:10:04,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:10:04,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-11-07 07:10:04,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:04,218 INFO L225 Difference]: With dead ends: 1764 [2018-11-07 07:10:04,218 INFO L226 Difference]: Without dead ends: 960 [2018-11-07 07:10:04,221 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 07:10:04,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2018-11-07 07:10:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 957. [2018-11-07 07:10:04,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2018-11-07 07:10:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1292 transitions. [2018-11-07 07:10:04,248 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1292 transitions. Word has length 139 [2018-11-07 07:10:04,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:04,248 INFO L480 AbstractCegarLoop]: Abstraction has 957 states and 1292 transitions. [2018-11-07 07:10:04,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:10:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1292 transitions. [2018-11-07 07:10:04,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-07 07:10:04,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:10:04,252 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-07 07:10:04,253 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:10:04,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:04,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1244996254, now seen corresponding path program 1 times [2018-11-07 07:10:04,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:10:04,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:04,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:04,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:04,254 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:10:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:04,481 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-07 07:10:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:10:04,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:04,548 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:10:04,548 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 145 with the following transitions: [2018-11-07 07:10:04,548 INFO L202 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], [527], [529], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:10:04,554 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:10:04,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:10:04,843 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:10:04,843 INFO L272 AbstractInterpreter]: Visited 112 different actions 330 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:10:04,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:04,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:10:04,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:04,859 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:10:04,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:04,877 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:10:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:05,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:10:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:10:05,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:10:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:10:05,767 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:10:05,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 07:10:05,767 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:10:05,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:10:05,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:10:05,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:10:05,769 INFO L87 Difference]: Start difference. First operand 957 states and 1292 transitions. Second operand 3 states. [2018-11-07 07:10:07,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:07,666 INFO L93 Difference]: Finished difference Result 2610 states and 3633 transitions. [2018-11-07 07:10:07,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:10:07,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-11-07 07:10:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:07,677 INFO L225 Difference]: With dead ends: 2610 [2018-11-07 07:10:07,677 INFO L226 Difference]: Without dead ends: 909 [2018-11-07 07:10:07,683 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 288 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:10:07,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-11-07 07:10:07,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2018-11-07 07:10:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2018-11-07 07:10:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1117 transitions. [2018-11-07 07:10:07,717 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1117 transitions. Word has length 144 [2018-11-07 07:10:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:07,718 INFO L480 AbstractCegarLoop]: Abstraction has 909 states and 1117 transitions. [2018-11-07 07:10:07,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:10:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1117 transitions. [2018-11-07 07:10:07,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-07 07:10:07,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:10:07,722 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-11-07 07:10:07,723 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:10:07,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:07,723 INFO L82 PathProgramCache]: Analyzing trace with hash 534975569, now seen corresponding path program 1 times [2018-11-07 07:10:07,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:10:07,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:07,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:07,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:07,725 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:10:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 46 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 07:10:08,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:08,006 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:10:08,006 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2018-11-07 07:10:08,006 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [103], [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], [527], [529], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:10:08,011 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:10:08,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:10:08,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:10:08,375 INFO L272 AbstractInterpreter]: Visited 113 different actions 336 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 07:10:08,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:08,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:10:08,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:08,415 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:10:08,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:08,434 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:10:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:08,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:10:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 07:10:08,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:10:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 07:10:09,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:10:09,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2018-11-07 07:10:09,678 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:10:09,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 07:10:09,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 07:10:09,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-07 07:10:09,679 INFO L87 Difference]: Start difference. First operand 909 states and 1117 transitions. Second operand 11 states. [2018-11-07 07:10:13,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:13,158 INFO L93 Difference]: Finished difference Result 2256 states and 2860 transitions. [2018-11-07 07:10:13,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 07:10:13,158 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 156 [2018-11-07 07:10:13,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:13,159 INFO L225 Difference]: With dead ends: 2256 [2018-11-07 07:10:13,159 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 07:10:13,163 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 319 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2018-11-07 07:10:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 07:10:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 07:10:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 07:10:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 07:10:13,164 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2018-11-07 07:10:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:13,165 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 07:10:13,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 07:10:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 07:10:13,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 07:10:13,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 07:10:13,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:13,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:13,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:13,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:13,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:13,412 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2018-11-07 07:10:14,266 WARN L179 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2018-11-07 07:10:14,444 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2018-11-07 07:10:14,574 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2018-11-07 07:10:14,577 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:10:14,578 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a28~0 |old(~a28~0)|)) [2018-11-07 07:10:14,578 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:10:14,578 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,578 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,578 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,578 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,578 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,578 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 07:10:14,579 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 07:10:14,579 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 07:10:14,579 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 07:10:14,579 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 07:10:14,579 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 07:10:14,579 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 07:10:14,579 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 07:10:14,579 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 07:10:14,579 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 07:10:14,580 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 07:10:14,580 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 07:10:14,580 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 07:10:14,580 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,580 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,580 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,580 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,580 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,581 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 07:10:14,581 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 07:10:14,581 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 07:10:14,581 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 07:10:14,581 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 07:10:14,581 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 07:10:14,581 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 07:10:14,585 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 07:10:14,585 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 07:10:14,585 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 07:10:14,585 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 07:10:14,585 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 07:10:14,585 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 07:10:14,585 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 07:10:14,586 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 07:10:14,586 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 07:10:14,586 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,586 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,586 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,586 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,586 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,586 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 07:10:14,586 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 07:10:14,587 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 07:10:14,590 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 07:10:14,590 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 07:10:14,590 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 07:10:14,590 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 07:10:14,590 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 07:10:14,590 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 07:10:14,590 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 07:10:14,591 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 07:10:14,591 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,591 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,591 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,591 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,591 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,591 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 07:10:14,591 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 07:10:14,591 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 07:10:14,591 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 07:10:14,592 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 07:10:14,592 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 07:10:14,592 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 07:10:14,592 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 07:10:14,592 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 07:10:14,592 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 07:10:14,592 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 07:10:14,592 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 07:10:14,592 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 07:10:14,592 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,593 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,593 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,593 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,593 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,593 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 07:10:14,593 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 07:10:14,593 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 07:10:14,593 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 07:10:14,594 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 07:10:14,594 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 07:10:14,594 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 07:10:14,594 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 472) no Hoare annotation was computed. [2018-11-07 07:10:14,594 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 07:10:14,594 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 07:10:14,594 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 07:10:14,594 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 07:10:14,596 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 07:10:14,596 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 07:10:14,596 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 07:10:14,596 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 07:10:14,596 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 07:10:14,596 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,596 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,597 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,597 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,597 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,597 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 07:10:14,597 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 07:10:14,597 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,597 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 07:10:14,597 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 07:10:14,597 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 07:10:14,597 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,598 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,598 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 07:10:14,598 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 07:10:14,598 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 07:10:14,598 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 07:10:14,598 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 07:10:14,598 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 07:10:14,598 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 07:10:14,598 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 07:10:14,599 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 07:10:14,599 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 07:10:14,599 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 07:10:14,599 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,599 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,599 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,599 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,599 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,599 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,599 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 07:10:14,600 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 07:10:14,601 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 07:10:14,601 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 07:10:14,601 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 07:10:14,601 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 07:10:14,601 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 07:10:14,601 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 07:10:14,601 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 07:10:14,601 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 07:10:14,601 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 07:10:14,601 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,602 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,602 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,602 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,602 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,602 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,602 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 07:10:14,602 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 07:10:14,602 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 07:10:14,602 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 07:10:14,602 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 07:10:14,603 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 07:10:14,603 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 07:10:14,603 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 07:10:14,603 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 07:10:14,603 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 07:10:14,603 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 07:10:14,603 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 07:10:14,603 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 07:10:14,603 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 07:10:14,604 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,604 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,604 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,604 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,604 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse5 (= |old(~a17~0)| ~a17~0)) (.cse6 (= |old(~a25~0)| ~a25~0)) (.cse7 (= ~a28~0 |old(~a28~0)|))) (let ((.cse9 (= 1 |old(~a19~0)|)) (.cse8 (not (= 7 |old(~a28~0)|))) (.cse10 (not (= 8 |old(~a17~0)|))) (.cse4 (= 1 |old(~a11~0)|)) (.cse1 (= 1 |old(~a25~0)|)) (.cse0 (not (= 1 ~a21~0))) (.cse2 (and .cse5 .cse6 .cse7)) (.cse3 (< 8 |old(~a17~0)|))) (and (or .cse0 (not .cse1) .cse2 .cse3) (or .cse0 .cse4 (and .cse5 .cse6 .cse7 (not (= ~a11~0 1))) .cse3) (or (and (= ~a11~0 0) (= ~a19~0 1)) .cse0 .cse8 (not .cse9) (not (= 0 |old(~a11~0)|)) .cse10 (= |calculate_output_#in~input| 0) (not (= 0 |old(~a25~0)|))) (or .cse9 .cse0 .cse8 .cse10 (and (= 1 ~a11~0) (not (= 1 ~a19~0))) (not .cse4) .cse1) (or .cse0 (< 7 |old(~a17~0)|) (and (<= ~a17~0 7) .cse6)) (or .cse0 .cse2 (= 8 |old(~a28~0)|) .cse3)))) [2018-11-07 07:10:14,604 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,604 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,605 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 07:10:14,608 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 07:10:14,608 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 07:10:14,608 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 07:10:14,608 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 07:10:14,608 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 07:10:14,608 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 07:10:14,608 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 07:10:14,608 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 07:10:14,608 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 07:10:14,608 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 07:10:14,609 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 07:10:14,609 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 07:10:14,609 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,609 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,609 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,609 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,609 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,609 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,609 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 07:10:14,610 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 07:10:14,610 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 07:10:14,610 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 07:10:14,610 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 07:10:14,610 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 07:10:14,610 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 07:10:14,610 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 07:10:14,611 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 07:10:14,611 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 07:10:14,611 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 07:10:14,611 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 07:10:14,611 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 07:10:14,611 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 07:10:14,611 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 07:10:14,611 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 07:10:14,611 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,612 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,612 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,612 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,612 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:14,612 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 07:10:14,612 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 07:10:14,612 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 07:10:14,612 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 07:10:14,612 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 07:10:14,612 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 07:10:14,613 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 07:10:14,613 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 07:10:14,613 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 07:10:14,613 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 07:10:14,613 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 07:10:14,613 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 07:10:14,613 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 07:10:14,613 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 07:10:14,613 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 07:10:14,613 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 07:10:14,613 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 07:10:14,613 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 07:10:14,613 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 07:10:14,614 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:10:14,614 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-11-07 07:10:14,614 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 07:10:14,614 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:10:14,614 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 0 |old(~a11~0)|)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-07 07:10:14,614 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 07:10:14,614 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (<= ~a17~0 8))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (<= ~a17~0 7) (not (= 0 |old(~a11~0)|)) (and (not (= ~a11~0 1)) .cse0) (and (= 1 ~a25~0) .cse0) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (and (not (= ~a28~0 8)) .cse0) (not (= 0 |old(~a25~0)|)))) [2018-11-07 07:10:14,614 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 07:10:14,614 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 07:10:14,615 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (<= ~a17~0 8))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (<= ~a17~0 7) (not (= 0 |old(~a11~0)|)) (and (not (= ~a11~0 1)) .cse0) (and (= 1 ~a25~0) .cse0) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (and (not (= ~a28~0 8)) .cse0) (not (= 0 |old(~a25~0)|)))) [2018-11-07 07:10:14,615 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 07:10:14,615 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 07:10:14,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:10:14 BoogieIcfgContainer [2018-11-07 07:10:14,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 07:10:14,627 INFO L168 Benchmark]: Toolchain (without parser) took 35714.94 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -735.2 MB). Peak memory consumption was 355.8 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:14,628 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 07:10:14,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:14,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.53 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -810.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:14,631 INFO L168 Benchmark]: Boogie Preprocessor took 122.34 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:14,631 INFO L168 Benchmark]: RCFGBuilder took 3836.99 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 116.6 MB). Peak memory consumption was 116.6 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:14,632 INFO L168 Benchmark]: TraceAbstraction took 30933.94 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 370.7 MB). Free memory was 2.0 GB in the beginning and 2.1 GB in the end (delta: -86.8 MB). Peak memory consumption was 283.9 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:14,637 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 687.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 128.53 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -810.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.34 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3836.99 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 116.6 MB). Peak memory consumption was 116.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30933.94 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 370.7 MB). Free memory was 2.0 GB in the beginning and 2.1 GB in the end (delta: -86.8 MB). Peak memory consumption was 283.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 472]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((!(1 == a21) || !(7 == \old(a28))) || a17 <= 7) || !(0 == \old(a11))) || (!(a11 == 1) && a17 <= 8)) || (1 == a25 && a17 <= 8)) || !(1 == \old(a19))) || !(8 == \old(a17))) || (!(a28 == 8) && a17 <= 8)) || !(0 == \old(a25)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 30.8s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 22.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1456 SDtfs, 3648 SDslu, 831 SDs, 0 SdLazy, 5117 SolverSat, 1106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 807 GetRequests, 750 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=957occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.9975381940215702 AbsIntWeakeningRatio, 0.2391304347826087 AbsIntAvgWeakeningVarsNumRemoved, 27.043478260869566 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 44 PreInvPairs, 70 NumberOfFragments, 327 HoareAnnotationTreeSize, 44 FomulaSimplifications, 527 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 658 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1214 NumberOfCodeBlocks, 1214 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1503 ConstructedInterpolants, 0 QuantifiedInterpolants, 667102 SizeOfPredicates, 2 NumberOfNonLiveVariables, 853 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 370/412 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...