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/Problem01_label29_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:02:07,888 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:02:07,890 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:02:07,902 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:02:07,902 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:02:07,903 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:02:07,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:02:07,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:02:07,908 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:02:07,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:02:07,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:02:07,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:02:07,911 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:02:07,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:02:07,917 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:02:07,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:02:07,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:02:07,928 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:02:07,933 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:02:07,938 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:02:07,940 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:02:07,943 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:02:07,947 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:02:07,948 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:02:07,948 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:02:07,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:02:07,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:02:07,953 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:02:07,954 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:02:07,956 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:02:07,957 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:02:07,957 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:02:07,958 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:02:07,959 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:02:07,961 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:02:07,961 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:02:07,962 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:02:07,990 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:02:07,990 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:02:07,992 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:02:07,992 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:02:07,992 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:02:07,992 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:02:07,993 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:02:07,993 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:02:07,993 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:02:07,993 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:02:07,993 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:02:07,996 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:02:07,997 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:02:07,997 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:02:07,998 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:02:07,998 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:02:07,998 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:02:07,998 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:02:07,999 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:02:08,000 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:02:08,001 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:02:08,001 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:02:08,001 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:02:08,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:02:08,001 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:02:08,002 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:02:08,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:02:08,002 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:02:08,003 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:02:08,003 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:02:08,003 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:02:08,003 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:02:08,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:02:08,003 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:02:08,004 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:02:08,004 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:02:08,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:02:08,085 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:02:08,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:02:08,091 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:02:08,091 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:02:08,092 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-10-25 00:02:08,158 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ae5dbae59/e1dbef205db5442f90e25eff8155f8dc/FLAG7dca4cf42 [2018-10-25 00:02:08,735 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:02:08,736 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-10-25 00:02:08,761 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ae5dbae59/e1dbef205db5442f90e25eff8155f8dc/FLAG7dca4cf42 [2018-10-25 00:02:08,785 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ae5dbae59/e1dbef205db5442f90e25eff8155f8dc [2018-10-25 00:02:08,799 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:02:08,801 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:02:08,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:02:08,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:02:08,808 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:02:08,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:02:08" (1/1) ... [2018-10-25 00:02:08,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f51eb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:08, skipping insertion in model container [2018-10-25 00:02:08,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:02:08" (1/1) ... [2018-10-25 00:02:08,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:02:08,898 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:02:09,419 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:02:09,429 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:02:09,582 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:02:09,605 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:02:09,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:09 WrapperNode [2018-10-25 00:02:09,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:02:09,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:02:09,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:02:09,608 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:02:09,618 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:02:09" (1/1) ... [2018-10-25 00:02:09,637 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:02:09" (1/1) ... [2018-10-25 00:02:09,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:02:09,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:02:09,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:02:09,811 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:02:09,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:09" (1/1) ... [2018-10-25 00:02:09,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:09" (1/1) ... [2018-10-25 00:02:09,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:09" (1/1) ... [2018-10-25 00:02:09,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:09" (1/1) ... [2018-10-25 00:02:09,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:09" (1/1) ... [2018-10-25 00:02:09,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:09" (1/1) ... [2018-10-25 00:02:09,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:09" (1/1) ... [2018-10-25 00:02:09,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:02:09,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:02:09,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:02:09,911 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:02:09,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:09" (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:02:09,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:02:09,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:02:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:02:09,967 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:02:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:02:09,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:02:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:02:09,968 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:02:13,075 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:02:13,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:02:13 BoogieIcfgContainer [2018-10-25 00:02:13,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:02:13,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:02:13,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:02:13,081 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:02:13,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:02:08" (1/3) ... [2018-10-25 00:02:13,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbae72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:02:13, skipping insertion in model container [2018-10-25 00:02:13,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:09" (2/3) ... [2018-10-25 00:02:13,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbae72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:02:13, skipping insertion in model container [2018-10-25 00:02:13,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:02:13" (3/3) ... [2018-10-25 00:02:13,085 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label29_true-unreach-call_false-termination.c [2018-10-25 00:02:13,096 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:02:13,105 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:02:13,127 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:02:13,183 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:02:13,183 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:02:13,184 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:02:13,184 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:02:13,184 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:02:13,184 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:02:13,185 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:02:13,185 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:02:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-25 00:02:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-25 00:02:13,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:13,236 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] [2018-10-25 00:02:13,239 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:13,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:13,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2096081016, now seen corresponding path program 1 times [2018-10-25 00:02:13,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:13,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:13,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:13,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:13,305 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:13,931 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:02:14,076 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:02:14,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:14,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:02:14,080 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:14,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:02:14,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:02:14,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:02:14,110 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-25 00:02:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:15,920 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-25 00:02:15,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:02:15,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-10-25 00:02:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:15,942 INFO L225 Difference]: With dead ends: 550 [2018-10-25 00:02:15,943 INFO L226 Difference]: Without dead ends: 340 [2018-10-25 00:02:15,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:02:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-25 00:02:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-25 00:02:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-25 00:02:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-10-25 00:02:16,032 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 108 [2018-10-25 00:02:16,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:16,033 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-10-25 00:02:16,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:02:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-10-25 00:02:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-25 00:02:16,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:16,039 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-25 00:02:16,040 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:16,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:16,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1737414697, now seen corresponding path program 1 times [2018-10-25 00:02:16,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:16,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:16,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:16,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:16,042 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:16,225 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:16,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:16,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:02:16,226 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:16,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:02:16,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:02:16,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:02:16,229 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-10-25 00:02:18,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:18,109 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-10-25 00:02:18,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:02:18,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-10-25 00:02:18,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:18,116 INFO L225 Difference]: With dead ends: 888 [2018-10-25 00:02:18,116 INFO L226 Difference]: Without dead ends: 554 [2018-10-25 00:02:18,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:02:18,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-25 00:02:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-10-25 00:02:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-25 00:02:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-10-25 00:02:18,165 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 119 [2018-10-25 00:02:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:18,166 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-10-25 00:02:18,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:02:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-10-25 00:02:18,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-25 00:02:18,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:18,171 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-25 00:02:18,171 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:18,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1875739691, now seen corresponding path program 1 times [2018-10-25 00:02:18,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:18,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:18,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:18,174 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:18,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:18,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:02:18,668 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:18,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:02:18,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:02:18,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:02:18,670 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-10-25 00:02:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:20,291 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-10-25 00:02:20,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:02:20,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-10-25 00:02:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:20,299 INFO L225 Difference]: With dead ends: 1210 [2018-10-25 00:02:20,299 INFO L226 Difference]: Without dead ends: 536 [2018-10-25 00:02:20,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:02:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-25 00:02:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-10-25 00:02:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-10-25 00:02:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-10-25 00:02:20,345 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 120 [2018-10-25 00:02:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:20,346 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-10-25 00:02:20,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:02:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-10-25 00:02:20,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-25 00:02:20,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:20,350 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-25 00:02:20,355 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:20,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:20,356 INFO L82 PathProgramCache]: Analyzing trace with hash 967812819, now seen corresponding path program 1 times [2018-10-25 00:02:20,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:20,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:20,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:20,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:20,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:21,056 WARN L179 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-10-25 00:02:21,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:21,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:21,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:02:21,145 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:21,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:02:21,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:02:21,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:02:21,146 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-10-25 00:02:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:23,493 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-10-25 00:02:23,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:02:23,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-10-25 00:02:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:23,498 INFO L225 Difference]: With dead ends: 1204 [2018-10-25 00:02:23,498 INFO L226 Difference]: Without dead ends: 535 [2018-10-25 00:02:23,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:02:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-10-25 00:02:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-10-25 00:02:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-25 00:02:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-10-25 00:02:23,517 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 121 [2018-10-25 00:02:23,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:23,518 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-10-25 00:02:23,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:02:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-10-25 00:02:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-25 00:02:23,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:23,521 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-25 00:02:23,521 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:23,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:23,522 INFO L82 PathProgramCache]: Analyzing trace with hash -394694497, now seen corresponding path program 1 times [2018-10-25 00:02:23,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:23,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:23,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:23,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:23,524 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:23,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:23,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:23,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:02:23,744 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:23,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:02:23,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:02:23,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:02:23,745 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-10-25 00:02:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:24,930 INFO L93 Difference]: Finished difference Result 1522 states and 2300 transitions. [2018-10-25 00:02:24,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:02:24,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-10-25 00:02:24,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:24,947 INFO L225 Difference]: With dead ends: 1522 [2018-10-25 00:02:24,947 INFO L226 Difference]: Without dead ends: 993 [2018-10-25 00:02:24,950 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:02:24,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-10-25 00:02:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 993. [2018-10-25 00:02:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2018-10-25 00:02:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1418 transitions. [2018-10-25 00:02:24,990 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1418 transitions. Word has length 126 [2018-10-25 00:02:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:24,991 INFO L481 AbstractCegarLoop]: Abstraction has 993 states and 1418 transitions. [2018-10-25 00:02:24,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:02:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1418 transitions. [2018-10-25 00:02:24,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-25 00:02:24,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:24,996 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:24,996 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:24,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:24,997 INFO L82 PathProgramCache]: Analyzing trace with hash -97847665, now seen corresponding path program 1 times [2018-10-25 00:02:24,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:24,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:24,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:24,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:24,999 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:25,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:25,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:02:25,223 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:25,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:02:25,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:02:25,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:02:25,224 INFO L87 Difference]: Start difference. First operand 993 states and 1418 transitions. Second operand 6 states. [2018-10-25 00:02:26,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:26,236 INFO L93 Difference]: Finished difference Result 2917 states and 4405 transitions. [2018-10-25 00:02:26,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:02:26,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-10-25 00:02:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:26,259 INFO L225 Difference]: With dead ends: 2917 [2018-10-25 00:02:26,259 INFO L226 Difference]: Without dead ends: 1930 [2018-10-25 00:02:26,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:02:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-10-25 00:02:26,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1875. [2018-10-25 00:02:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2018-10-25 00:02:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2525 transitions. [2018-10-25 00:02:26,350 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2525 transitions. Word has length 134 [2018-10-25 00:02:26,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:26,350 INFO L481 AbstractCegarLoop]: Abstraction has 1875 states and 2525 transitions. [2018-10-25 00:02:26,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:02:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2525 transitions. [2018-10-25 00:02:26,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-25 00:02:26,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:26,360 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:26,360 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:26,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:26,361 INFO L82 PathProgramCache]: Analyzing trace with hash -261653377, now seen corresponding path program 1 times [2018-10-25 00:02:26,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:26,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:26,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:26,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:26,362 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:26,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:26,637 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:26,638 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2018-10-25 00:02:26,640 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:26,707 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:26,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:27,404 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:27,406 INFO L272 AbstractInterpreter]: Visited 108 different actions 108 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-25 00:02:27,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:27,455 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:28,064 INFO L232 lantSequenceWeakener]: Weakened 136 states. On average, predicates are now at 80.27% of their original sizes. [2018-10-25 00:02:28,065 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:28,385 INFO L413 sIntCurrentIteration]: We have 141 unified AI predicates [2018-10-25 00:02:28,386 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:28,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:28,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-10-25 00:02:28,389 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:28,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:02:28,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:02:28,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:02:28,391 INFO L87 Difference]: Start difference. First operand 1875 states and 2525 transitions. Second operand 6 states. [2018-10-25 00:02:34,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:34,746 INFO L93 Difference]: Finished difference Result 3882 states and 5210 transitions. [2018-10-25 00:02:34,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 00:02:34,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-10-25 00:02:34,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:34,757 INFO L225 Difference]: With dead ends: 3882 [2018-10-25 00:02:34,757 INFO L226 Difference]: Without dead ends: 2013 [2018-10-25 00:02:34,763 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:02:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2018-10-25 00:02:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 2011. [2018-10-25 00:02:34,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2018-10-25 00:02:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2667 transitions. [2018-10-25 00:02:34,818 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2667 transitions. Word has length 142 [2018-10-25 00:02:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:34,818 INFO L481 AbstractCegarLoop]: Abstraction has 2011 states and 2667 transitions. [2018-10-25 00:02:34,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:02:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2667 transitions. [2018-10-25 00:02:34,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-25 00:02:34,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:34,825 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:02:34,826 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:34,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:34,826 INFO L82 PathProgramCache]: Analyzing trace with hash 276654452, now seen corresponding path program 1 times [2018-10-25 00:02:34,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:34,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:34,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:34,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:34,828 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:35,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:35,093 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:35,093 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 145 with the following transitions: [2018-10-25 00:02:35,093 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:35,100 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:35,101 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:35,467 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:35,467 INFO L272 AbstractInterpreter]: Visited 112 different actions 218 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:35,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:35,492 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:36,086 INFO L232 lantSequenceWeakener]: Weakened 141 states. On average, predicates are now at 80.39% of their original sizes. [2018-10-25 00:02:36,086 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:36,321 INFO L413 sIntCurrentIteration]: We have 143 unified AI predicates [2018-10-25 00:02:36,322 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:36,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:36,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:02:36,322 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:36,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:02:36,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:02:36,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:02:36,324 INFO L87 Difference]: Start difference. First operand 2011 states and 2667 transitions. Second operand 10 states. [2018-10-25 00:02:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:42,157 INFO L93 Difference]: Finished difference Result 4021 states and 5371 transitions. [2018-10-25 00:02:42,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:02:42,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 144 [2018-10-25 00:02:42,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:42,167 INFO L225 Difference]: With dead ends: 4021 [2018-10-25 00:02:42,167 INFO L226 Difference]: Without dead ends: 2152 [2018-10-25 00:02:42,173 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 151 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:02:42,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2018-10-25 00:02:42,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2149. [2018-10-25 00:02:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2149 states. [2018-10-25 00:02:42,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 2815 transitions. [2018-10-25 00:02:42,227 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 2815 transitions. Word has length 144 [2018-10-25 00:02:42,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:42,227 INFO L481 AbstractCegarLoop]: Abstraction has 2149 states and 2815 transitions. [2018-10-25 00:02:42,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:02:42,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2815 transitions. [2018-10-25 00:02:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-25 00:02:42,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:42,235 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:02:42,235 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:42,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:42,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1984849738, now seen corresponding path program 1 times [2018-10-25 00:02:42,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:42,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:42,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:42,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:42,237 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 32 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:42,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:42,463 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:42,463 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-10-25 00:02:42,464 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:42,468 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:42,468 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:43,072 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:43,073 INFO L272 AbstractInterpreter]: Visited 112 different actions 339 times. Merged at 7 different actions 25 times. Widened at 1 different actions 1 times. Found 3 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:43,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:43,108 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:44,469 INFO L232 lantSequenceWeakener]: Weakened 102 states. On average, predicates are now at 80.91% of their original sizes. [2018-10-25 00:02:44,469 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:48,425 INFO L413 sIntCurrentIteration]: We have 183 unified AI predicates [2018-10-25 00:02:48,425 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:48,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:48,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 21 [2018-10-25 00:02:48,426 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:48,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:02:48,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:02:48,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:02:48,428 INFO L87 Difference]: Start difference. First operand 2149 states and 2815 transitions. Second operand 15 states. [2018-10-25 00:03:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:00,707 INFO L93 Difference]: Finished difference Result 5196 states and 6895 transitions. [2018-10-25 00:03:00,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-25 00:03:00,708 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 184 [2018-10-25 00:03:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:00,724 INFO L225 Difference]: With dead ends: 5196 [2018-10-25 00:03:00,724 INFO L226 Difference]: Without dead ends: 3327 [2018-10-25 00:03:00,733 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 190 GetRequests, 18 SyntacticMatches, 152 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:03:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3327 states. [2018-10-25 00:03:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3327 to 3313. [2018-10-25 00:03:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3313 states. [2018-10-25 00:03:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 3313 states and 4207 transitions. [2018-10-25 00:03:00,824 INFO L78 Accepts]: Start accepts. Automaton has 3313 states and 4207 transitions. Word has length 184 [2018-10-25 00:03:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:00,824 INFO L481 AbstractCegarLoop]: Abstraction has 3313 states and 4207 transitions. [2018-10-25 00:03:00,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:03:00,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3313 states and 4207 transitions. [2018-10-25 00:03:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-25 00:03:00,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:00,835 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-25 00:03:00,835 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:00,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:00,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1644608177, now seen corresponding path program 1 times [2018-10-25 00:03:00,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:00,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:00,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:00,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:00,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:01,367 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-25 00:03:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-25 00:03:01,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:01,538 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:01,538 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-10-25 00:03:01,539 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:01,550 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:01,550 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:01,782 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:03:01,782 INFO L272 AbstractInterpreter]: Visited 113 different actions 220 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:03:01,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:01,787 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:03:02,587 INFO L232 lantSequenceWeakener]: Weakened 128 states. On average, predicates are now at 80.62% of their original sizes. [2018-10-25 00:03:02,587 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:03:05,539 INFO L413 sIntCurrentIteration]: We have 191 unified AI predicates [2018-10-25 00:03:05,539 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:03:05,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:03:05,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:03:05,540 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:05,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:03:05,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:03:05,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:03:05,541 INFO L87 Difference]: Start difference. First operand 3313 states and 4207 transitions. Second operand 15 states. [2018-10-25 00:03:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:18,203 INFO L93 Difference]: Finished difference Result 6712 states and 8529 transitions. [2018-10-25 00:03:18,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:03:18,203 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 192 [2018-10-25 00:03:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:18,223 INFO L225 Difference]: With dead ends: 6712 [2018-10-25 00:03:18,223 INFO L226 Difference]: Without dead ends: 4018 [2018-10-25 00:03:18,230 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 60 SyntacticMatches, 118 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:03:18,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4018 states. [2018-10-25 00:03:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4018 to 4010. [2018-10-25 00:03:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4010 states. [2018-10-25 00:03:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 4959 transitions. [2018-10-25 00:03:18,339 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 4959 transitions. Word has length 192 [2018-10-25 00:03:18,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:18,340 INFO L481 AbstractCegarLoop]: Abstraction has 4010 states and 4959 transitions. [2018-10-25 00:03:18,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:03:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 4959 transitions. [2018-10-25 00:03:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-25 00:03:18,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:18,352 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:18,352 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:18,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:18,353 INFO L82 PathProgramCache]: Analyzing trace with hash -199400556, now seen corresponding path program 1 times [2018-10-25 00:03:18,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:18,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:18,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:18,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:18,354 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 92 proven. 46 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-25 00:03:18,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:18,793 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:18,793 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-10-25 00:03:18,793 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:18,796 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:18,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:19,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:03:19,968 INFO L272 AbstractInterpreter]: Visited 115 different actions 465 times. Merged at 9 different actions 41 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:03:19,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:19,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:03:19,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:19,976 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:03:19,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:19,984 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:03:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:20,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:03:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-25 00:03:20,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:03:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 98 proven. 38 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-25 00:03:21,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:03:21,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-25 00:03:21,523 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:03:21,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:03:21,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:03:21,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:03:21,524 INFO L87 Difference]: Start difference. First operand 4010 states and 4959 transitions. Second operand 11 states. [2018-10-25 00:03:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:25,255 INFO L93 Difference]: Finished difference Result 8166 states and 10344 transitions. [2018-10-25 00:03:25,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:03:25,257 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 201 [2018-10-25 00:03:25,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:25,279 INFO L225 Difference]: With dead ends: 8166 [2018-10-25 00:03:25,279 INFO L226 Difference]: Without dead ends: 5001 [2018-10-25 00:03:25,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 403 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:03:25,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5001 states. [2018-10-25 00:03:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 4983. [2018-10-25 00:03:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4983 states. [2018-10-25 00:03:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 6078 transitions. [2018-10-25 00:03:25,439 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 6078 transitions. Word has length 201 [2018-10-25 00:03:25,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:25,439 INFO L481 AbstractCegarLoop]: Abstraction has 4983 states and 6078 transitions. [2018-10-25 00:03:25,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:03:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 6078 transitions. [2018-10-25 00:03:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-25 00:03:25,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:25,454 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:25,454 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:25,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:25,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1715987142, now seen corresponding path program 2 times [2018-10-25 00:03:25,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:25,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:25,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:25,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:25,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 92 proven. 48 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-25 00:03:25,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:25,918 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:25,918 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 00:03:25,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 00:03:25,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:25,918 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:03:25,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-25 00:03:25,929 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-25 00:03:26,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-25 00:03:26,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 00:03:26,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:03:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-25 00:03:26,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:03:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-25 00:03:26,328 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:03:26,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-25 00:03:26,328 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:26,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:03:26,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:03:26,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:03:26,330 INFO L87 Difference]: Start difference. First operand 4983 states and 6078 transitions. Second operand 3 states. [2018-10-25 00:03:27,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:27,245 INFO L93 Difference]: Finished difference Result 12259 states and 15351 transitions. [2018-10-25 00:03:27,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:03:27,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2018-10-25 00:03:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:27,282 INFO L225 Difference]: With dead ends: 12259 [2018-10-25 00:03:27,283 INFO L226 Difference]: Without dead ends: 7560 [2018-10-25 00:03:27,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 401 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:03:27,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7560 states. [2018-10-25 00:03:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7560 to 7478. [2018-10-25 00:03:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7478 states. [2018-10-25 00:03:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7478 states to 7478 states and 9104 transitions. [2018-10-25 00:03:27,495 INFO L78 Accepts]: Start accepts. Automaton has 7478 states and 9104 transitions. Word has length 201 [2018-10-25 00:03:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:27,495 INFO L481 AbstractCegarLoop]: Abstraction has 7478 states and 9104 transitions. [2018-10-25 00:03:27,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:03:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 7478 states and 9104 transitions. [2018-10-25 00:03:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-25 00:03:27,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:27,515 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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] [2018-10-25 00:03:27,515 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:27,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:27,516 INFO L82 PathProgramCache]: Analyzing trace with hash -332665990, now seen corresponding path program 1 times [2018-10-25 00:03:27,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:27,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:27,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-25 00:03:27,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:27,518 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:28,079 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 00:03:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-25 00:03:28,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:28,279 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:28,279 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-10-25 00:03:28,279 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:28,282 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:28,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:29,308 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:03:29,308 INFO L272 AbstractInterpreter]: Visited 114 different actions 334 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-25 00:03:29,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:29,346 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:03:30,747 INFO L232 lantSequenceWeakener]: Weakened 126 states. On average, predicates are now at 80.67% of their original sizes. [2018-10-25 00:03:30,747 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:03:34,503 INFO L413 sIntCurrentIteration]: We have 215 unified AI predicates [2018-10-25 00:03:34,503 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:03:34,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:03:34,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:03:34,504 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:34,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:03:34,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:03:34,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:03:34,505 INFO L87 Difference]: Start difference. First operand 7478 states and 9104 transitions. Second operand 15 states. [2018-10-25 00:03:46,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:46,802 INFO L93 Difference]: Finished difference Result 14525 states and 17804 transitions. [2018-10-25 00:03:46,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:03:46,802 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 216 [2018-10-25 00:03:46,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:46,841 INFO L225 Difference]: With dead ends: 14525 [2018-10-25 00:03:46,842 INFO L226 Difference]: Without dead ends: 8173 [2018-10-25 00:03:46,857 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 222 GetRequests, 46 SyntacticMatches, 156 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:03:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8173 states. [2018-10-25 00:03:47,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8173 to 8166. [2018-10-25 00:03:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8166 states. [2018-10-25 00:03:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8166 states to 8166 states and 9849 transitions. [2018-10-25 00:03:47,039 INFO L78 Accepts]: Start accepts. Automaton has 8166 states and 9849 transitions. Word has length 216 [2018-10-25 00:03:47,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:47,040 INFO L481 AbstractCegarLoop]: Abstraction has 8166 states and 9849 transitions. [2018-10-25 00:03:47,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:03:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 8166 states and 9849 transitions. [2018-10-25 00:03:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-25 00:03:47,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:47,061 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 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, 3, 3, 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] [2018-10-25 00:03:47,061 INFO L424 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:47,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1371913748, now seen corresponding path program 1 times [2018-10-25 00:03:47,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:47,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:47,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:47,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:47,063 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 175 proven. 53 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-25 00:03:47,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:47,968 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:47,968 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-10-25 00:03:47,969 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:47,971 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:47,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:48,936 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:03:48,937 INFO L272 AbstractInterpreter]: Visited 115 different actions 461 times. Merged at 9 different actions 37 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:03:48,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:48,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:03:48,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:48,944 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:03:48,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:48,956 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:03:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:49,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:03:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 166 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-25 00:03:49,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:03:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-25 00:03:49,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:03:49,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2018-10-25 00:03:49,538 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:03:49,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:03:49,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:03:49,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:03:49,539 INFO L87 Difference]: Start difference. First operand 8166 states and 9849 transitions. Second operand 11 states. [2018-10-25 00:03:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:53,630 INFO L93 Difference]: Finished difference Result 16021 states and 22185 transitions. [2018-10-25 00:03:53,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-25 00:03:53,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2018-10-25 00:03:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:53,631 INFO L225 Difference]: With dead ends: 16021 [2018-10-25 00:03:53,631 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:03:53,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 482 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=332, Invalid=1390, Unknown=0, NotChecked=0, Total=1722 [2018-10-25 00:03:53,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:03:53,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:03:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:03:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:03:53,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2018-10-25 00:03:53,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:53,692 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:03:53,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:03:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:03:53,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:03:53,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:03:54,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:54,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:55,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,317 WARN L179 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 430 DAG size of output: 286 [2018-10-25 00:03:56,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:56,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:57,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:57,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:57,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:57,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:57,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:57,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:57,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:57,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:57,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:57,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:57,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:57,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:57,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:57,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:57,306 WARN L179 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 265 [2018-10-25 00:03:58,416 WARN L179 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-10-25 00:04:00,318 WARN L179 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 147 DAG size of output: 86 [2018-10-25 00:04:03,618 WARN L179 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 332 DAG size of output: 164 [2018-10-25 00:04:05,607 WARN L179 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 309 DAG size of output: 109 [2018-10-25 00:04:07,200 WARN L179 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 290 DAG size of output: 109 [2018-10-25 00:04:07,203 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:04:07,203 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (<= ~a21~0 |old(~a21~0)|) (= |old(~a16~0)| ~a16~0)) [2018-10-25 00:04:07,203 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:04:07,204 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-25 00:04:07,204 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-25 00:04:07,204 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,204 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,204 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,204 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,204 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,204 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,205 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-25 00:04:07,205 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-25 00:04:07,205 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-25 00:04:07,205 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-25 00:04:07,205 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-25 00:04:07,205 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-25 00:04:07,205 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-25 00:04:07,205 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-25 00:04:07,205 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-25 00:04:07,206 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-25 00:04:07,206 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,206 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,206 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,206 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,206 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,207 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,207 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-25 00:04:07,207 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-25 00:04:07,207 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-25 00:04:07,207 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-25 00:04:07,207 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-25 00:04:07,207 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-25 00:04:07,207 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-25 00:04:07,208 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-25 00:04:07,208 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-25 00:04:07,208 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-25 00:04:07,208 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-25 00:04:07,208 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-25 00:04:07,208 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-25 00:04:07,208 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-25 00:04:07,208 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-25 00:04:07,208 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,209 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,209 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,209 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,209 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,209 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-25 00:04:07,209 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-25 00:04:07,209 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-25 00:04:07,209 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-25 00:04:07,210 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-25 00:04:07,210 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-25 00:04:07,210 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-25 00:04:07,210 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-25 00:04:07,210 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-25 00:04:07,210 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,210 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,210 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,210 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,210 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,211 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-25 00:04:07,211 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-25 00:04:07,211 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-25 00:04:07,211 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-25 00:04:07,211 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-25 00:04:07,211 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-25 00:04:07,211 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-25 00:04:07,211 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-25 00:04:07,212 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-25 00:04:07,212 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-25 00:04:07,212 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-25 00:04:07,212 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-25 00:04:07,212 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-25 00:04:07,212 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,212 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,212 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,212 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,213 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,213 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-25 00:04:07,213 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 479) no Hoare annotation was computed. [2018-10-25 00:04:07,213 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-25 00:04:07,213 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-25 00:04:07,213 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-25 00:04:07,213 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-25 00:04:07,213 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-25 00:04:07,213 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-25 00:04:07,214 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-25 00:04:07,214 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-25 00:04:07,214 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,214 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,214 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,214 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,214 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,214 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,214 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-25 00:04:07,214 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,215 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-25 00:04:07,215 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-25 00:04:07,215 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-25 00:04:07,215 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-25 00:04:07,215 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-25 00:04:07,215 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-25 00:04:07,215 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-25 00:04:07,215 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-25 00:04:07,215 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-25 00:04:07,215 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-25 00:04:07,216 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-25 00:04:07,216 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-25 00:04:07,216 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-25 00:04:07,216 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,216 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,216 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,216 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,216 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,216 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-25 00:04:07,216 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-25 00:04:07,217 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-25 00:04:07,217 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-25 00:04:07,217 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-25 00:04:07,217 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-25 00:04:07,217 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-25 00:04:07,217 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-25 00:04:07,217 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,217 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,217 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,218 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,218 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,218 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-25 00:04:07,218 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-25 00:04:07,218 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-25 00:04:07,218 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-25 00:04:07,218 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-25 00:04:07,218 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-25 00:04:07,219 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-25 00:04:07,219 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-25 00:04:07,219 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-25 00:04:07,219 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-25 00:04:07,220 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse1 (= 13 |old(~a8~0)|)) (.cse15 (= 4 |old(~a16~0)|)) (.cse18 (not (= 0 |old(~a7~0)|))) (.cse19 (not (= 1 |old(~a21~0)|))) (.cse20 (not (= 15 |old(~a8~0)|))) (.cse21 (= |calculate_output_#in~input| 0)) (.cse26 (= ~a16~0 |old(~a16~0)|)) (.cse23 (= ~a7~0 |old(~a7~0)|)) (.cse24 (= |old(~a8~0)| ~a8~0)) (.cse22 (= |old(~a20~0)| ~a20~0)) (.cse25 (<= ~a21~0 |old(~a21~0)|)) (.cse29 (= |old(~a16~0)| ~a16~0)) (.cse4 (<= ~a17~0 0))) (let ((.cse7 (and .cse23 .cse24 .cse22 .cse25 .cse29 .cse4)) (.cse16 (= ~a17~0 1)) (.cse13 (and .cse22 .cse4 .cse23 .cse24 .cse25 .cse26)) (.cse10 (and (= ~a7~0 0) (not (= ~a16~0 0)) (= ~a8~0 15) (= ~a21~0 1) (not .cse21))) (.cse9 (or .cse18 .cse19 .cse20 (= 0 |old(~a16~0)|) .cse21)) (.cse14 (not .cse15)) (.cse27 (= 1 ~a20~0)) (.cse28 (= 13 ~a8~0)) (.cse30 (= 1 ~a21~0)) (.cse31 (= 1 ~a17~0)) (.cse32 (not .cse1)) (.cse17 (not (= 1 |old(~a17~0)|))) (.cse0 (= 1 |old(~a7~0)|)) (.cse6 (not (= 1 |old(~a20~0)|))) (.cse3 (< 0 |old(~a17~0)|)) (.cse12 (= 6 |old(~a16~0)|)) (.cse2 (not (= 8 ~a12~0))) (.cse8 (< 0 |old(~a21~0)|)) (.cse5 (< 0 |old(~a20~0)|)) (.cse11 (and .cse23 .cse24 .cse22 .cse25 .cse29))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse2 .cse3 .cse8) (or .cse9 .cse2 .cse10 .cse5) (or .cse0 .cse11 .cse1 .cse2 .cse5) (or .cse12 .cse1 .cse7 .cse2 .cse3 .cse5) (or .cse0 .cse13 .cse6 .cse14 .cse2 .cse3) (or .cse12 .cse6 .cse2 .cse11 .cse8) (or .cse15 .cse6 .cse10 .cse9 .cse2) (or .cse16 (or (not (= 0 |old(~a20~0)|)) .cse17) (or .cse18 .cse19 .cse20 (not (= 5 |old(~a16~0)|)) .cse2 .cse21)) (or .cse0 .cse6 (and .cse22 .cse23 .cse24 .cse25 .cse26) .cse1 .cse2) (or (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) .cse21 (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) .cse16 (not (= |old(~a16~0)| 5)) (not (= |old(~a20~0)| 1)) (not (= |old(~a17~0)| 1))) (or .cse0 .cse4 .cse14 .cse2 .cse3 .cse5) (or .cse12 .cse15 .cse6 .cse1 .cse13 .cse2 .cse3) (or .cse19 .cse6 .cse14 (and (= 1 ~a7~0) .cse27 .cse28 .cse29 .cse30 .cse31) .cse2 (not .cse0) .cse32 .cse17) (or .cse6 .cse10 .cse9 .cse2 .cse3) (or .cse0 .cse14 .cse2 .cse11 .cse5) (or .cse11 .cse0 .cse15 .cse6 .cse2) (or .cse19 .cse0 .cse6 .cse14 .cse2 (and (not (= ~a7~0 1)) .cse27 .cse28 .cse29 .cse30 .cse31) .cse32 .cse17) (or .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (or .cse12 .cse2 .cse8 .cse5 .cse11)))) [2018-10-25 00:04:07,220 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-25 00:04:07,220 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,220 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,220 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,220 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,220 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-25 00:04:07,220 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,220 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,221 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-25 00:04:07,221 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-25 00:04:07,221 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-25 00:04:07,221 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-25 00:04:07,221 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-25 00:04:07,221 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-25 00:04:07,221 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-25 00:04:07,221 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-25 00:04:07,221 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-25 00:04:07,221 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-25 00:04:07,222 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-25 00:04:07,222 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-25 00:04:07,222 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,222 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,222 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,222 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,222 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,222 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-25 00:04:07,222 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,222 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-25 00:04:07,222 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-25 00:04:07,223 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-25 00:04:07,223 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-25 00:04:07,223 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-25 00:04:07,223 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-25 00:04:07,223 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-25 00:04:07,223 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-25 00:04:07,223 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-25 00:04:07,223 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-25 00:04:07,223 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-25 00:04:07,224 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-25 00:04:07,224 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-25 00:04:07,224 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-25 00:04:07,224 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,224 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,224 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,224 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,224 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,224 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:07,224 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-25 00:04:07,225 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-25 00:04:07,225 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-25 00:04:07,225 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-25 00:04:07,225 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-25 00:04:07,225 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-25 00:04:07,225 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-25 00:04:07,225 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-25 00:04:07,225 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-25 00:04:07,225 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-25 00:04:07,226 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:04:07,226 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-25 00:04:07,226 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:04:07,226 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:04:07,226 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (and (= ~a21~0 1) (= ~a8~0 15) (= ~a16~0 |old(~a16~0)|) (= ~a17~0 1) (= ~a7~0 0) (= ~a20~0 1)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:04:07,226 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:04:07,227 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse2 (<= ~a20~0 0)) (.cse0 (not (= ~a7~0 1))) (.cse5 (<= ~a21~0 0)) (.cse8 (= |old(~a20~0)| ~a20~0)) (.cse3 (= 1 ~a20~0)) (.cse6 (not (= ~a16~0 6))) (.cse4 (not (= ~a8~0 13))) (.cse9 (not .cse1)) (.cse7 (<= ~a17~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) (= 1 ~a17~0)) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse4 .cse2) (not (= 4 ~d~0)) (and .cse5 .cse6 .cse2) (and .cse0 .cse3 .cse4) (not (= 2 ~b~0)) (not (= ~y~0 25)) (and .cse0 .cse3 .cse7) (and .cse6 .cse7 .cse4 .cse2) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse5 .cse3 .cse6) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse8 .cse9) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse5 .cse8 .cse7) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)) (and (and .cse3 .cse6 .cse4 .cse9) .cse7)))) [2018-10-25 00:04:07,227 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-25 00:04:07,227 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-25 00:04:07,227 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-25 00:04:07,227 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse2 (<= ~a20~0 0)) (.cse0 (not (= ~a7~0 1))) (.cse5 (<= ~a21~0 0)) (.cse8 (= |old(~a20~0)| ~a20~0)) (.cse3 (= 1 ~a20~0)) (.cse6 (not (= ~a16~0 6))) (.cse4 (not (= ~a8~0 13))) (.cse9 (not .cse1)) (.cse7 (<= ~a17~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) (= 1 ~a17~0)) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse4 .cse2) (not (= 4 ~d~0)) (and .cse5 .cse6 .cse2) (and .cse0 .cse3 .cse4) (not (= 2 ~b~0)) (not (= ~y~0 25)) (and .cse0 .cse3 .cse7) (and .cse6 .cse7 .cse4 .cse2) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse5 .cse3 .cse6) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse8 .cse9) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse5 .cse8 .cse7) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)) (and (and .cse3 .cse6 .cse4 .cse9) .cse7)))) [2018-10-25 00:04:07,227 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:04:07,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:04:07 BoogieIcfgContainer [2018-10-25 00:04:07,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:04:07,245 INFO L168 Benchmark]: Toolchain (without parser) took 118445.39 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.2 GB in the end (delta: 181.6 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-10-25 00:04:07,246 INFO L168 Benchmark]: CDTParser took 0.24 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:04:07,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.66 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:07,247 INFO L168 Benchmark]: Boogie Procedure Inliner took 203.79 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.8 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:07,248 INFO L168 Benchmark]: Boogie Preprocessor took 98.93 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:04:07,249 INFO L168 Benchmark]: RCFGBuilder took 3165.88 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 120.6 MB). Peak memory consumption was 120.6 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:07,249 INFO L168 Benchmark]: TraceAbstraction took 114166.66 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 1.2 GB in the end (delta: 805.5 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-10-25 00:04:07,254 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.24 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 804.66 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 203.79 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.8 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 98.93 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3165.88 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 120.6 MB). Peak memory consumption was 120.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114166.66 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 1.2 GB in the end (delta: 805.5 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: 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: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(a7 == 1) && a16 == 4) && a20 <= 0) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || !(3 == c)) || !(1 == \old(a21))) || ((!(a7 == 1) && !(a8 == 13)) && a20 <= 0)) || !(4 == d)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || ((!(a7 == 1) && 1 == a20) && !(a8 == 13))) || !(2 == b)) || !(y == 25)) || ((!(a7 == 1) && 1 == a20) && a17 <= 0)) || (((!(a16 == 6) && a17 <= 0) && !(a8 == 13)) && a20 <= 0)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || ((a21 <= 0 && 1 == a20) && !(a16 == 6))) || !(21 == u)) || !(22 == v)) || ((!(a7 == 1) && \old(a20) == a20) && !(a16 == 4))) || !(z == 26)) || !(\old(a16) == 5)) || ((a21 <= 0 && \old(a20) == a20) && a17 <= 0)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || !(\old(a17) == 1)) || !(6 == f)) || ((((1 == a20 && !(a16 == 6)) && !(a8 == 13)) && !(a16 == 4)) && a17 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 114.0s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 68.4s AutomataDifference, 0.0s DeadEndRemovalTime, 13.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1891 SDtfs, 11530 SDslu, 2020 SDs, 0 SdLazy, 16775 SolverSat, 1874 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.1s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2305 GetRequests, 1695 SyntacticMatches, 443 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4200 ImplicationChecksByTransitivity, 16.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8166occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.3s AbstIntTime, 7 AbstIntIterations, 5 AbstIntStrong, 0.9973944092537202 AbsIntWeakeningRatio, 0.21420389461626574 AbsIntAvgWeakeningVarsNumRemoved, 5.466208476517755 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 204 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 438 PreInvPairs, 896 NumberOfFragments, 1380 HoareAnnotationTreeSize, 438 FomulaSimplifications, 31048 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 28175 FormulaSimplificationTreeSizeReductionInter, 9.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 2874 NumberOfCodeBlocks, 2807 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3488 ConstructedInterpolants, 0 QuantifiedInterpolants, 1993410 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1580 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 1991/2329 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...