java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:08:22,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:08:22,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:08:23,005 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:08:23,005 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:08:23,006 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:08:23,007 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:08:23,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:08:23,011 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:08:23,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:08:23,012 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:08:23,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:08:23,013 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:08:23,015 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:08:23,018 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:08:23,019 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:08:23,020 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:08:23,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:08:23,033 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:08:23,040 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:08:23,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:08:23,043 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:08:23,047 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:08:23,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:08:23,048 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:08:23,048 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:08:23,049 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:08:23,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:08:23,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:08:23,054 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:08:23,054 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:08:23,055 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:08:23,055 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:08:23,055 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:08:23,056 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:08:23,057 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:08:23,057 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:08:23,087 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:08:23,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:08:23,089 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:08:23,089 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:08:23,089 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:08:23,089 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:08:23,090 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:08:23,090 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:08:23,090 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:08:23,090 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:08:23,090 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:08:23,090 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:08:23,091 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:08:23,091 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:08:23,092 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:08:23,092 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:08:23,092 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:08:23,092 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:08:23,093 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:08:23,094 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:08:23,094 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:08:23,095 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:08:23,095 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:08:23,095 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:08:23,095 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:08:23,095 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:08:23,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:08:23,096 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:08:23,096 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:08:23,097 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:08:23,097 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:08:23,097 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:08:23,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:08:23,097 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:08:23,097 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:08:23,098 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:08:23,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:08:23,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:08:23,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:08:23,191 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:08:23,191 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:08:23,192 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2018-10-25 00:08:23,250 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0ec1afaaf/c274caa4d9374db4b91e4212a4718716/FLAGea3a112b5 [2018-10-25 00:08:23,812 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:08:23,815 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2018-10-25 00:08:23,838 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0ec1afaaf/c274caa4d9374db4b91e4212a4718716/FLAGea3a112b5 [2018-10-25 00:08:23,858 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0ec1afaaf/c274caa4d9374db4b91e4212a4718716 [2018-10-25 00:08:23,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:08:23,870 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:08:23,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:08:23,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:08:23,874 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:08:23,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:08:23" (1/1) ... [2018-10-25 00:08:23,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f637f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:23, skipping insertion in model container [2018-10-25 00:08:23,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:08:23" (1/1) ... [2018-10-25 00:08:23,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:08:23,944 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:08:24,435 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:08:24,442 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:08:24,571 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:08:24,590 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:08:24,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:24 WrapperNode [2018-10-25 00:08:24,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:08:24,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:08:24,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:08:24,592 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:08:24,602 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:08:24" (1/1) ... [2018-10-25 00:08:24,626 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:08:24" (1/1) ... [2018-10-25 00:08:24,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:08:24,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:08:24,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:08:24,813 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:08:24,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:24" (1/1) ... [2018-10-25 00:08:24,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:24" (1/1) ... [2018-10-25 00:08:24,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:24" (1/1) ... [2018-10-25 00:08:24,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:24" (1/1) ... [2018-10-25 00:08:24,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:24" (1/1) ... [2018-10-25 00:08:24,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:24" (1/1) ... [2018-10-25 00:08:24,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:24" (1/1) ... [2018-10-25 00:08:24,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:08:24,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:08:24,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:08:24,926 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:08:24,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:24" (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:08:24,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:08:24,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:08:24,982 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:08:24,982 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:08:24,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:08:24,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:08:24,983 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:08:24,983 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:08:28,092 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:08:28,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:08:28 BoogieIcfgContainer [2018-10-25 00:08:28,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:08:28,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:08:28,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:08:28,098 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:08:28,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:08:23" (1/3) ... [2018-10-25 00:08:28,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b154cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:08:28, skipping insertion in model container [2018-10-25 00:08:28,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:24" (2/3) ... [2018-10-25 00:08:28,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b154cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:08:28, skipping insertion in model container [2018-10-25 00:08:28,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:08:28" (3/3) ... [2018-10-25 00:08:28,102 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label51_true-unreach-call_false-termination.c [2018-10-25 00:08:28,111 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:08:28,121 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:08:28,139 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:08:28,179 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:08:28,179 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:08:28,179 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:08:28,179 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:08:28,179 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:08:28,180 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:08:28,180 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:08:28,180 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:08:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:08:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-25 00:08:28,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:28,224 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:28,228 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:28,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1195562327, now seen corresponding path program 1 times [2018-10-25 00:08:28,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:28,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:28,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:28,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:28,283 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:28,888 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:08:28,996 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:08:28,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:28,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:08:29,000 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:29,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:08:29,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:08:29,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:08:29,025 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:08:30,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:30,681 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-25 00:08:30,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:08:30,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-10-25 00:08:30,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:30,706 INFO L225 Difference]: With dead ends: 621 [2018-10-25 00:08:30,706 INFO L226 Difference]: Without dead ends: 382 [2018-10-25 00:08:30,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:08:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-25 00:08:30,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-25 00:08:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-25 00:08:30,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-25 00:08:30,831 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 117 [2018-10-25 00:08:30,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:30,833 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-25 00:08:30,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:08:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-25 00:08:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-25 00:08:30,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:30,847 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:30,847 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:30,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:30,848 INFO L82 PathProgramCache]: Analyzing trace with hash -324277142, now seen corresponding path program 1 times [2018-10-25 00:08:30,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:30,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:30,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:30,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:30,850 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:31,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:31,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:31,370 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:31,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:31,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:31,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:31,373 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-25 00:08:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:33,093 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-25 00:08:33,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:33,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-10-25 00:08:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:33,100 INFO L225 Difference]: With dead ends: 903 [2018-10-25 00:08:33,100 INFO L226 Difference]: Without dead ends: 381 [2018-10-25 00:08:33,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 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:08:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-25 00:08:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-25 00:08:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-25 00:08:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-25 00:08:33,133 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 126 [2018-10-25 00:08:33,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:33,134 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-25 00:08:33,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-25 00:08:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-25 00:08:33,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:33,137 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:33,138 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:33,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:33,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1188045302, now seen corresponding path program 1 times [2018-10-25 00:08:33,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:33,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:33,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:33,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:33,140 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:33,493 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-10-25 00:08:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:33,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:33,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:33,632 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:33,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:33,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:33,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:33,634 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-25 00:08:35,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:35,389 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-25 00:08:35,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:35,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-10-25 00:08:35,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:35,394 INFO L225 Difference]: With dead ends: 901 [2018-10-25 00:08:35,394 INFO L226 Difference]: Without dead ends: 380 [2018-10-25 00:08:35,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-25 00:08:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-25 00:08:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-25 00:08:35,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-25 00:08:35,439 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 132 [2018-10-25 00:08:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:35,439 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-25 00:08:35,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:35,440 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-25 00:08:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-25 00:08:35,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:35,442 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:35,443 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:35,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:35,443 INFO L82 PathProgramCache]: Analyzing trace with hash -34077619, now seen corresponding path program 1 times [2018-10-25 00:08:35,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:35,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:35,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:35,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:35,445 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:35,651 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:08:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:35,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:35,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:08:35,704 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:35,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:08:35,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:08:35,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:08:35,705 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-25 00:08:38,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:38,313 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-25 00:08:38,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:08:38,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-10-25 00:08:38,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:38,318 INFO L225 Difference]: With dead ends: 1193 [2018-10-25 00:08:38,319 INFO L226 Difference]: Without dead ends: 819 [2018-10-25 00:08:38,321 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:08:38,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-25 00:08:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-25 00:08:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-25 00:08:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-25 00:08:38,354 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 140 [2018-10-25 00:08:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:38,355 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-25 00:08:38,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:08:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-25 00:08:38,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-25 00:08:38,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:38,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:38,359 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:38,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:38,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1593443119, now seen corresponding path program 1 times [2018-10-25 00:08:38,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:38,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:38,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:38,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:38,361 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:38,787 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-25 00:08:39,029 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-25 00:08:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:39,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:39,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:39,098 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:39,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:39,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:39,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:39,100 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-25 00:08:40,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:40,364 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-25 00:08:40,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:40,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-10-25 00:08:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:40,377 INFO L225 Difference]: With dead ends: 1753 [2018-10-25 00:08:40,377 INFO L226 Difference]: Without dead ends: 804 [2018-10-25 00:08:40,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 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:08:40,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-25 00:08:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-25 00:08:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-25 00:08:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-25 00:08:40,418 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 142 [2018-10-25 00:08:40,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:40,418 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-25 00:08:40,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-25 00:08:40,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-25 00:08:40,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:40,422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:40,422 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:40,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:40,423 INFO L82 PathProgramCache]: Analyzing trace with hash 890086741, now seen corresponding path program 1 times [2018-10-25 00:08:40,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:40,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:40,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:40,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:40,425 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:40,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:40,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:40,783 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:40,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:40,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:40,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:40,784 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-25 00:08:41,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:41,751 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-25 00:08:41,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:41,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2018-10-25 00:08:41,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:41,757 INFO L225 Difference]: With dead ends: 1747 [2018-10-25 00:08:41,757 INFO L226 Difference]: Without dead ends: 801 [2018-10-25 00:08:41,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-25 00:08:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-25 00:08:41,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-25 00:08:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-25 00:08:41,788 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 144 [2018-10-25 00:08:41,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:41,788 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-25 00:08:41,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-25 00:08:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-25 00:08:41,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:41,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:41,794 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:41,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:41,794 INFO L82 PathProgramCache]: Analyzing trace with hash 207226461, now seen corresponding path program 1 times [2018-10-25 00:08:41,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:41,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:41,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:41,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:41,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:42,013 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:08:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:42,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:42,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:08:42,064 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:42,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:08:42,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:08:42,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:08:42,066 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-25 00:08:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:45,969 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-25 00:08:45,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:08:45,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-10-25 00:08:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:45,979 INFO L225 Difference]: With dead ends: 2381 [2018-10-25 00:08:45,979 INFO L226 Difference]: Without dead ends: 1586 [2018-10-25 00:08:45,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:08:45,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-25 00:08:46,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-25 00:08:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-25 00:08:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-25 00:08:46,030 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 148 [2018-10-25 00:08:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:46,031 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-25 00:08:46,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:08:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-25 00:08:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-25 00:08:46,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:46,037 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, 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] [2018-10-25 00:08:46,038 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:46,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:46,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1224274575, now seen corresponding path program 1 times [2018-10-25 00:08:46,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:46,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:46,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:46,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:46,039 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:46,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:46,187 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:46,188 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-10-25 00:08:46,190 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [607], [609], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:46,247 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:46,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:47,253 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:08:47,255 INFO L272 AbstractInterpreter]: Visited 121 different actions 236 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-25 00:08:47,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:47,300 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:08:48,465 INFO L232 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 80.9% of their original sizes. [2018-10-25 00:08:48,466 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:08:50,551 INFO L413 sIntCurrentIteration]: We have 182 unified AI predicates [2018-10-25 00:08:50,552 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:08:50,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:08:50,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:08:50,553 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:50,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:08:50,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:08:50,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:08:50,555 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 10 states. [2018-10-25 00:09:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:02,486 INFO L93 Difference]: Finished difference Result 3925 states and 5567 transitions. [2018-10-25 00:09:02,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 00:09:02,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 183 [2018-10-25 00:09:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:02,498 INFO L225 Difference]: With dead ends: 3925 [2018-10-25 00:09:02,498 INFO L226 Difference]: Without dead ends: 2373 [2018-10-25 00:09:02,505 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 52 SyntacticMatches, 122 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:09:02,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2018-10-25 00:09:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2302. [2018-10-25 00:09:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2302 states. [2018-10-25 00:09:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3078 transitions. [2018-10-25 00:09:02,565 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3078 transitions. Word has length 183 [2018-10-25 00:09:02,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:02,566 INFO L481 AbstractCegarLoop]: Abstraction has 2302 states and 3078 transitions. [2018-10-25 00:09:02,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:09:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3078 transitions. [2018-10-25 00:09:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-25 00:09:02,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:02,574 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:09:02,574 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:02,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:02,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1298981372, now seen corresponding path program 1 times [2018-10-25 00:09:02,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:02,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:02,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:02,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:02,577 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:02,801 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:09:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:09:02,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:02,878 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:09:02,878 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-10-25 00:09:02,879 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [119], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [607], [609], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:09:02,885 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:09:02,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:09:03,331 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:09:03,331 INFO L272 AbstractInterpreter]: Visited 123 different actions 366 times. Merged at 8 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:09:03,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:03,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:09:03,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:03,339 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:09:03,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:03,351 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:09:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:03,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:09:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:09:04,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:09:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:09:05,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:09:05,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-10-25 00:09:05,143 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:09:05,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 00:09:05,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 00:09:05,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:09:05,145 INFO L87 Difference]: Start difference. First operand 2302 states and 3078 transitions. Second operand 14 states. [2018-10-25 00:09:10,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:10,153 INFO L93 Difference]: Finished difference Result 7742 states and 10793 transitions. [2018-10-25 00:09:10,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:09:10,157 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 188 [2018-10-25 00:09:10,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:10,158 INFO L225 Difference]: With dead ends: 7742 [2018-10-25 00:09:10,158 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:09:10,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 388 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-10-25 00:09:10,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:09:10,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:09:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:09:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:09:10,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-10-25 00:09:10,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:10,181 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:09:10,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-25 00:09:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:09:10,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:09:10,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:09:10,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:10,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:10,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:10,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:10,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:10,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:10,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:10,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:10,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:10,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:10,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:10,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:10,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:10,845 WARN L179 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2018-10-25 00:09:11,488 WARN L179 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2018-10-25 00:09:12,570 WARN L179 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 171 DAG size of output: 76 [2018-10-25 00:09:12,823 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 47 [2018-10-25 00:09:13,142 WARN L179 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 47 [2018-10-25 00:09:13,145 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:09:13,146 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a28~0 |old(~a28~0)|)) [2018-10-25 00:09:13,146 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:09:13,146 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,147 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,147 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,147 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,147 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,147 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:09:13,147 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:09:13,148 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:09:13,148 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:09:13,148 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:09:13,148 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:09:13,148 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:09:13,148 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:09:13,148 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:09:13,148 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:09:13,149 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:09:13,149 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:09:13,149 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:09:13,149 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,149 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,149 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,149 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,149 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:09:13,149 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,150 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:09:13,150 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:09:13,150 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:09:13,150 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:09:13,150 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:09:13,150 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:09:13,150 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:09:13,150 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:09:13,150 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:09:13,150 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:09:13,150 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:09:13,151 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:09:13,151 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:09:13,151 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:09:13,151 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:09:13,151 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,151 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,151 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,151 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,151 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,152 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:09:13,152 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:09:13,152 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:09:13,152 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:09:13,152 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:09:13,152 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:09:13,152 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:09:13,152 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:09:13,152 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:09:13,153 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:09:13,153 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:09:13,153 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,153 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,153 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,153 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,153 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,153 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:09:13,153 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:09:13,154 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:09:13,154 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:09:13,154 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 502) no Hoare annotation was computed. [2018-10-25 00:09:13,154 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:09:13,154 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:09:13,154 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:09:13,154 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:09:13,154 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:09:13,154 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:09:13,155 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:09:13,155 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:09:13,155 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:09:13,155 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,155 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,155 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,155 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,155 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,155 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:09:13,155 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:09:13,156 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:09:13,156 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:09:13,156 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:09:13,156 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:09:13,156 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:09:13,156 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:09:13,156 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:09:13,156 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:09:13,156 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:09:13,156 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:09:13,156 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:09:13,156 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:09:13,157 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:09:13,157 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:09:13,157 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,157 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,157 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,157 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,157 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:09:13,157 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,158 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:09:13,158 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,158 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:09:13,158 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:09:13,158 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:09:13,158 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,158 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,158 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:09:13,159 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:09:13,159 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:09:13,159 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:09:13,159 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:09:13,159 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:09:13,159 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:09:13,159 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:09:13,159 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:09:13,159 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:09:13,159 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:09:13,159 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,160 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,160 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,160 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,160 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,160 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,160 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:09:13,160 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:09:13,160 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:09:13,160 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:09:13,160 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:09:13,160 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:09:13,160 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:09:13,160 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:09:13,160 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:09:13,161 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:09:13,161 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:09:13,161 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,161 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,161 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,161 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,161 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,161 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,161 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:09:13,161 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:09:13,161 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:09:13,161 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:09:13,162 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:09:13,162 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:09:13,162 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:09:13,162 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:09:13,162 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:09:13,162 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:09:13,162 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:09:13,162 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:09:13,162 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:09:13,162 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:09:13,162 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,162 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,162 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,163 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse18 (= |old(~a17~0)| ~a17~0)) (.cse19 (= |old(~a25~0)| ~a25~0)) (.cse20 (= ~a28~0 |old(~a28~0)|)) (.cse6 (= 1 |old(~a11~0)|)) (.cse14 (= 1 |old(~a19~0)|)) (.cse15 (= 1 |old(~a25~0)|)) (.cse11 (= 1 ~a11~0)) (.cse12 (= 1 ~a19~0))) (let ((.cse0 (and .cse11 .cse12)) (.cse2 (not .cse15)) (.cse3 (not .cse14)) (.cse10 (not (= 7 |old(~a28~0)|))) (.cse4 (not (= 8 |old(~a17~0)|))) (.cse5 (not .cse6)) (.cse13 (= 9 |old(~a28~0)|)) (.cse8 (not (= ~a11~0 1))) (.cse17 (not (= |old(~a17~0)| 8))) (.cse16 (and .cse18 .cse19 .cse20)) (.cse1 (not (= 1 ~a21~0))) (.cse7 (= 8 |old(~a28~0)|)) (.cse9 (< 7 |old(~a17~0)|))) (and (or .cse0 .cse1 (not (= 10 |old(~a28~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse10 .cse2 .cse3 .cse5 .cse0 (not (= 7 |old(~a17~0)|))) (or .cse1 .cse2 .cse3 .cse4 (and .cse11 (= 1 ~a25~0) (= 9 ~a28~0) (= 8 ~a17~0) .cse12) (not .cse13) .cse5) (or (and (= ~a11~0 0) (= ~a19~0 1)) (or .cse1 .cse3 (= 0 |old(~a28~0)|) (not (= 0 |old(~a11~0)|)) .cse4 (= |calculate_output_#in~input| 0))) (or .cse14 .cse1 .cse10 .cse4 (and .cse11 (not .cse12)) .cse5 .cse15) (or .cse1 .cse7 .cse16 .cse13 .cse17) (or .cse1 .cse6 (and .cse18 .cse19 .cse20 .cse8) .cse17) (or .cse1 .cse7 .cse16 .cse17 .cse15) (or .cse16 .cse1 .cse7 .cse9)))) [2018-10-25 00:09:13,163 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,163 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,163 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,163 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:09:13,163 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:09:13,164 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:09:13,164 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:09:13,164 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:09:13,164 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:09:13,164 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:09:13,164 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:09:13,164 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:09:13,164 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:09:13,164 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:09:13,164 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:09:13,164 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:09:13,164 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,164 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,165 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,165 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,165 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,165 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,165 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:09:13,165 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:09:13,165 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:09:13,165 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:09:13,165 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:09:13,165 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:09:13,165 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:09:13,165 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:09:13,165 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:09:13,165 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:09:13,166 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:09:13,166 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:09:13,166 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:09:13,166 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:09:13,166 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:09:13,166 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:09:13,166 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,166 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,166 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,166 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,166 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:13,166 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:09:13,166 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:09:13,166 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:09:13,167 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:09:13,167 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:09:13,167 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:09:13,167 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:09:13,167 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:09:13,167 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:09:13,167 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:09:13,167 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:09:13,167 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:09:13,167 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:09:13,167 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:09:13,167 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:09:13,167 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:09:13,167 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:09:13,168 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:09:13,168 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:09:13,168 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:09:13,168 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-10-25 00:09:13,168 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:09:13,168 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:09:13,168 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 1 |old(~a19~0)|)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-10-25 00:09:13,168 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:09:13,168 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse1 (= |old(~a17~0)| ~a17~0)) (.cse0 (not (= ~a28~0 8)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (not (= 0 |old(~a11~0)|)) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse1 (not (= ~a11~0 1))) (and .cse1 .cse0 (not (= ~a28~0 9))) (not (= 1 |old(~a19~0)|)) (and (not (= ~a25~0 1)) .cse1 .cse0) (not (= 8 |old(~a17~0)|)))) [2018-10-25 00:09:13,168 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:09:13,169 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:09:13,169 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse1 (= |old(~a17~0)| ~a17~0)) (.cse0 (not (= ~a28~0 8)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (not (= 0 |old(~a11~0)|)) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse1 (not (= ~a11~0 1))) (and .cse1 .cse0 (not (= ~a28~0 9))) (not (= 1 |old(~a19~0)|)) (and (not (= ~a25~0 1)) .cse1 .cse0) (not (= 8 |old(~a17~0)|)))) [2018-10-25 00:09:13,169 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:09:13,169 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:09:13,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:09:13 BoogieIcfgContainer [2018-10-25 00:09:13,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:09:13,182 INFO L168 Benchmark]: Toolchain (without parser) took 49312.68 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -322.7 MB). Peak memory consumption was 892.6 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:13,183 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:09:13,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 720.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:13,184 INFO L168 Benchmark]: Boogie Procedure Inliner took 220.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:13,185 INFO L168 Benchmark]: Boogie Preprocessor took 112.29 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:09:13,186 INFO L168 Benchmark]: RCFGBuilder took 3167.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.0 MB). Peak memory consumption was 108.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:13,187 INFO L168 Benchmark]: TraceAbstraction took 45087.06 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 487.6 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 339.9 MB). Peak memory consumption was 827.5 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:13,192 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.20 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 720.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 220.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.29 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3167.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.0 MB). Peak memory consumption was 108.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45087.06 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 487.6 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 339.9 MB). Peak memory consumption was 827.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 502]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((!(1 == a21) || !(7 == \old(a28))) || (a17 <= 7 && !(a28 == 8))) || !(0 == \old(a11))) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || (\old(a17) == a17 && !(a11 == 1))) || ((\old(a17) == a17 && !(a28 == 8)) && !(a28 == 9))) || !(1 == \old(a19))) || ((!(a25 == 1) && \old(a17) == a17) && !(a28 == 8))) || !(8 == \old(a17)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 45.0s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 30.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1144 SDtfs, 7921 SDslu, 1434 SDs, 0 SdLazy, 9862 SolverSat, 1963 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 669 GetRequests, 462 SyntacticMatches, 130 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2302occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.997552437468404 AbsIntWeakeningRatio, 0.1813186813186813 AbsIntAvgWeakeningVarsNumRemoved, 0.13736263736263737 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 111 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 83 PreInvPairs, 157 NumberOfFragments, 506 HoareAnnotationTreeSize, 83 FomulaSimplifications, 3007 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3459 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1508 NumberOfCodeBlocks, 1508 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1685 ConstructedInterpolants, 0 QuantifiedInterpolants, 1345778 SizeOfPredicates, 0 NumberOfNonLiveVariables, 497 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 508/542 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...