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/Problem10_label25_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:24:12,071 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:24:12,073 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:24:12,085 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:24:12,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:24:12,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:24:12,088 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:24:12,090 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:24:12,092 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:24:12,092 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:24:12,093 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:24:12,094 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:24:12,095 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:24:12,096 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:24:12,097 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:24:12,100 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:24:12,101 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:24:12,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:24:12,112 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:24:12,116 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:24:12,117 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:24:12,119 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:24:12,124 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:24:12,124 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:24:12,124 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:24:12,127 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:24:12,129 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:24:12,130 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:24:12,133 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:24:12,136 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:24:12,136 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:24:12,137 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:24:12,137 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:24:12,138 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:24:12,138 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:24:12,141 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:24:12,141 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 01:24:12,168 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:24:12,168 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:24:12,169 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:24:12,169 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:24:12,169 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:24:12,170 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:24:12,170 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:24:12,171 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:24:12,171 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:24:12,171 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:24:12,171 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:24:12,171 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:24:12,172 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:24:12,172 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:24:12,172 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:24:12,173 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:24:12,173 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:24:12,174 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:24:12,174 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:24:12,174 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:24:12,174 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:24:12,174 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:24:12,174 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:24:12,175 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:24:12,175 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:24:12,175 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:24:12,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:24:12,175 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:24:12,176 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:24:12,176 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:24:12,176 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:24:12,176 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:24:12,177 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:24:12,177 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:24:12,177 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:24:12,177 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:24:12,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:24:12,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:24:12,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:24:12,246 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:24:12,246 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:24:12,247 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label25_true-unreach-call.c [2018-10-25 01:24:12,307 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/30e20eaa8/4d30ebb516d54a12989822411b37ead3/FLAGb0250dd38 [2018-10-25 01:24:12,867 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:24:12,872 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label25_true-unreach-call.c [2018-10-25 01:24:12,885 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/30e20eaa8/4d30ebb516d54a12989822411b37ead3/FLAGb0250dd38 [2018-10-25 01:24:12,900 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/30e20eaa8/4d30ebb516d54a12989822411b37ead3 [2018-10-25 01:24:12,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:24:12,913 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:24:12,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:24:12,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:24:12,921 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:24:12,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:24:12" (1/1) ... [2018-10-25 01:24:12,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@128929bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:12, skipping insertion in model container [2018-10-25 01:24:12,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:24:12" (1/1) ... [2018-10-25 01:24:12,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:24:12,996 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:24:13,452 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:24:13,456 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:24:13,581 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:24:13,598 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:24:13,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:13 WrapperNode [2018-10-25 01:24:13,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:24:13,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:24:13,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:24:13,600 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:24:13,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:13" (1/1) ... [2018-10-25 01:24:13,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:13" (1/1) ... [2018-10-25 01:24:13,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:24:13,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:24:13,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:24:13,792 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:24:13,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:13" (1/1) ... [2018-10-25 01:24:13,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:13" (1/1) ... [2018-10-25 01:24:13,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:13" (1/1) ... [2018-10-25 01:24:13,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:13" (1/1) ... [2018-10-25 01:24:13,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:13" (1/1) ... [2018-10-25 01:24:13,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:13" (1/1) ... [2018-10-25 01:24:13,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:13" (1/1) ... [2018-10-25 01:24:13,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:24:13,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:24:13,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:24:13,918 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:24:13,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:13" (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 01:24:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:24:13,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:24:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:24:13,989 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:24:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:24:13,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:24:13,990 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:24:13,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:24:17,238 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:24:17,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:24:17 BoogieIcfgContainer [2018-10-25 01:24:17,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:24:17,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:24:17,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:24:17,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:24:17,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:24:12" (1/3) ... [2018-10-25 01:24:17,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ada0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:24:17, skipping insertion in model container [2018-10-25 01:24:17,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:13" (2/3) ... [2018-10-25 01:24:17,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ada0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:24:17, skipping insertion in model container [2018-10-25 01:24:17,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:24:17" (3/3) ... [2018-10-25 01:24:17,247 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label25_true-unreach-call.c [2018-10-25 01:24:17,258 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:24:17,269 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:24:17,288 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:24:17,329 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:24:17,329 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:24:17,330 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:24:17,330 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:24:17,330 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:24:17,330 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:24:17,331 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:24:17,331 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:24:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-25 01:24:17,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-25 01:24:17,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:17,374 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] [2018-10-25 01:24:17,377 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:17,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:17,384 INFO L82 PathProgramCache]: Analyzing trace with hash 382760497, now seen corresponding path program 1 times [2018-10-25 01:24:17,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:17,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:17,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:17,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:17,436 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:17,894 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:24:18,064 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 01:24:18,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:24:18,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:24:18,067 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:18,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:24:18,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:24:18,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:24:18,092 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-10-25 01:24:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:24:19,845 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-10-25 01:24:19,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:24:19,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-10-25 01:24:19,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:24:19,868 INFO L225 Difference]: With dead ends: 574 [2018-10-25 01:24:19,868 INFO L226 Difference]: Without dead ends: 356 [2018-10-25 01:24:19,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:24:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-25 01:24:19,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-10-25 01:24:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-25 01:24:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 592 transitions. [2018-10-25 01:24:19,952 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 592 transitions. Word has length 71 [2018-10-25 01:24:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:24:19,953 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 592 transitions. [2018-10-25 01:24:19,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:24:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 592 transitions. [2018-10-25 01:24:19,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-25 01:24:19,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:19,963 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:24:19,963 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:19,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:19,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1446129720, now seen corresponding path program 1 times [2018-10-25 01:24:19,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:19,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:19,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:19,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:19,966 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:24:20,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:24:20,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:24:20,282 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:20,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:24:20,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:24:20,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:24:20,287 INFO L87 Difference]: Start difference. First operand 356 states and 592 transitions. Second operand 6 states. [2018-10-25 01:24:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:24:22,520 INFO L93 Difference]: Finished difference Result 1002 states and 1689 transitions. [2018-10-25 01:24:22,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:24:22,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-10-25 01:24:22,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:24:22,530 INFO L225 Difference]: With dead ends: 1002 [2018-10-25 01:24:22,530 INFO L226 Difference]: Without dead ends: 652 [2018-10-25 01:24:22,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:24:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-10-25 01:24:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 640. [2018-10-25 01:24:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-10-25 01:24:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 960 transitions. [2018-10-25 01:24:22,597 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 960 transitions. Word has length 141 [2018-10-25 01:24:22,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:24:22,598 INFO L481 AbstractCegarLoop]: Abstraction has 640 states and 960 transitions. [2018-10-25 01:24:22,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:24:22,598 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 960 transitions. [2018-10-25 01:24:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-25 01:24:22,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:22,605 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:24:22,605 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:22,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:22,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1467562684, now seen corresponding path program 1 times [2018-10-25 01:24:22,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:22,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:22,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:22,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:22,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:24:22,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:24:22,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:24:22,909 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:22,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:24:22,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:24:22,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:24:22,911 INFO L87 Difference]: Start difference. First operand 640 states and 960 transitions. Second operand 4 states. [2018-10-25 01:24:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:24:26,185 INFO L93 Difference]: Finished difference Result 2128 states and 3336 transitions. [2018-10-25 01:24:26,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:24:26,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-10-25 01:24:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:24:26,195 INFO L225 Difference]: With dead ends: 2128 [2018-10-25 01:24:26,196 INFO L226 Difference]: Without dead ends: 904 [2018-10-25 01:24:26,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:24:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-10-25 01:24:26,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-10-25 01:24:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-10-25 01:24:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1277 transitions. [2018-10-25 01:24:26,257 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1277 transitions. Word has length 151 [2018-10-25 01:24:26,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:24:26,257 INFO L481 AbstractCegarLoop]: Abstraction has 904 states and 1277 transitions. [2018-10-25 01:24:26,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:24:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1277 transitions. [2018-10-25 01:24:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-25 01:24:26,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:26,263 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:24:26,265 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:26,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:26,265 INFO L82 PathProgramCache]: Analyzing trace with hash -774507349, now seen corresponding path program 1 times [2018-10-25 01:24:26,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:26,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:26,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:26,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:26,267 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:26,646 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:24:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:24:26,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:24:26,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:24:26,991 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:26,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:24:26,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:24:26,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:24:26,992 INFO L87 Difference]: Start difference. First operand 904 states and 1277 transitions. Second operand 6 states. [2018-10-25 01:24:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:24:28,384 INFO L93 Difference]: Finished difference Result 2127 states and 3078 transitions. [2018-10-25 01:24:28,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:24:28,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2018-10-25 01:24:28,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:24:28,399 INFO L225 Difference]: With dead ends: 2127 [2018-10-25 01:24:28,400 INFO L226 Difference]: Without dead ends: 1229 [2018-10-25 01:24:28,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:24:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-10-25 01:24:28,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1208. [2018-10-25 01:24:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2018-10-25 01:24:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1646 transitions. [2018-10-25 01:24:28,454 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1646 transitions. Word has length 194 [2018-10-25 01:24:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:24:28,454 INFO L481 AbstractCegarLoop]: Abstraction has 1208 states and 1646 transitions. [2018-10-25 01:24:28,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:24:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1646 transitions. [2018-10-25 01:24:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-25 01:24:28,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:28,461 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:24:28,461 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:28,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:28,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1703489504, now seen corresponding path program 1 times [2018-10-25 01:24:28,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:28,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:28,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:28,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:28,463 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 128 proven. 78 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:24:29,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:24:29,040 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:24:29,041 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-10-25 01:24:29,044 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:24:29,123 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:24:29,123 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:24:29,634 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:24:29,635 INFO L272 AbstractInterpreter]: Visited 93 different actions 93 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:24:29,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:29,678 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:24:30,231 INFO L232 lantSequenceWeakener]: Weakened 233 states. On average, predicates are now at 73.71% of their original sizes. [2018-10-25 01:24:30,232 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:24:30,487 INFO L413 sIntCurrentIteration]: We have 241 unified AI predicates [2018-10-25 01:24:30,487 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:24:30,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:24:30,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-25 01:24:30,489 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:30,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:24:30,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:24:30,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:24:30,490 INFO L87 Difference]: Start difference. First operand 1208 states and 1646 transitions. Second operand 6 states. [2018-10-25 01:25:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:02,618 INFO L93 Difference]: Finished difference Result 2556 states and 3478 transitions. [2018-10-25 01:25:02,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:25:02,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 242 [2018-10-25 01:25:02,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:02,626 INFO L225 Difference]: With dead ends: 2556 [2018-10-25 01:25:02,626 INFO L226 Difference]: Without dead ends: 1354 [2018-10-25 01:25:02,630 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 242 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 01:25:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-10-25 01:25:02,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-10-25 01:25:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-10-25 01:25:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1796 transitions. [2018-10-25 01:25:02,668 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1796 transitions. Word has length 242 [2018-10-25 01:25:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:02,669 INFO L481 AbstractCegarLoop]: Abstraction has 1352 states and 1796 transitions. [2018-10-25 01:25:02,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:25:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1796 transitions. [2018-10-25 01:25:02,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-25 01:25:02,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:02,678 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:25:02,678 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:02,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:02,679 INFO L82 PathProgramCache]: Analyzing trace with hash -677086258, now seen corresponding path program 1 times [2018-10-25 01:25:02,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:02,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:02,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:02,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:02,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:03,614 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-10-25 01:25:03,870 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2018-10-25 01:25:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 266 proven. 82 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-25 01:25:04,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:25:04,102 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:25:04,102 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2018-10-25 01:25:04,102 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:25:04,107 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:25:04,107 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:25:10,750 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:25:10,751 INFO L272 AbstractInterpreter]: Visited 98 different actions 391 times. Merged at 8 different actions 35 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 24 variables. [2018-10-25 01:25:10,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:10,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:25:10,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:25:10,755 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 01:25:10,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:10,769 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:25:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:10,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:25:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 350 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-25 01:25:11,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:25:11,953 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-25 01:25:12,110 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-25 01:25:12,224 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-10-25 01:25:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 266 proven. 82 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-25 01:25:12,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 01:25:12,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 18 [2018-10-25 01:25:12,548 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 01:25:12,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-25 01:25:12,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-25 01:25:12,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-10-25 01:25:12,550 INFO L87 Difference]: Start difference. First operand 1352 states and 1796 transitions. Second operand 17 states. [2018-10-25 01:25:12,713 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2018-10-25 01:25:17,130 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2018-10-25 01:25:19,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:19,726 INFO L93 Difference]: Finished difference Result 3850 states and 5531 transitions. [2018-10-25 01:25:19,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-25 01:25:19,727 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 313 [2018-10-25 01:25:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:19,748 INFO L225 Difference]: With dead ends: 3850 [2018-10-25 01:25:19,748 INFO L226 Difference]: Without dead ends: 2648 [2018-10-25 01:25:19,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 647 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=550, Invalid=1612, Unknown=0, NotChecked=0, Total=2162 [2018-10-25 01:25:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2018-10-25 01:25:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2574. [2018-10-25 01:25:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2574 states. [2018-10-25 01:25:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2574 states and 3287 transitions. [2018-10-25 01:25:19,862 INFO L78 Accepts]: Start accepts. Automaton has 2574 states and 3287 transitions. Word has length 313 [2018-10-25 01:25:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:19,864 INFO L481 AbstractCegarLoop]: Abstraction has 2574 states and 3287 transitions. [2018-10-25 01:25:19,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-25 01:25:19,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 3287 transitions. [2018-10-25 01:25:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-25 01:25:19,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:19,878 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 01:25:19,878 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:19,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:19,878 INFO L82 PathProgramCache]: Analyzing trace with hash 765572205, now seen corresponding path program 1 times [2018-10-25 01:25:19,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:19,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:19,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:19,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:19,880 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:20,549 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-25 01:25:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 283 proven. 158 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:25:21,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:25:21,093 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:25:21,093 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 359 with the following transitions: [2018-10-25 01:25:21,093 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:25:21,098 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:25:21,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:25:28,315 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:25:28,316 INFO L272 AbstractInterpreter]: Visited 126 different actions 379 times. Merged at 8 different actions 25 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 24 variables. [2018-10-25 01:25:28,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:28,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:25:28,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:25:28,330 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 01:25:28,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:28,338 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:25:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:28,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:25:29,319 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 38 [2018-10-25 01:25:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 377 proven. 4 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-25 01:25:30,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:25:31,542 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-25 01:25:31,548 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-25 01:25:31,686 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2018-10-25 01:25:31,963 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2018-10-25 01:25:31,969 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:32,070 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:32,128 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:32,189 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:32,232 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:32,294 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:32,469 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:32,538 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:32,601 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:32,661 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:32,735 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:32,778 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:32,853 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:32,900 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:32,947 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:33,037 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:33,079 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:33,213 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:33,289 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:33,341 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:33,387 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:33,436 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:33,478 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:33,524 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:33,586 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:33,638 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:33,749 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:33,795 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:33,853 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:33,941 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:34,277 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:34,467 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:34,521 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:34,571 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:34,614 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:34,657 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:34,702 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:34,821 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:34,865 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:34,983 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:35,052 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:35,094 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:35,150 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:35,197 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:35,246 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:35,300 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:35,368 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:35,413 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:35,468 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:35,789 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:35,834 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:35,882 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:35,939 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:36,003 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:36,110 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:36,160 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:36,497 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:36,645 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:36,689 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:36,744 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:36,791 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:36,833 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:36,891 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:36,968 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,010 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,106 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,153 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,197 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,239 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,282 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,324 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,372 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,415 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,458 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,501 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,544 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,584 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,651 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,694 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:37,736 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,051 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,269 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,313 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,357 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,401 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,445 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,494 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,539 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,581 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,626 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,670 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,713 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,756 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,824 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,877 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,927 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:38,993 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:39,334 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:39,657 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:39,975 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:40,227 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:40,272 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:40,316 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:40,361 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:40,406 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:40,741 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:40,805 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:40,849 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-25 01:25:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 202 proven. 239 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:25:41,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 01:25:41,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2018-10-25 01:25:41,590 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 01:25:41,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-25 01:25:41,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-25 01:25:41,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2018-10-25 01:25:41,595 INFO L87 Difference]: Start difference. First operand 2574 states and 3287 transitions. Second operand 18 states. [2018-10-25 01:25:44,154 WARN L179 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2018-10-25 01:25:46,341 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2018-10-25 01:25:51,296 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2018-10-25 01:25:52,515 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-10-25 01:25:54,111 WARN L179 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2018-10-25 01:25:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:55,500 INFO L93 Difference]: Finished difference Result 8851 states and 11942 transitions. [2018-10-25 01:25:55,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-25 01:25:55,500 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 358 [2018-10-25 01:25:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:55,534 INFO L225 Difference]: With dead ends: 8851 [2018-10-25 01:25:55,534 INFO L226 Difference]: Without dead ends: 6427 [2018-10-25 01:25:55,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 628 SyntacticMatches, 111 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3407 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=805, Invalid=2855, Unknown=0, NotChecked=0, Total=3660 [2018-10-25 01:25:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6427 states. [2018-10-25 01:25:55,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6427 to 6205. [2018-10-25 01:25:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6205 states. [2018-10-25 01:25:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 7791 transitions. [2018-10-25 01:25:55,718 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 7791 transitions. Word has length 358 [2018-10-25 01:25:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:55,719 INFO L481 AbstractCegarLoop]: Abstraction has 6205 states and 7791 transitions. [2018-10-25 01:25:55,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-25 01:25:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 7791 transitions. [2018-10-25 01:25:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-10-25 01:25:55,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:55,747 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 01:25:55,747 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:55,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:55,748 INFO L82 PathProgramCache]: Analyzing trace with hash 651085646, now seen corresponding path program 1 times [2018-10-25 01:25:55,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:55,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:55,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:55,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:55,749 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-10-25 01:25:56,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:25:56,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:25:56,228 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:25:56,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:25:56,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:25:56,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:25:56,229 INFO L87 Difference]: Start difference. First operand 6205 states and 7791 transitions. Second operand 4 states. [2018-10-25 01:25:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:57,802 INFO L93 Difference]: Finished difference Result 15904 states and 20988 transitions. [2018-10-25 01:25:57,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:25:57,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 377 [2018-10-25 01:25:57,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:57,854 INFO L225 Difference]: With dead ends: 15904 [2018-10-25 01:25:57,854 INFO L226 Difference]: Without dead ends: 9849 [2018-10-25 01:25:57,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:25:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9849 states. [2018-10-25 01:25:58,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9849 to 9844. [2018-10-25 01:25:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9844 states. [2018-10-25 01:25:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9844 states to 9844 states and 12521 transitions. [2018-10-25 01:25:58,144 INFO L78 Accepts]: Start accepts. Automaton has 9844 states and 12521 transitions. Word has length 377 [2018-10-25 01:25:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:58,145 INFO L481 AbstractCegarLoop]: Abstraction has 9844 states and 12521 transitions. [2018-10-25 01:25:58,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:25:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 9844 states and 12521 transitions. [2018-10-25 01:25:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-25 01:25:58,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:58,191 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:25:58,191 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:58,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:58,192 INFO L82 PathProgramCache]: Analyzing trace with hash -268100511, now seen corresponding path program 1 times [2018-10-25 01:25:58,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:58,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:58,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:58,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:58,193 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 269 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-10-25 01:25:59,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:25:59,615 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:25:59,616 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 397 with the following transitions: [2018-10-25 01:25:59,616 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [558], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [706], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:25:59,630 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:25:59,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:26:00,360 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:26:00,360 INFO L272 AbstractInterpreter]: Visited 133 different actions 403 times. Merged at 8 different actions 28 times. Widened at 1 different actions 1 times. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-25 01:26:00,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:26:00,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:26:00,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:26:00,367 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 01:26:00,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:26:00,520 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:26:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:26:00,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:26:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 395 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-25 01:26:00,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:26:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 395 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-25 01:26:00,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 01:26:00,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2018-10-25 01:26:00,953 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 01:26:00,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 01:26:00,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 01:26:00,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-25 01:26:00,955 INFO L87 Difference]: Start difference. First operand 9844 states and 12521 transitions. Second operand 11 states. [2018-10-25 01:26:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:26:03,663 INFO L93 Difference]: Finished difference Result 18873 states and 24635 transitions. [2018-10-25 01:26:03,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-25 01:26:03,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 396 [2018-10-25 01:26:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:26:03,728 INFO L225 Difference]: With dead ends: 18873 [2018-10-25 01:26:03,728 INFO L226 Difference]: Without dead ends: 9467 [2018-10-25 01:26:03,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 796 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2018-10-25 01:26:03,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9467 states. [2018-10-25 01:26:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9467 to 9116. [2018-10-25 01:26:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9116 states. [2018-10-25 01:26:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 11512 transitions. [2018-10-25 01:26:04,049 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 11512 transitions. Word has length 396 [2018-10-25 01:26:04,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:26:04,050 INFO L481 AbstractCegarLoop]: Abstraction has 9116 states and 11512 transitions. [2018-10-25 01:26:04,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 01:26:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 11512 transitions. [2018-10-25 01:26:04,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-25 01:26:04,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:26:04,101 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:26:04,102 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:26:04,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:26:04,102 INFO L82 PathProgramCache]: Analyzing trace with hash 642099933, now seen corresponding path program 1 times [2018-10-25 01:26:04,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:26:04,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:26:04,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:26:04,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:26:04,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:26:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:26:04,661 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-25 01:26:04,859 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-25 01:26:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 182 proven. 222 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-25 01:26:05,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:26:05,260 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:26:05,260 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 415 with the following transitions: [2018-10-25 01:26:05,261 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [706], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [766], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:26:05,264 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:26:05,264 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:26:05,714 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:26:05,715 INFO L272 AbstractInterpreter]: Visited 148 different actions 441 times. Merged at 8 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-10-25 01:26:05,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:26:05,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:26:05,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:26:05,741 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 01:26:05,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:26:05,758 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:26:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:26:05,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:26:09,220 WARN L179 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-10-25 01:26:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 0 proven. 479 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:26:11,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:26:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-10-25 01:26:12,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-25 01:26:12,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12, 12] total 19 [2018-10-25 01:26:12,240 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:26:12,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:26:12,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:26:12,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=281, Unknown=1, NotChecked=0, Total=342 [2018-10-25 01:26:12,241 INFO L87 Difference]: Start difference. First operand 9116 states and 11512 transitions. Second operand 3 states. [2018-10-25 01:26:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:26:13,155 INFO L93 Difference]: Finished difference Result 19291 states and 24823 transitions. [2018-10-25 01:26:13,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:26:13,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 414 [2018-10-25 01:26:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:26:13,159 INFO L225 Difference]: With dead ends: 19291 [2018-10-25 01:26:13,159 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 01:26:13,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 820 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=60, Invalid=281, Unknown=1, NotChecked=0, Total=342 [2018-10-25 01:26:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 01:26:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 01:26:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 01:26:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 01:26:13,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 414 [2018-10-25 01:26:13,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:26:13,219 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 01:26:13,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:26:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 01:26:13,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 01:26:13,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 01:26:13,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:13,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:13,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:13,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:13,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:13,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:13,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:13,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:13,687 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 171 [2018-10-25 01:26:13,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:13,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:13,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:13,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:13,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:13,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:13,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:13,979 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 173 [2018-10-25 01:26:14,364 WARN L179 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 15 [2018-10-25 01:26:15,163 WARN L179 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 27 [2018-10-25 01:26:17,412 WARN L179 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 216 DAG size of output: 56 [2018-10-25 01:26:18,245 WARN L179 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 51 [2018-10-25 01:26:18,907 WARN L179 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 51 [2018-10-25 01:26:18,911 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 01:26:18,911 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-10-25 01:26:18,911 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 01:26:18,911 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-10-25 01:26:18,911 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,911 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,912 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,912 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,912 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,912 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,912 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-10-25 01:26:18,912 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-10-25 01:26:18,912 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-10-25 01:26:18,912 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-10-25 01:26:18,912 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-10-25 01:26:18,912 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-10-25 01:26:18,912 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-10-25 01:26:18,912 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-25 01:26:18,912 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-10-25 01:26:18,913 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-10-25 01:26:18,913 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-10-25 01:26:18,913 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,913 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,913 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,913 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,913 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,913 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-10-25 01:26:18,913 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-10-25 01:26:18,913 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-10-25 01:26:18,913 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-10-25 01:26:18,914 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-25 01:26:18,914 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-10-25 01:26:18,914 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-25 01:26:18,914 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-10-25 01:26:18,914 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-25 01:26:18,914 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-10-25 01:26:18,914 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-10-25 01:26:18,914 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-10-25 01:26:18,914 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-10-25 01:26:18,914 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-10-25 01:26:18,914 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,914 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,914 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,915 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,915 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,915 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-10-25 01:26:18,915 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-10-25 01:26:18,915 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-10-25 01:26:18,915 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-25 01:26:18,915 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-10-25 01:26:18,915 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-25 01:26:18,915 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-10-25 01:26:18,915 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-10-25 01:26:18,916 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-10-25 01:26:18,916 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-10-25 01:26:18,916 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,916 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,916 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,916 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,916 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,916 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-10-25 01:26:18,917 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-10-25 01:26:18,917 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-10-25 01:26:18,917 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-10-25 01:26:18,917 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-10-25 01:26:18,917 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-10-25 01:26:18,917 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-10-25 01:26:18,917 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-25 01:26:18,917 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-10-25 01:26:18,917 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-10-25 01:26:18,917 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-10-25 01:26:18,918 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-10-25 01:26:18,918 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-10-25 01:26:18,918 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,918 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,918 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,918 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,918 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,918 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-10-25 01:26:18,918 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-10-25 01:26:18,919 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-10-25 01:26:18,919 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-10-25 01:26:18,919 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-10-25 01:26:18,919 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-10-25 01:26:18,919 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-10-25 01:26:18,919 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-10-25 01:26:18,919 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-10-25 01:26:18,919 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,919 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,920 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,920 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,920 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,920 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,920 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,920 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-10-25 01:26:18,920 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-10-25 01:26:18,920 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-10-25 01:26:18,920 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-10-25 01:26:18,920 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-25 01:26:18,920 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-10-25 01:26:18,920 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-10-25 01:26:18,920 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-10-25 01:26:18,921 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-10-25 01:26:18,921 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-10-25 01:26:18,921 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-10-25 01:26:18,921 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-10-25 01:26:18,921 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-10-25 01:26:18,921 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,921 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,921 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,921 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,921 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-10-25 01:26:18,921 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,922 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,922 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-10-25 01:26:18,922 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-10-25 01:26:18,922 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-10-25 01:26:18,922 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-10-25 01:26:18,922 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-10-25 01:26:18,922 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-25 01:26:18,922 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-10-25 01:26:18,922 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-25 01:26:18,922 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-25 01:26:18,922 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-10-25 01:26:18,923 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-10-25 01:26:18,923 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-10-25 01:26:18,923 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-10-25 01:26:18,923 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,923 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,923 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,923 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,923 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,923 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,924 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-10-25 01:26:18,924 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-10-25 01:26:18,924 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-10-25 01:26:18,924 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-10-25 01:26:18,924 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-10-25 01:26:18,924 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-25 01:26:18,924 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-25 01:26:18,924 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-10-25 01:26:18,924 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-25 01:26:18,924 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-10-25 01:26:18,925 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-10-25 01:26:18,925 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse10 (= ~a1~0 |old(~a1~0)|)) (.cse9 (= ~a19~0 |old(~a19~0)|)) (.cse4 (= |old(~a10~0)| ~a10~0))) (let ((.cse7 (and .cse10 .cse9 .cse4)) (.cse0 (= 7 |old(~a19~0)|)) (.cse5 (< |old(~a10~0)| 1)) (.cse6 (= 4 |old(~a10~0)|)) (.cse1 (not (= 14 ~a4~0))) (.cse2 (not (= 0 ~a12~0))) (.cse8 (< 33 |old(~a1~0)|)) (.cse3 (and .cse9 .cse4 .cse10))) (and (or .cse0 (< 38 |old(~a1~0)|) .cse1 .cse2 .cse3 (not (= |old(~a10~0)| 0))) (or (and (= 8 ~a19~0) .cse4) (not (= 8 |old(~a19~0)|))) (or .cse5 .cse6 .cse3 .cse1 .cse2 (<= |old(~a1~0)| 218)) (or .cse0 (= 10 |old(~a19~0)|) .cse1 .cse7 .cse2) (or .cse6 (< |old(~a10~0)| 2) .cse1 .cse2 .cse7) (or .cse5 .cse0 .cse6 .cse3 .cse1 .cse2) (or .cse0 .cse6 .cse3 .cse1 .cse2 .cse8) (or .cse5 .cse6 .cse1 .cse2 .cse8 .cse3)))) [2018-10-25 01:26:18,925 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-10-25 01:26:18,925 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-10-25 01:26:18,925 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-10-25 01:26:18,925 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,926 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,926 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,926 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,926 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,926 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,926 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-10-25 01:26:18,926 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-10-25 01:26:18,926 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-10-25 01:26:18,926 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-10-25 01:26:18,927 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-10-25 01:26:18,927 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-10-25 01:26:18,927 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-25 01:26:18,927 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-10-25 01:26:18,927 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-10-25 01:26:18,927 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-10-25 01:26:18,927 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-10-25 01:26:18,927 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-10-25 01:26:18,928 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-10-25 01:26:18,928 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,928 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,928 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,928 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,928 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,928 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,928 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-10-25 01:26:18,928 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 196) no Hoare annotation was computed. [2018-10-25 01:26:18,928 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-10-25 01:26:18,929 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-10-25 01:26:18,929 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-10-25 01:26:18,929 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-10-25 01:26:18,929 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-10-25 01:26:18,929 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-10-25 01:26:18,929 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-25 01:26:18,929 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-25 01:26:18,929 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-10-25 01:26:18,929 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-10-25 01:26:18,930 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-10-25 01:26:18,930 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,930 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,930 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,930 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,930 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,930 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:18,930 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-10-25 01:26:18,930 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-10-25 01:26:18,930 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-10-25 01:26:18,931 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-10-25 01:26:18,931 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-10-25 01:26:18,931 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-10-25 01:26:18,931 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-25 01:26:18,931 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-10-25 01:26:18,931 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-25 01:26:18,931 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-10-25 01:26:18,931 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-10-25 01:26:18,931 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-10-25 01:26:18,932 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 01:26:18,932 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a19~0 9) (= ~a10~0 0) (= ~a12~0 0) (= ~a1~0 23) (= ~a4~0 14)) [2018-10-25 01:26:18,932 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 01:26:18,932 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 01:26:18,932 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (and (= ~a1~0 23) (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0)) (not (= 14 ~a4~0)) (not (= 0 ~a12~0)) (not (= 9 |old(~a19~0)|)) (not (= 23 |old(~a1~0)|)) (not (= 0 |old(~a10~0)|))) [2018-10-25 01:26:18,932 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-10-25 01:26:18,932 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse2 (<= ~a1~0 33)) (.cse3 (not (= 7 ~a19~0))) (.cse0 (<= 1 ~a10~0)) (.cse1 (not (= ~a10~0 4)))) (or (not (= 23 |old(~a1~0)|)) (and .cse0 (not (= ~a10~0 1)) .cse1) (not (= 0 ~a12~0)) (not (= 0 |old(~a10~0)|)) (and .cse0 .cse2 .cse1) (and (< 218 ~a1~0) (= 1 ~a10~0)) (and (<= ~a1~0 38) .cse3 (= ~a10~0 |old(~a10~0)|)) (and .cse3 .cse2 .cse1) (not (= 9 |old(~a19~0)|)) (and .cse3 (not (= ~a19~0 10))) (not (= 14 ~a4~0)) (and .cse3 .cse0 .cse1))) [2018-10-25 01:26:18,933 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-10-25 01:26:18,933 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-10-25 01:26:18,933 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-10-25 01:26:18,933 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse2 (<= ~a1~0 33)) (.cse3 (not (= 7 ~a19~0))) (.cse0 (<= 1 ~a10~0)) (.cse1 (not (= ~a10~0 4)))) (or (not (= 23 |old(~a1~0)|)) (and .cse0 (not (= ~a10~0 1)) .cse1) (not (= 0 ~a12~0)) (not (= 0 |old(~a10~0)|)) (and .cse0 .cse2 .cse1) (and (< 218 ~a1~0) (= 1 ~a10~0)) (and (<= ~a1~0 38) .cse3 (= ~a10~0 |old(~a10~0)|)) (and .cse3 .cse2 .cse1) (not (= 9 |old(~a19~0)|)) (and .cse3 (not (= ~a19~0 10))) (not (= 14 ~a4~0)) (and .cse3 .cse0 .cse1))) [2018-10-25 01:26:18,933 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-10-25 01:26:18,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 01:26:18 BoogieIcfgContainer [2018-10-25 01:26:18,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 01:26:18,947 INFO L168 Benchmark]: Toolchain (without parser) took 126035.10 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 875.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:26:18,948 INFO L168 Benchmark]: CDTParser took 0.18 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 01:26:18,949 INFO L168 Benchmark]: CACSL2BoogieTranslator took 685.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:26:18,949 INFO L168 Benchmark]: Boogie Procedure Inliner took 192.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.4 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:26:18,950 INFO L168 Benchmark]: Boogie Preprocessor took 125.21 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 01:26:18,951 INFO L168 Benchmark]: RCFGBuilder took 3321.29 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: 129.8 MB). Peak memory consumption was 129.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:26:18,952 INFO L168 Benchmark]: TraceAbstraction took 121705.95 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 790.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:26:18,956 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.18 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 685.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 192.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.4 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.21 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 3321.29 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: 129.8 MB). Peak memory consumption was 129.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 121705.95 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 790.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 196]: 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: 582]: Loop Invariant Derived loop invariant: ((((((((((!(23 == \old(a1)) || ((1 <= a10 && !(a10 == 1)) && !(a10 == 4))) || !(0 == a12)) || !(0 == \old(a10))) || ((1 <= a10 && a1 <= 33) && !(a10 == 4))) || (218 < a1 && 1 == a10)) || ((a1 <= 38 && !(7 == a19)) && a10 == \old(a10))) || ((!(7 == a19) && a1 <= 33) && !(a10 == 4))) || !(9 == \old(a19))) || (!(7 == a19) && !(a19 == 10))) || !(14 == a4)) || ((!(7 == a19) && 1 <= a10) && !(a10 == 4)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 121.6s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 67.5s AutomataDifference, 0.0s DeadEndRemovalTime, 5.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1151 SDtfs, 9375 SDslu, 1260 SDs, 0 SdLazy, 15095 SolverSat, 3273 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 45.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 3430 GetRequests, 3140 SyntacticMatches, 126 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 29.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9844occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 15.7s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.9976639543029587 AbsIntWeakeningRatio, 0.1078838174273859 AbsIntAvgWeakeningVarsNumRemoved, 15.560165975103734 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 687 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 218 PreInvPairs, 344 NumberOfFragments, 460 HoareAnnotationTreeSize, 218 FomulaSimplifications, 10868 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12540 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 27.9s InterpolantComputationTime, 4138 NumberOfCodeBlocks, 4138 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 5601 ConstructedInterpolants, 200 QuantifiedInterpolants, 13711318 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2331 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 4876/6315 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...