java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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_label36_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:07:19,868 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:07:19,870 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:07:19,887 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:07:19,887 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:07:19,889 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:07:19,891 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:07:19,894 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:07:19,896 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:07:19,904 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:07:19,905 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:07:19,905 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:07:19,907 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:07:19,908 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:07:19,911 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:07:19,912 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:07:19,913 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:07:19,917 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:07:19,919 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:07:19,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:07:19,926 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:07:19,927 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:07:19,929 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:07:19,930 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:07:19,930 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:07:19,931 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:07:19,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:07:19,932 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:07:19,933 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:07:19,935 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:07:19,935 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:07:19,938 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:07:19,938 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:07:19,938 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:07:19,939 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:07:19,940 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:07:19,940 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:07:19,972 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:07:19,975 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:07:19,976 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:07:19,976 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:07:19,977 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:07:19,977 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:07:19,977 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:07:19,977 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:07:19,977 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:07:19,978 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:07:19,978 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:07:19,978 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:07:19,978 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:07:19,978 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:07:19,980 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:07:19,980 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:07:19,980 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:07:19,981 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:07:19,983 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:07:19,983 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:07:19,983 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:07:19,983 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:07:19,983 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:07:19,984 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:07:19,984 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:07:19,984 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:07:19,985 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:07:19,985 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:07:19,985 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:07:19,985 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:07:19,985 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:07:19,986 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:07:19,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:07:19,986 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:07:19,986 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:07:19,987 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:07:20,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:07:20,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:07:20,060 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:07:20,061 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:07:20,062 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:07:20,063 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label36_true-unreach-call_false-termination.c [2018-10-25 00:07:20,132 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9929ac427/4b7589fde3344d4497090f0c165f7133/FLAGf88e80e92 [2018-10-25 00:07:20,653 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:07:20,654 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label36_true-unreach-call_false-termination.c [2018-10-25 00:07:20,677 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9929ac427/4b7589fde3344d4497090f0c165f7133/FLAGf88e80e92 [2018-10-25 00:07:20,694 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9929ac427/4b7589fde3344d4497090f0c165f7133 [2018-10-25 00:07:20,707 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:07:20,710 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:07:20,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:07:20,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:07:20,717 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:07:20,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:07:20" (1/1) ... [2018-10-25 00:07:20,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6a7e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:20, skipping insertion in model container [2018-10-25 00:07:20,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:07:20" (1/1) ... [2018-10-25 00:07:20,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:07:20,812 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:07:21,307 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:07:21,315 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:07:21,415 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:07:21,434 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:07:21,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:21 WrapperNode [2018-10-25 00:07:21,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:07:21,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:07:21,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:07:21,436 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:07:21,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:21" (1/1) ... [2018-10-25 00:07:21,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:21" (1/1) ... [2018-10-25 00:07:21,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:07:21,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:07:21,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:07:21,648 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:07:21,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:21" (1/1) ... [2018-10-25 00:07:21,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:21" (1/1) ... [2018-10-25 00:07:21,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:21" (1/1) ... [2018-10-25 00:07:21,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:21" (1/1) ... [2018-10-25 00:07:21,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:21" (1/1) ... [2018-10-25 00:07:21,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:21" (1/1) ... [2018-10-25 00:07:21,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:21" (1/1) ... [2018-10-25 00:07:21,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:07:21,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:07:21,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:07:21,749 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:07:21,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 00:07:21,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:07:21,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:07:21,814 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:07:21,814 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:07:21,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:07:21,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:07:21,815 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:07:21,815 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:07:24,960 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:07:24,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:07:24 BoogieIcfgContainer [2018-10-25 00:07:24,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:07:24,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:07:24,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:07:24,966 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:07:24,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:07:20" (1/3) ... [2018-10-25 00:07:24,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3cfec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:07:24, skipping insertion in model container [2018-10-25 00:07:24,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:21" (2/3) ... [2018-10-25 00:07:24,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3cfec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:07:24, skipping insertion in model container [2018-10-25 00:07:24,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:07:24" (3/3) ... [2018-10-25 00:07:24,970 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label36_true-unreach-call_false-termination.c [2018-10-25 00:07:24,986 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:07:24,994 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:07:25,012 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:07:25,051 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:07:25,051 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:07:25,051 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:07:25,051 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:07:25,052 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:07:25,052 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:07:25,052 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:07:25,052 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:07:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:07:25,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-25 00:07:25,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:25,097 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:07:25,099 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:25,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:25,105 INFO L82 PathProgramCache]: Analyzing trace with hash -887392241, now seen corresponding path program 1 times [2018-10-25 00:07:25,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:25,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:25,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:25,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:25,169 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:25,759 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:07:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:07:25,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:07:25,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:07:25,840 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:25,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:07:25,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:07:25,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:07:25,867 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:07:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:27,329 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-10-25 00:07:27,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:07:27,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-10-25 00:07:27,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:27,349 INFO L225 Difference]: With dead ends: 618 [2018-10-25 00:07:27,350 INFO L226 Difference]: Without dead ends: 379 [2018-10-25 00:07:27,357 INFO L605 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-10-25 00:07:27,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-25 00:07:27,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-10-25 00:07:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-25 00:07:27,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-10-25 00:07:27,436 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 139 [2018-10-25 00:07:27,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:27,438 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-10-25 00:07:27,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:07:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-10-25 00:07:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-25 00:07:27,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:27,447 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:07:27,447 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:27,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:27,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1146144614, now seen corresponding path program 1 times [2018-10-25 00:07:27,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:27,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:27,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:27,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:27,451 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:27,762 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-10-25 00:07:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:07:27,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:07:27,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:07:27,896 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:27,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:07:27,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:07:27,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:07:27,902 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-10-25 00:07:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:30,307 INFO L93 Difference]: Finished difference Result 1231 states and 2094 transitions. [2018-10-25 00:07:30,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 00:07:30,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-10-25 00:07:30,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:30,320 INFO L225 Difference]: With dead ends: 1231 [2018-10-25 00:07:30,320 INFO L226 Difference]: Without dead ends: 858 [2018-10-25 00:07:30,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:07:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-10-25 00:07:30,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 821. [2018-10-25 00:07:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-25 00:07:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1290 transitions. [2018-10-25 00:07:30,391 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1290 transitions. Word has length 155 [2018-10-25 00:07:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:30,392 INFO L481 AbstractCegarLoop]: Abstraction has 821 states and 1290 transitions. [2018-10-25 00:07:30,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:07:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1290 transitions. [2018-10-25 00:07:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-25 00:07:30,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:30,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:07:30,400 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:30,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1857852795, now seen corresponding path program 1 times [2018-10-25 00:07:30,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:30,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:30,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:30,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:30,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:30,692 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:07:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:07:30,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:07:30,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:07:30,744 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:30,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:07:30,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:07:30,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:07:30,746 INFO L87 Difference]: Start difference. First operand 821 states and 1290 transitions. Second operand 6 states. [2018-10-25 00:07:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:35,473 INFO L93 Difference]: Finished difference Result 2553 states and 4218 transitions. [2018-10-25 00:07:35,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:07:35,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2018-10-25 00:07:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:35,500 INFO L225 Difference]: With dead ends: 2553 [2018-10-25 00:07:35,500 INFO L226 Difference]: Without dead ends: 1738 [2018-10-25 00:07:35,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:07:35,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-10-25 00:07:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1680. [2018-10-25 00:07:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-10-25 00:07:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2538 transitions. [2018-10-25 00:07:35,594 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2538 transitions. Word has length 162 [2018-10-25 00:07:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:35,594 INFO L481 AbstractCegarLoop]: Abstraction has 1680 states and 2538 transitions. [2018-10-25 00:07:35,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:07:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2538 transitions. [2018-10-25 00:07:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-25 00:07:35,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:35,603 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:07:35,603 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:35,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:35,604 INFO L82 PathProgramCache]: Analyzing trace with hash 195127661, now seen corresponding path program 1 times [2018-10-25 00:07:35,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:35,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:35,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:35,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:35,605 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 00:07:35,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:35,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:07:35,832 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-10-25 00:07:35,834 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:07:35,888 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:07:35,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:07:36,550 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:07:36,552 INFO L272 AbstractInterpreter]: Visited 140 different actions 140 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-10-25 00:07:36,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:36,581 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:07:37,063 INFO L232 lantSequenceWeakener]: Weakened 155 states. On average, predicates are now at 81.32% of their original sizes. [2018-10-25 00:07:37,064 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:07:37,313 INFO L413 sIntCurrentIteration]: We have 163 unified AI predicates [2018-10-25 00:07:37,314 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:07:37,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:07:37,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 00:07:37,315 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:37,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:07:37,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:07:37,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:07:37,317 INFO L87 Difference]: Start difference. First operand 1680 states and 2538 transitions. Second operand 6 states. [2018-10-25 00:07:43,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:43,597 INFO L93 Difference]: Finished difference Result 3502 states and 5277 transitions. [2018-10-25 00:07:43,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:07:43,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-10-25 00:07:43,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:43,609 INFO L225 Difference]: With dead ends: 3502 [2018-10-25 00:07:43,609 INFO L226 Difference]: Without dead ends: 1828 [2018-10-25 00:07:43,616 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:07:43,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2018-10-25 00:07:43,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1825. [2018-10-25 00:07:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1825 states. [2018-10-25 00:07:43,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2690 transitions. [2018-10-25 00:07:43,676 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2690 transitions. Word has length 164 [2018-10-25 00:07:43,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:43,676 INFO L481 AbstractCegarLoop]: Abstraction has 1825 states and 2690 transitions. [2018-10-25 00:07:43,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:07:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2690 transitions. [2018-10-25 00:07:43,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-25 00:07:43,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:43,685 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:07:43,686 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:43,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:43,686 INFO L82 PathProgramCache]: Analyzing trace with hash -6587698, now seen corresponding path program 1 times [2018-10-25 00:07:43,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:43,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:43,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:43,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:43,688 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 00:07:43,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:43,974 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:07:43,974 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-10-25 00:07:43,975 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:07:43,982 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:07:43,982 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:07:44,816 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:07:44,816 INFO L272 AbstractInterpreter]: Visited 144 different actions 429 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:07:44,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:44,854 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:07:45,928 INFO L232 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 81.94% of their original sizes. [2018-10-25 00:07:45,928 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:07:50,671 INFO L413 sIntCurrentIteration]: We have 173 unified AI predicates [2018-10-25 00:07:50,672 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:07:50,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:07:50,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2018-10-25 00:07:50,673 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:50,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:07:50,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:07:50,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:07:50,674 INFO L87 Difference]: Start difference. First operand 1825 states and 2690 transitions. Second operand 12 states. [2018-10-25 00:08:05,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:05,169 INFO L93 Difference]: Finished difference Result 5082 states and 7440 transitions. [2018-10-25 00:08:05,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:08:05,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 174 [2018-10-25 00:08:05,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:05,186 INFO L225 Difference]: With dead ends: 5082 [2018-10-25 00:08:05,186 INFO L226 Difference]: Without dead ends: 3263 [2018-10-25 00:08:05,193 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 177 GetRequests, 27 SyntacticMatches, 136 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:08:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3263 states. [2018-10-25 00:08:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3263 to 3067. [2018-10-25 00:08:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3067 states. [2018-10-25 00:08:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4235 transitions. [2018-10-25 00:08:05,284 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4235 transitions. Word has length 174 [2018-10-25 00:08:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:05,285 INFO L481 AbstractCegarLoop]: Abstraction has 3067 states and 4235 transitions. [2018-10-25 00:08:05,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:08:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4235 transitions. [2018-10-25 00:08:05,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-25 00:08:05,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:05,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:08:05,297 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:05,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:05,297 INFO L82 PathProgramCache]: Analyzing trace with hash -383543010, now seen corresponding path program 1 times [2018-10-25 00:08:05,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:05,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:05,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:05,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:05,299 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:08:05,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:05,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:08:05,529 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:05,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:08:05,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:08:05,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:08:05,531 INFO L87 Difference]: Start difference. First operand 3067 states and 4235 transitions. Second operand 3 states. [2018-10-25 00:08:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:06,614 INFO L93 Difference]: Finished difference Result 7134 states and 10403 transitions. [2018-10-25 00:08:06,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:08:06,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-10-25 00:08:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:06,635 INFO L225 Difference]: With dead ends: 7134 [2018-10-25 00:08:06,636 INFO L226 Difference]: Without dead ends: 2858 [2018-10-25 00:08:06,653 INFO L605 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-10-25 00:08:06,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2018-10-25 00:08:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2858. [2018-10-25 00:08:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2858 states. [2018-10-25 00:08:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 3654 transitions. [2018-10-25 00:08:06,724 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 3654 transitions. Word has length 176 [2018-10-25 00:08:06,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:06,725 INFO L481 AbstractCegarLoop]: Abstraction has 2858 states and 3654 transitions. [2018-10-25 00:08:06,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:08:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 3654 transitions. [2018-10-25 00:08:06,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-25 00:08:06,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:06,735 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:08:06,735 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:06,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:06,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2018561843, now seen corresponding path program 1 times [2018-10-25 00:08:06,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:06,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:06,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:06,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:06,737 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:06,990 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:08:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 66 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 00:08:07,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:07,177 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:07,178 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-10-25 00:08:07,178 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:07,188 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:07,188 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:07,730 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:08:07,730 INFO L272 AbstractInterpreter]: Visited 144 different actions 436 times. Merged at 8 different actions 26 times. Widened at 1 different actions 1 times. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:08:07,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:07,738 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:08:08,817 INFO L232 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 83.33% of their original sizes. [2018-10-25 00:08:08,817 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:08:13,784 INFO L413 sIntCurrentIteration]: We have 200 unified AI predicates [2018-10-25 00:08:13,785 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:08:13,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:08:13,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-10-25 00:08:13,786 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:13,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:08:13,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:08:13,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:08:13,787 INFO L87 Difference]: Start difference. First operand 2858 states and 3654 transitions. Second operand 12 states. [2018-10-25 00:08:27,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:27,496 INFO L93 Difference]: Finished difference Result 7075 states and 9010 transitions. [2018-10-25 00:08:27,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-25 00:08:27,496 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 201 [2018-10-25 00:08:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:27,516 INFO L225 Difference]: With dead ends: 7075 [2018-10-25 00:08:27,516 INFO L226 Difference]: Without dead ends: 4520 [2018-10-25 00:08:27,524 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 207 GetRequests, 30 SyntacticMatches, 160 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-10-25 00:08:27,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2018-10-25 00:08:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 4207. [2018-10-25 00:08:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4207 states. [2018-10-25 00:08:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4207 states to 4207 states and 5093 transitions. [2018-10-25 00:08:27,634 INFO L78 Accepts]: Start accepts. Automaton has 4207 states and 5093 transitions. Word has length 201 [2018-10-25 00:08:27,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:27,635 INFO L481 AbstractCegarLoop]: Abstraction has 4207 states and 5093 transitions. [2018-10-25 00:08:27,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:08:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4207 states and 5093 transitions. [2018-10-25 00:08:27,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-25 00:08:27,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:27,649 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:27,650 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:27,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:27,650 INFO L82 PathProgramCache]: Analyzing trace with hash -433238302, now seen corresponding path program 1 times [2018-10-25 00:08:27,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:27,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:27,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:27,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:27,651 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 107 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 00:08:27,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:27,872 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:27,872 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2018-10-25 00:08:27,872 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:27,876 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:27,876 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:29,148 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:08:29,149 INFO L272 AbstractInterpreter]: Visited 147 different actions 582 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-25 00:08:29,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:29,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:08:29,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:29,156 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 00:08:29,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:29,166 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:08:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:29,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:08:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-25 00:08:29,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:08:29,884 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 00:08:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 107 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 00:08:30,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:08:30,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-25 00:08:30,460 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:08:30,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:08:30,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:08:30,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:08:30,461 INFO L87 Difference]: Start difference. First operand 4207 states and 5093 transitions. Second operand 9 states. [2018-10-25 00:08:33,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:33,188 INFO L93 Difference]: Finished difference Result 9958 states and 12313 transitions. [2018-10-25 00:08:33,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 00:08:33,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 244 [2018-10-25 00:08:33,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:33,213 INFO L225 Difference]: With dead ends: 9958 [2018-10-25 00:08:33,213 INFO L226 Difference]: Without dead ends: 6052 [2018-10-25 00:08:33,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 487 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-10-25 00:08:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2018-10-25 00:08:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 6005. [2018-10-25 00:08:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6005 states. [2018-10-25 00:08:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6005 states to 6005 states and 7306 transitions. [2018-10-25 00:08:33,417 INFO L78 Accepts]: Start accepts. Automaton has 6005 states and 7306 transitions. Word has length 244 [2018-10-25 00:08:33,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:33,417 INFO L481 AbstractCegarLoop]: Abstraction has 6005 states and 7306 transitions. [2018-10-25 00:08:33,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:08:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6005 states and 7306 transitions. [2018-10-25 00:08:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-25 00:08:33,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:33,436 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:33,437 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:33,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:33,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1128509478, now seen corresponding path program 1 times [2018-10-25 00:08:33,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:33,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:33,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:33,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:33,439 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 115 proven. 35 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-25 00:08:33,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:33,886 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:33,886 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 249 with the following transitions: [2018-10-25 00:08:33,886 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:33,888 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:33,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:34,767 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:08:34,767 INFO L272 AbstractInterpreter]: Visited 147 different actions 585 times. Merged at 8 different actions 37 times. Widened at 1 different actions 3 times. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-25 00:08:34,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:34,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:08:34,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:34,804 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 00:08:34,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:34,816 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:08:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:34,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:08:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:08:35,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:08:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:08:35,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:08:35,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-25 00:08:35,513 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:08:35,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:08:35,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:08:35,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:08:35,515 INFO L87 Difference]: Start difference. First operand 6005 states and 7306 transitions. Second operand 9 states. [2018-10-25 00:08:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:39,884 INFO L93 Difference]: Finished difference Result 10885 states and 13439 transitions. [2018-10-25 00:08:39,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-25 00:08:39,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 248 [2018-10-25 00:08:39,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:39,902 INFO L225 Difference]: With dead ends: 10885 [2018-10-25 00:08:39,902 INFO L226 Difference]: Without dead ends: 3615 [2018-10-25 00:08:39,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 514 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2018-10-25 00:08:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2018-10-25 00:08:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3499. [2018-10-25 00:08:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3499 states. [2018-10-25 00:08:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 4012 transitions. [2018-10-25 00:08:40,013 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 4012 transitions. Word has length 248 [2018-10-25 00:08:40,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:40,013 INFO L481 AbstractCegarLoop]: Abstraction has 3499 states and 4012 transitions. [2018-10-25 00:08:40,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:08:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 4012 transitions. [2018-10-25 00:08:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-25 00:08:40,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:40,025 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:40,025 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:40,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:40,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1231061936, now seen corresponding path program 1 times [2018-10-25 00:08:40,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:40,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:40,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:40,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:40,027 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 105 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 00:08:40,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:40,768 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:40,768 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 250 with the following transitions: [2018-10-25 00:08:40,768 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:40,771 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:40,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:41,820 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:08:41,820 INFO L272 AbstractInterpreter]: Visited 144 different actions 424 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:08:41,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:41,859 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:08:43,127 INFO L232 lantSequenceWeakener]: Weakened 168 states. On average, predicates are now at 81.42% of their original sizes. [2018-10-25 00:08:43,127 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:08:46,267 INFO L413 sIntCurrentIteration]: We have 248 unified AI predicates [2018-10-25 00:08:46,268 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:08:46,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:08:46,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 21 [2018-10-25 00:08:46,268 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:46,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-25 00:08:46,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-25 00:08:46,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:08:46,269 INFO L87 Difference]: Start difference. First operand 3499 states and 4012 transitions. Second operand 13 states. [2018-10-25 00:08:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:58,394 INFO L93 Difference]: Finished difference Result 6731 states and 7765 transitions. [2018-10-25 00:08:58,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-25 00:08:58,395 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 249 [2018-10-25 00:08:58,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:58,412 INFO L225 Difference]: With dead ends: 6731 [2018-10-25 00:08:58,412 INFO L226 Difference]: Without dead ends: 4812 [2018-10-25 00:08:58,417 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 253 GetRequests, 86 SyntacticMatches, 151 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:08:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2018-10-25 00:08:58,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4761. [2018-10-25 00:08:58,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4761 states. [2018-10-25 00:08:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 5415 transitions. [2018-10-25 00:08:58,532 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 5415 transitions. Word has length 249 [2018-10-25 00:08:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:58,533 INFO L481 AbstractCegarLoop]: Abstraction has 4761 states and 5415 transitions. [2018-10-25 00:08:58,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-25 00:08:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 5415 transitions. [2018-10-25 00:08:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-25 00:08:58,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:58,549 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:08:58,549 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:58,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:58,549 INFO L82 PathProgramCache]: Analyzing trace with hash 313421001, now seen corresponding path program 1 times [2018-10-25 00:08:58,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:58,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:58,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:58,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:58,551 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 160 proven. 95 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-25 00:08:59,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:59,350 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:59,350 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 305 with the following transitions: [2018-10-25 00:08:59,351 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:59,353 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:59,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:09:00,013 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:09:00,013 INFO L272 AbstractInterpreter]: Visited 147 different actions 585 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:09:00,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:00,021 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:09:02,208 INFO L232 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 81.94% of their original sizes. [2018-10-25 00:09:02,208 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:09:09,652 INFO L413 sIntCurrentIteration]: We have 303 unified AI predicates [2018-10-25 00:09:09,652 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:09:09,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:09:09,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [10] total 23 [2018-10-25 00:09:09,653 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:09:09,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:09:09,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:09:09,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:09:09,654 INFO L87 Difference]: Start difference. First operand 4761 states and 5415 transitions. Second operand 15 states. [2018-10-25 00:09:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:25,354 INFO L93 Difference]: Finished difference Result 6858 states and 7779 transitions. [2018-10-25 00:09:25,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-25 00:09:25,355 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 304 [2018-10-25 00:09:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:25,355 INFO L225 Difference]: With dead ends: 6858 [2018-10-25 00:09:25,355 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:09:25,367 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 309 GetRequests, 36 SyntacticMatches, 254 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1801 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-10-25 00:09:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:09:25,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:09:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:09:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:09:25,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 304 [2018-10-25 00:09:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:25,369 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:09:25,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:09:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:09:25,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:09:25,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:09:25,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:25,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:26,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:26,378 WARN L179 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 186 [2018-10-25 00:09:26,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:26,780 WARN L179 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 193 [2018-10-25 00:09:27,602 WARN L179 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-10-25 00:09:27,929 WARN L179 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 77 [2018-10-25 00:09:39,732 WARN L179 SmtUtils]: Spent 11.78 s on a formula simplification. DAG size of input: 310 DAG size of output: 80 [2018-10-25 00:09:40,759 WARN L179 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 202 DAG size of output: 97 [2018-10-25 00:09:41,771 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 208 DAG size of output: 97 [2018-10-25 00:09:41,774 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:09:41,774 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-10-25 00:09:41,774 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:09:41,775 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,775 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,775 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,775 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,775 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,775 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:09:41,775 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:09:41,775 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:09:41,775 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:09:41,776 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:09:41,776 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:09:41,776 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:09:41,776 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:09:41,776 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:09:41,776 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:09:41,776 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:09:41,776 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:09:41,777 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:09:41,777 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,777 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,777 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,777 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,777 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:09:41,777 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,777 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:09:41,777 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:09:41,778 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:09:41,778 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:09:41,778 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:09:41,778 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:09:41,778 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:09:41,778 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:09:41,778 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:09:41,778 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:09:41,778 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:09:41,779 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:09:41,779 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:09:41,779 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:09:41,779 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:09:41,779 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,779 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,779 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,779 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,779 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,779 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:09:41,780 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:09:41,780 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:09:41,780 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:09:41,780 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:09:41,780 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:09:41,780 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:09:41,780 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:09:41,780 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:09:41,781 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:09:41,781 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:09:41,781 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,781 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,781 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,781 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,781 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,781 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:09:41,781 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:09:41,782 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:09:41,782 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:09:41,782 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:09:41,782 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:09:41,782 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:09:41,782 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:09:41,782 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:09:41,782 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:09:41,782 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:09:41,783 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:09:41,783 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:09:41,783 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,783 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,783 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,783 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,783 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,783 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:09:41,783 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:09:41,783 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:09:41,784 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:09:41,784 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:09:41,784 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:09:41,784 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:09:41,784 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:09:41,784 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:09:41,784 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:09:41,784 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:09:41,784 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:09:41,784 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:09:41,785 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:09:41,785 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:09:41,785 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:09:41,785 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,785 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,785 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,785 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,785 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:09:41,785 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,786 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:09:41,786 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,786 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:09:41,786 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:09:41,786 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:09:41,786 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,786 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,786 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:09:41,786 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:09:41,787 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:09:41,787 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:09:41,787 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:09:41,787 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:09:41,787 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:09:41,787 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:09:41,787 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:09:41,787 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:09:41,787 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:09:41,788 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,788 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,788 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,788 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,788 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,788 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,788 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:09:41,788 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:09:41,789 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:09:41,789 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:09:41,789 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:09:41,789 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:09:41,789 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:09:41,789 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:09:41,789 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:09:41,789 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:09:41,789 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:09:41,790 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 568) no Hoare annotation was computed. [2018-10-25 00:09:41,790 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,790 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,790 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,790 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,790 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,790 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,791 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:09:41,791 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:09:41,791 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:09:41,791 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:09:41,791 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:09:41,791 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:09:41,791 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:09:41,791 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:09:41,791 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:09:41,791 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:09:41,792 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:09:41,792 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:09:41,792 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:09:41,792 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:09:41,792 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,792 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,792 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,793 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse17 (not (= ~a28~0 0))) (.cse18 (= ~a19~0 1))) (let ((.cse2 (<= ~a17~0 |old(~a17~0)|)) (.cse3 (= |old(~a28~0)| ~a28~0)) (.cse21 (and .cse17 .cse18 (= ~a21~0 1) (not (= ~a17~0 0)))) (.cse6 (= ~a25~0 |old(~a25~0)|)) (.cse24 (not (= 1 |old(~a19~0)|))) (.cse14 (not (= 1 ~a21~0))) (.cse15 (= 0 |old(~a28~0)|)) (.cse16 (not (= 8 |old(~a17~0)|))) (.cse13 (= ~a17~0 8)) (.cse1 (= 1 |old(~a25~0)|))) (let ((.cse4 (= |old(~a19~0)| ~a19~0)) (.cse5 (= 1 ~a11~0)) (.cse19 (= |old(~a25~0)| ~a25~0)) (.cse0 (not (= 1 |old(~a11~0)|))) (.cse8 (not .cse1)) (.cse23 (and (= ~a11~0 0) .cse13)) (.cse22 (or .cse14 .cse15 (not (= 0 |old(~a11~0)|)) .cse16)) (.cse20 (or .cse14 .cse24 .cse15 .cse16)) (.cse12 (< 10 |old(~a28~0)|)) (.cse9 (or .cse14 (= 0 |old(~a17~0)|) .cse24 .cse15)) (.cse10 (and .cse2 .cse3 (= ~a11~0 |old(~a11~0)|) .cse21 .cse6)) (.cse11 (= |old(~a11~0)| |old(~a19~0)|)) (.cse7 (< 7 |old(~a17~0)|))) (and (or (or .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) (or .cse8 .cse9 .cse10 .cse11 .cse7) (or .cse12 (and .cse3 .cse13) .cse0 .cse8 (or .cse14 .cse15 .cse16)) (or (and .cse5 (and .cse17 .cse13 .cse18) .cse19) .cse0 .cse20) (or .cse12 .cse8 .cse9 (and .cse2 .cse3 .cse5 .cse21 .cse6) .cse0 .cse7) (or .cse12 .cse22 (and .cse3 .cse4 .cse23 .cse6)) (or (and .cse4 .cse5 .cse19) .cse11 .cse0) (or (= 7 |old(~a17~0)|) (not (= ~a17~0 7)) .cse11 .cse0) (or .cse8 (and .cse3 .cse18 .cse23 .cse6) .cse22 .cse20) (or .cse12 .cse9 .cse10 .cse11 .cse7))))) [2018-10-25 00:09:41,793 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,793 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,793 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,793 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:09:41,793 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:09:41,794 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:09:41,794 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:09:41,794 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:09:41,794 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:09:41,794 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:09:41,794 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:09:41,794 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:09:41,794 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:09:41,794 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:09:41,794 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:09:41,795 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:09:41,795 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,795 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,795 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,795 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,795 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,795 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,795 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:09:41,795 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:09:41,796 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:09:41,796 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:09:41,796 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:09:41,796 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:09:41,796 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:09:41,796 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:09:41,796 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:09:41,796 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:09:41,796 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:09:41,796 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:09:41,797 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:09:41,797 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:09:41,797 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:09:41,797 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:09:41,797 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,797 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,797 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,797 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,797 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,798 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:09:41,798 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:09:41,798 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:09:41,798 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:09:41,798 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:09:41,798 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:09:41,798 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:09:41,798 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:09:41,798 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:09:41,798 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:09:41,798 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:09:41,799 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:09:41,799 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:09:41,799 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:09:41,799 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:09:41,799 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:09:41,799 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:09:41,799 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:09:41,799 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:09:41,799 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:09:41,800 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-10-25 00:09:41,800 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:09:41,800 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:09:41,800 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (= ~a19~0 1) (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:09:41,800 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:09:41,800 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse6 (not (= ~a28~0 0))) (.cse7 (= ~a17~0 8)) (.cse0 (= ~a21~0 1))) (let ((.cse3 (and (= ~a11~0 0) .cse6 .cse7 .cse0)) (.cse4 (and .cse6 .cse7 (= ~a19~0 1) .cse0)) (.cse5 (<= ~a17~0 7)) (.cse1 (= 1 ~a11~0)) (.cse2 (<= ~a28~0 10))) (or (not .cse0) (not (= ~y~0 25)) (and .cse1 (not (= ~a19~0 ~a11~0))) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse2 .cse3) (and (and (= 1 ~a25~0) .cse4) .cse3) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse5 .cse1 .cse2 (and .cse6 (not (= ~a17~0 0)))) (and .cse1 .cse4) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse5 (not (= ~a25~0 1)) .cse1 .cse2) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-10-25 00:09:41,801 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:09:41,801 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:09:41,801 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse6 (not (= ~a28~0 0))) (.cse7 (= ~a17~0 8)) (.cse0 (= ~a21~0 1))) (let ((.cse3 (and (= ~a11~0 0) .cse6 .cse7 .cse0)) (.cse4 (and .cse6 .cse7 (= ~a19~0 1) .cse0)) (.cse5 (<= ~a17~0 7)) (.cse1 (= 1 ~a11~0)) (.cse2 (<= ~a28~0 10))) (or (not .cse0) (not (= ~y~0 25)) (and .cse1 (not (= ~a19~0 ~a11~0))) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse2 .cse3) (and (and (= 1 ~a25~0) .cse4) .cse3) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse5 .cse1 .cse2 (and .cse6 (not (= ~a17~0 0)))) (and .cse1 .cse4) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse5 (not (= ~a25~0 1)) .cse1 .cse2) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-10-25 00:09:41,801 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:09:41,801 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:09:41,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:09:41 BoogieIcfgContainer [2018-10-25 00:09:41,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:09:41,817 INFO L168 Benchmark]: Toolchain (without parser) took 141109.58 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 19.2 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-25 00:09:41,818 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:09:41,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.17 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-10-25 00:09:41,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 211.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:41,820 INFO L168 Benchmark]: Boogie Preprocessor took 100.80 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:09:41,821 INFO L168 Benchmark]: RCFGBuilder took 3213.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.6 MB). Peak memory consumption was 108.6 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:41,822 INFO L168 Benchmark]: TraceAbstraction took 136853.85 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 1.4 GB in the end (delta: 684.0 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-25 00:09:41,826 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 724.17 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 211.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.80 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3213.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.6 MB). Peak memory consumption was 108.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 136853.85 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 1.4 GB in the end (delta: 684.0 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 568]: 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: (((((((((((((((((((((!(a21 == 1) || !(y == 25)) || (1 == a11 && !(a19 == a11))) || !(1 == \old(a19))) || !(x == 24)) || (a28 <= 10 && ((a11 == 0 && !(a28 == 0)) && a17 == 8) && a21 == 1)) || ((1 == a25 && ((!(a28 == 0) && a17 == 8) && a19 == 1) && a21 == 1) && ((a11 == 0 && !(a28 == 0)) && a17 == 8) && a21 == 1)) || !(e == 5)) || !(d == 4)) || (((a17 <= 7 && 1 == a11) && a28 <= 10) && !(a28 == 0) && !(a17 == 0))) || (1 == a11 && ((!(a28 == 0) && a17 == 8) && a19 == 1) && a21 == 1)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || (((a17 <= 7 && !(a25 == 1)) && 1 == a11) && a28 <= 10)) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 136.7s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 79.4s AutomataDifference, 0.0s DeadEndRemovalTime, 16.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1518 SDtfs, 9177 SDslu, 1281 SDs, 0 SdLazy, 16081 SolverSat, 1724 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.5s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2189 GetRequests, 1348 SyntacticMatches, 708 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4689 ImplicationChecksByTransitivity, 23.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6005occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.1s AbstIntTime, 7 AbstIntIterations, 5 AbstIntStrong, 0.9972100536386347 AbsIntWeakeningRatio, 0.18951241950321987 AbsIntAvgWeakeningVarsNumRemoved, 4.43146274149034 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 821 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 188 PreInvPairs, 272 NumberOfFragments, 908 HoareAnnotationTreeSize, 188 FomulaSimplifications, 27082 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 39015 FormulaSimplificationTreeSizeReductionInter, 14.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2708 NumberOfCodeBlocks, 2708 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3185 ConstructedInterpolants, 0 QuantifiedInterpolants, 1334632 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1098 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 1373/1667 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...