java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label20_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 18:31:21,241 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 18:31:21,243 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 18:31:21,255 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 18:31:21,256 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 18:31:21,257 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 18:31:21,258 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 18:31:21,261 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 18:31:21,262 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 18:31:21,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 18:31:21,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 18:31:21,267 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 18:31:21,268 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 18:31:21,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 18:31:21,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 18:31:21,280 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 18:31:21,281 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 18:31:21,288 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 18:31:21,290 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 18:31:21,291 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 18:31:21,292 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 18:31:21,294 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 18:31:21,297 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 18:31:21,297 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 18:31:21,297 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 18:31:21,298 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 18:31:21,299 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 18:31:21,300 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 18:31:21,301 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 18:31:21,302 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 18:31:21,302 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 18:31:21,303 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 18:31:21,303 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 18:31:21,303 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 18:31:21,304 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 18:31:21,305 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 18:31:21,305 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 18:31:21,327 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 18:31:21,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 18:31:21,328 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 18:31:21,328 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 18:31:21,328 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 18:31:21,329 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 18:31:21,329 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 18:31:21,329 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 18:31:21,329 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 18:31:21,329 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 18:31:21,329 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 18:31:21,330 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 18:31:21,330 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 18:31:21,332 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 18:31:21,332 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 18:31:21,332 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 18:31:21,332 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 18:31:21,332 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 18:31:21,333 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 18:31:21,333 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 18:31:21,333 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 18:31:21,333 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 18:31:21,333 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 18:31:21,334 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 18:31:21,334 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 18:31:21,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 18:31:21,334 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 18:31:21,334 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 18:31:21,335 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 18:31:21,335 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 18:31:21,335 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 18:31:21,335 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 18:31:21,335 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 18:31:21,336 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 18:31:21,336 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 18:31:21,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 18:31:21,418 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 18:31:21,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 18:31:21,424 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 18:31:21,424 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 18:31:21,425 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label20_true-unreach-call.c [2018-11-12 18:31:21,486 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9be0ae543/3d5be5fdefff48d0a7fa6dd8e27f8a02/FLAGfe2da4780 [2018-11-12 18:31:22,093 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 18:31:22,097 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label20_true-unreach-call.c [2018-11-12 18:31:22,119 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9be0ae543/3d5be5fdefff48d0a7fa6dd8e27f8a02/FLAGfe2da4780 [2018-11-12 18:31:22,143 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9be0ae543/3d5be5fdefff48d0a7fa6dd8e27f8a02 [2018-11-12 18:31:22,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 18:31:22,159 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 18:31:22,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 18:31:22,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 18:31:22,164 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 18:31:22,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:31:22" (1/1) ... [2018-11-12 18:31:22,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd207d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:22, skipping insertion in model container [2018-11-12 18:31:22,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:31:22" (1/1) ... [2018-11-12 18:31:22,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 18:31:22,250 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 18:31:22,756 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:31:22,761 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 18:31:22,911 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:31:22,933 INFO L193 MainTranslator]: Completed translation [2018-11-12 18:31:22,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:22 WrapperNode [2018-11-12 18:31:22,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 18:31:22,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 18:31:22,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 18:31:22,935 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 18:31:22,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:22" (1/1) ... [2018-11-12 18:31:23,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:22" (1/1) ... [2018-11-12 18:31:23,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 18:31:23,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 18:31:23,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 18:31:23,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 18:31:23,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:22" (1/1) ... [2018-11-12 18:31:23,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:22" (1/1) ... [2018-11-12 18:31:23,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:22" (1/1) ... [2018-11-12 18:31:23,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:22" (1/1) ... [2018-11-12 18:31:23,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:22" (1/1) ... [2018-11-12 18:31:23,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:22" (1/1) ... [2018-11-12 18:31:23,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:22" (1/1) ... [2018-11-12 18:31:23,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 18:31:23,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 18:31:23,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 18:31:23,202 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 18:31:23,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 18:31:23,277 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 18:31:23,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 18:31:23,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 18:31:23,278 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 18:31:23,278 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 18:31:23,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 18:31:23,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 18:31:23,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 18:31:23,278 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 18:31:26,418 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 18:31:26,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:31:26 BoogieIcfgContainer [2018-11-12 18:31:26,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 18:31:26,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 18:31:26,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 18:31:26,424 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 18:31:26,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:31:22" (1/3) ... [2018-11-12 18:31:26,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354cd257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:31:26, skipping insertion in model container [2018-11-12 18:31:26,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:22" (2/3) ... [2018-11-12 18:31:26,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354cd257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:31:26, skipping insertion in model container [2018-11-12 18:31:26,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:31:26" (3/3) ... [2018-11-12 18:31:26,428 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label20_true-unreach-call.c [2018-11-12 18:31:26,438 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 18:31:26,447 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 18:31:26,465 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 18:31:26,504 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 18:31:26,504 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 18:31:26,504 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 18:31:26,504 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 18:31:26,505 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 18:31:26,505 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 18:31:26,505 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 18:31:26,505 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 18:31:26,536 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-12 18:31:26,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-12 18:31:26,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:31:26,545 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] [2018-11-12 18:31:26,548 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:31:26,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:26,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2089647903, now seen corresponding path program 1 times [2018-11-12 18:31:26,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:31:26,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:26,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:31:26,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:26,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:31:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:31:27,003 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:31:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:31:27,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:31:27,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 18:31:27,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:31:27,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 18:31:27,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 18:31:27,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 18:31:27,144 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-12 18:31:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:31:28,809 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-12 18:31:28,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 18:31:28,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-12 18:31:28,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:31:28,830 INFO L225 Difference]: With dead ends: 574 [2018-11-12 18:31:28,831 INFO L226 Difference]: Without dead ends: 356 [2018-11-12 18:31:28,838 INFO L604 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-11-12 18:31:28,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-12 18:31:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-12 18:31:28,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-12 18:31:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-11-12 18:31:28,924 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 35 [2018-11-12 18:31:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:31:28,925 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-11-12 18:31:28,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 18:31:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-11-12 18:31:28,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-12 18:31:28,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:31:28,933 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:31:28,933 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:31:28,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:28,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1879649099, now seen corresponding path program 1 times [2018-11-12 18:31:28,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:31:28,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:28,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:31:28,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:28,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:31:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:31:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:31:29,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:31:29,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 18:31:29,416 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:31:29,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 18:31:29,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 18:31:29,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 18:31:29,419 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 5 states. [2018-11-12 18:31:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:31:32,089 INFO L93 Difference]: Finished difference Result 1288 states and 2312 transitions. [2018-11-12 18:31:32,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 18:31:32,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2018-11-12 18:31:32,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:31:32,105 INFO L225 Difference]: With dead ends: 1288 [2018-11-12 18:31:32,105 INFO L226 Difference]: Without dead ends: 938 [2018-11-12 18:31:32,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-12 18:31:32,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-11-12 18:31:32,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 923. [2018-11-12 18:31:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-12 18:31:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1440 transitions. [2018-11-12 18:31:32,180 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1440 transitions. Word has length 118 [2018-11-12 18:31:32,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:31:32,180 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1440 transitions. [2018-11-12 18:31:32,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 18:31:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1440 transitions. [2018-11-12 18:31:32,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-12 18:31:32,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:31:32,186 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:31:32,186 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:31:32,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:32,187 INFO L82 PathProgramCache]: Analyzing trace with hash 820065387, now seen corresponding path program 1 times [2018-11-12 18:31:32,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:31:32,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:32,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:31:32,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:32,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:31:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:31:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:31:32,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:31:32,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 18:31:32,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:31:32,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 18:31:32,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 18:31:32,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 18:31:32,526 INFO L87 Difference]: Start difference. First operand 923 states and 1440 transitions. Second operand 6 states. [2018-11-12 18:31:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:31:36,116 INFO L93 Difference]: Finished difference Result 2531 states and 4077 transitions. [2018-11-12 18:31:36,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:31:36,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-11-12 18:31:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:31:36,134 INFO L225 Difference]: With dead ends: 2531 [2018-11-12 18:31:36,134 INFO L226 Difference]: Without dead ends: 1614 [2018-11-12 18:31:36,141 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 18:31:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2018-11-12 18:31:36,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1583. [2018-11-12 18:31:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2018-11-12 18:31:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2316 transitions. [2018-11-12 18:31:36,210 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2316 transitions. Word has length 134 [2018-11-12 18:31:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:31:36,210 INFO L480 AbstractCegarLoop]: Abstraction has 1583 states and 2316 transitions. [2018-11-12 18:31:36,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 18:31:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2316 transitions. [2018-11-12 18:31:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-12 18:31:36,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:31:36,217 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:31:36,217 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:31:36,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:36,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1308687845, now seen corresponding path program 1 times [2018-11-12 18:31:36,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:31:36,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:36,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:31:36,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:36,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:31:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:31:36,556 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:31:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:31:36,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:31:36,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 18:31:36,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:31:36,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 18:31:36,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 18:31:36,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 18:31:36,682 INFO L87 Difference]: Start difference. First operand 1583 states and 2316 transitions. Second operand 6 states. [2018-11-12 18:31:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:31:37,981 INFO L93 Difference]: Finished difference Result 3502 states and 5312 transitions. [2018-11-12 18:31:37,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:31:37,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-11-12 18:31:37,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:31:37,997 INFO L225 Difference]: With dead ends: 3502 [2018-11-12 18:31:37,997 INFO L226 Difference]: Without dead ends: 1925 [2018-11-12 18:31:38,003 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 18:31:38,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2018-11-12 18:31:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1884. [2018-11-12 18:31:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1884 states. [2018-11-12 18:31:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2676 transitions. [2018-11-12 18:31:38,064 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2676 transitions. Word has length 158 [2018-11-12 18:31:38,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:31:38,064 INFO L480 AbstractCegarLoop]: Abstraction has 1884 states and 2676 transitions. [2018-11-12 18:31:38,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 18:31:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2676 transitions. [2018-11-12 18:31:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-12 18:31:38,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:31:38,071 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 18:31:38,072 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:31:38,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:38,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1100982905, now seen corresponding path program 1 times [2018-11-12 18:31:38,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:31:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:38,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:31:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:38,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:31:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:31:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 125 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:31:38,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:31:38,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:31:38,594 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-11-12 18:31:38,605 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], [181], [183], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:31:38,675 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:31:38,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:31:39,198 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:31:39,665 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:31:39,667 INFO L272 AbstractInterpreter]: Visited 91 different actions 260 times. Merged at 5 different actions 9 times. Never widened. Performed 2762 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2762 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 18:31:39,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:39,687 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:31:40,193 INFO L227 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 75.25% of their original sizes. [2018-11-12 18:31:40,194 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:31:41,437 INFO L415 sIntCurrentIteration]: We unified 188 AI predicates to 188 [2018-11-12 18:31:41,437 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:31:41,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:31:41,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-11-12 18:31:41,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:31:41,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 18:31:41,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 18:31:41,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-12 18:31:41,441 INFO L87 Difference]: Start difference. First operand 1884 states and 2676 transitions. Second operand 21 states. [2018-11-12 18:32:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:32:08,738 INFO L93 Difference]: Finished difference Result 4584 states and 6622 transitions. [2018-11-12 18:32:08,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 18:32:08,739 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 189 [2018-11-12 18:32:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:32:08,751 INFO L225 Difference]: With dead ends: 4584 [2018-11-12 18:32:08,752 INFO L226 Difference]: Without dead ends: 2706 [2018-11-12 18:32:08,761 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 206 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=279, Invalid=1203, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 18:32:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2018-11-12 18:32:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 2477. [2018-11-12 18:32:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2018-11-12 18:32:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3326 transitions. [2018-11-12 18:32:08,828 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3326 transitions. Word has length 189 [2018-11-12 18:32:08,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:32:08,829 INFO L480 AbstractCegarLoop]: Abstraction has 2477 states and 3326 transitions. [2018-11-12 18:32:08,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 18:32:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3326 transitions. [2018-11-12 18:32:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-12 18:32:08,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:32:08,834 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 18:32:08,834 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:32:08,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:32:08,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1928767200, now seen corresponding path program 1 times [2018-11-12 18:32:08,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:32:08,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:08,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:32:08,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:08,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:32:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:32:09,219 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 18:32:09,389 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 18:32:09,857 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-12 18:32:10,285 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-12 18:32:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 134 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:32:10,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:32:10,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:32:10,663 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-11-12 18:32:10,664 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], [181], [183], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:32:10,667 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:32:10,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:32:10,765 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:32:11,110 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:32:11,111 INFO L272 AbstractInterpreter]: Visited 92 different actions 517 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Performed 5921 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5921 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 18:32:11,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:32:11,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:32:11,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:32:11,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 18:32:11,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:32:11,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:32:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:32:11,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:32:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 134 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:32:11,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:32:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 134 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:32:12,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 18:32:12,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 17 [2018-11-12 18:32:12,406 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 18:32:12,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 18:32:12,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 18:32:12,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-11-12 18:32:12,408 INFO L87 Difference]: Start difference. First operand 2477 states and 3326 transitions. Second operand 15 states. [2018-11-12 18:32:12,736 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-11-12 18:32:21,119 WARN L179 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-11-12 18:32:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:32:21,319 INFO L93 Difference]: Finished difference Result 8331 states and 12722 transitions. [2018-11-12 18:32:21,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-12 18:32:21,320 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 198 [2018-11-12 18:32:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:32:21,355 INFO L225 Difference]: With dead ends: 8331 [2018-11-12 18:32:21,355 INFO L226 Difference]: Without dead ends: 5697 [2018-11-12 18:32:21,389 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=567, Invalid=1689, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 18:32:21,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5697 states. [2018-11-12 18:32:21,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5697 to 5175. [2018-11-12 18:32:21,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5175 states. [2018-11-12 18:32:21,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 6609 transitions. [2018-11-12 18:32:21,555 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 6609 transitions. Word has length 198 [2018-11-12 18:32:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:32:21,556 INFO L480 AbstractCegarLoop]: Abstraction has 5175 states and 6609 transitions. [2018-11-12 18:32:21,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 18:32:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 6609 transitions. [2018-11-12 18:32:21,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-11-12 18:32:21,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:32:21,573 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:32:21,574 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:32:21,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:32:21,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1099525103, now seen corresponding path program 1 times [2018-11-12 18:32:21,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:32:21,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:21,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:32:21,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:21,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:32:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:32:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 246 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-12 18:32:21,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:32:21,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:32:21,924 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 313 with the following transitions: [2018-11-12 18:32:21,924 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], [181], [183], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [546], [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], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:32:21,929 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:32:21,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:32:22,015 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:32:22,263 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:32:22,263 INFO L272 AbstractInterpreter]: Visited 125 different actions 369 times. Merged at 7 different actions 16 times. Never widened. Performed 5046 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5046 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 18:32:22,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:32:22,285 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:32:22,813 INFO L227 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 77.1% of their original sizes. [2018-11-12 18:32:22,814 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:32:23,270 INFO L415 sIntCurrentIteration]: We unified 311 AI predicates to 311 [2018-11-12 18:32:23,270 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:32:23,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:32:23,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-11-12 18:32:23,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:32:23,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 18:32:23,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 18:32:23,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-12 18:32:23,273 INFO L87 Difference]: Start difference. First operand 5175 states and 6609 transitions. Second operand 21 states. [2018-11-12 18:32:46,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:32:46,877 INFO L93 Difference]: Finished difference Result 11970 states and 16019 transitions. [2018-11-12 18:32:46,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 18:32:46,877 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 312 [2018-11-12 18:32:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:32:46,907 INFO L225 Difference]: With dead ends: 11970 [2018-11-12 18:32:46,907 INFO L226 Difference]: Without dead ends: 7097 [2018-11-12 18:32:46,930 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 332 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=321, Invalid=1401, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 18:32:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7097 states. [2018-11-12 18:32:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7097 to 6737. [2018-11-12 18:32:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6737 states. [2018-11-12 18:32:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6737 states to 6737 states and 8661 transitions. [2018-11-12 18:32:47,108 INFO L78 Accepts]: Start accepts. Automaton has 6737 states and 8661 transitions. Word has length 312 [2018-11-12 18:32:47,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:32:47,109 INFO L480 AbstractCegarLoop]: Abstraction has 6737 states and 8661 transitions. [2018-11-12 18:32:47,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 18:32:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand 6737 states and 8661 transitions. [2018-11-12 18:32:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-11-12 18:32:47,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:32:47,127 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:32:47,127 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:32:47,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:32:47,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1034455459, now seen corresponding path program 1 times [2018-11-12 18:32:47,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:32:47,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:47,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:32:47,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:47,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:32:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:32:47,724 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-11-12 18:32:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 144 proven. 114 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-12 18:32:48,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:32:48,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:32:48,202 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 323 with the following transitions: [2018-11-12 18:32:48,203 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], [181], [183], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [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-11-12 18:32:48,206 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:32:48,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:32:48,312 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:32:48,650 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:32:48,650 INFO L272 AbstractInterpreter]: Visited 126 different actions 493 times. Merged at 8 different actions 25 times. Never widened. Performed 6577 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6577 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 18:32:48,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:32:48,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:32:48,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:32:48,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 18:32:48,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:32:48,670 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:32:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:32:48,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:32:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-12 18:32:48,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:32:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-12 18:32:49,066 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:32:49,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [12] total 13 [2018-11-12 18:32:49,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:32:49,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 18:32:49,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 18:32:49,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-12 18:32:49,070 INFO L87 Difference]: Start difference. First operand 6737 states and 8661 transitions. Second operand 3 states. [2018-11-12 18:32:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:32:50,013 INFO L93 Difference]: Finished difference Result 14198 states and 18557 transitions. [2018-11-12 18:32:50,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 18:32:50,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2018-11-12 18:32:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:32:50,018 INFO L225 Difference]: With dead ends: 14198 [2018-11-12 18:32:50,018 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 18:32:50,048 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 644 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-12 18:32:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 18:32:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 18:32:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 18:32:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 18:32:50,049 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 322 [2018-11-12 18:32:50,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:32:50,049 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 18:32:50,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 18:32:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 18:32:50,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 18:32:50,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 18:32:50,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,716 WARN L179 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 201 [2018-11-12 18:32:50,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:50,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:51,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:51,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:51,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:51,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:51,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:51,222 WARN L179 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 182 [2018-11-12 18:32:51,813 WARN L179 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-11-12 18:32:52,197 WARN L179 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 47 [2018-11-12 18:32:55,600 WARN L179 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 270 DAG size of output: 35 [2018-11-12 18:32:55,820 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-12 18:32:56,663 WARN L179 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 56 [2018-11-12 18:32:57,498 WARN L179 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 56 [2018-11-12 18:32:57,501 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 18:32:57,501 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-11-12 18:32:57,501 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 18:32:57,501 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-12 18:32:57,501 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,501 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,502 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,503 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,503 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,503 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,503 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-12 18:32:57,503 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-12 18:32:57,503 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-12 18:32:57,503 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-12 18:32:57,504 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-12 18:32:57,504 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-12 18:32:57,504 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-12 18:32:57,504 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-12 18:32:57,504 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-12 18:32:57,504 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-12 18:32:57,504 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-12 18:32:57,504 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,504 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,504 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,507 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,507 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,507 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-12 18:32:57,507 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-12 18:32:57,508 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-12 18:32:57,508 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-12 18:32:57,508 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-12 18:32:57,508 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-12 18:32:57,508 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-12 18:32:57,508 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-12 18:32:57,508 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-12 18:32:57,508 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-12 18:32:57,508 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-12 18:32:57,508 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-12 18:32:57,509 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-12 18:32:57,509 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-12 18:32:57,509 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,509 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,509 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,509 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,509 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,509 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-12 18:32:57,509 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-12 18:32:57,509 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-12 18:32:57,510 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-12 18:32:57,510 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-12 18:32:57,510 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-12 18:32:57,510 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-12 18:32:57,511 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-12 18:32:57,511 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-12 18:32:57,511 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-12 18:32:57,511 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,511 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,511 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,511 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,511 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,511 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-12 18:32:57,511 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-12 18:32:57,514 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-12 18:32:57,514 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-12 18:32:57,514 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-12 18:32:57,514 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-12 18:32:57,514 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-12 18:32:57,514 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-12 18:32:57,514 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-12 18:32:57,514 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-12 18:32:57,514 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-12 18:32:57,517 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-12 18:32:57,517 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-12 18:32:57,517 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,517 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,517 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,517 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,517 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,517 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-12 18:32:57,518 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-12 18:32:57,518 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-12 18:32:57,518 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-12 18:32:57,518 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-12 18:32:57,518 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-12 18:32:57,518 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-12 18:32:57,518 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-12 18:32:57,518 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-12 18:32:57,518 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,518 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,518 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,519 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,519 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,519 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,519 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,519 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-12 18:32:57,519 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-12 18:32:57,519 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-12 18:32:57,519 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-12 18:32:57,519 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-12 18:32:57,519 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-12 18:32:57,520 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-12 18:32:57,520 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-12 18:32:57,520 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-12 18:32:57,520 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-12 18:32:57,520 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-12 18:32:57,520 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-12 18:32:57,520 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-12 18:32:57,520 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,520 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,520 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,520 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,521 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-12 18:32:57,521 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,521 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,521 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-12 18:32:57,521 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-12 18:32:57,521 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-12 18:32:57,521 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-12 18:32:57,521 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-12 18:32:57,521 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-12 18:32:57,521 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-12 18:32:57,522 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-12 18:32:57,523 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-12 18:32:57,523 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-12 18:32:57,523 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-12 18:32:57,523 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-12 18:32:57,523 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-12 18:32:57,523 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,523 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,523 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,523 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,524 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,524 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,524 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-12 18:32:57,524 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-12 18:32:57,524 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-12 18:32:57,524 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-12 18:32:57,524 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-12 18:32:57,524 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-12 18:32:57,524 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-12 18:32:57,524 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-12 18:32:57,524 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-12 18:32:57,525 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-12 18:32:57,525 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-12 18:32:57,525 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse3 (and (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|))) (.cse4 (= 7 |old(~a19~0)|)) (.cse0 (= 10 |old(~a19~0)|)) (.cse1 (not (= 14 ~a4~0))) (.cse2 (not (= 0 ~a12~0)))) (and (or (= 3 |old(~a10~0)|) (< |old(~a10~0)| 1) .cse0 .cse1 .cse2 .cse3) (or (or .cse4 .cse1 .cse2 (< 1 |old(~a10~0)|)) .cse3) (or .cse3 (or .cse4 .cse0 .cse1 .cse2)))) [2018-11-12 18:32:57,525 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-12 18:32:57,525 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-12 18:32:57,525 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-12 18:32:57,525 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,525 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,526 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,526 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,526 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,526 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,526 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-12 18:32:57,526 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-12 18:32:57,526 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-12 18:32:57,526 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-12 18:32:57,526 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-12 18:32:57,526 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-12 18:32:57,527 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-12 18:32:57,527 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-12 18:32:57,527 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-12 18:32:57,527 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-12 18:32:57,527 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2018-11-12 18:32:57,527 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-12 18:32:57,527 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-12 18:32:57,527 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-12 18:32:57,527 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,528 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,528 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,528 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,528 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,528 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,528 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-12 18:32:57,528 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-12 18:32:57,528 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-12 18:32:57,528 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-12 18:32:57,528 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-12 18:32:57,528 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-12 18:32:57,529 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-12 18:32:57,529 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-12 18:32:57,529 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-12 18:32:57,529 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-12 18:32:57,529 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-12 18:32:57,529 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-12 18:32:57,529 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,529 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,529 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,529 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,530 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,530 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:32:57,530 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-12 18:32:57,530 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-12 18:32:57,530 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-12 18:32:57,530 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-12 18:32:57,530 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-12 18:32:57,530 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-12 18:32:57,530 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-12 18:32:57,530 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-12 18:32:57,530 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-12 18:32:57,531 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-12 18:32:57,531 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-12 18:32:57,531 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-12 18:32:57,531 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 18:32:57,531 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputC~0 3) (= ~a19~0 9) (= ~a10~0 0) (= ~a12~0 0) (= ~inputB~0 2) (= ~a1~0 23) (= ~inputE~0 5) (= ~a4~0 14) (= ~inputD~0 4)) [2018-11-12 18:32:57,531 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 18:32:57,532 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 18:32:57,532 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (and (= ~a10~0 |old(~a10~0)|) (= ~a1~0 23) (= ~a19~0 |old(~a19~0)|)) (not (= |old(~a1~0)| 23)) (not (= 0 ~a12~0)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 3 ~inputC~0)) (not (= ~a4~0 14)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0))) [2018-11-12 18:32:57,532 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-12 18:32:57,532 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse1 (not (= ~a19~0 10))) (.cse0 (not (= ~a19~0 7)))) (or (not (= |old(~a1~0)| 23)) (and .cse0 .cse1) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)) (not (= ~a12~0 0)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (and (not (= ~a10~0 3)) .cse1 (<= 1 ~a10~0)) (not (= 14 ~a4~0)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (and .cse0 (<= ~a10~0 1)))) [2018-11-12 18:32:57,532 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-12 18:32:57,532 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-12 18:32:57,532 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-12 18:32:57,533 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse1 (not (= ~a19~0 10))) (.cse0 (not (= ~a19~0 7)))) (or (not (= |old(~a1~0)| 23)) (and .cse0 .cse1) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)) (not (= ~a12~0 0)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (and (not (= ~a10~0 3)) .cse1 (<= 1 ~a10~0)) (not (= 14 ~a4~0)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (and .cse0 (<= ~a10~0 1)))) [2018-11-12 18:32:57,533 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-12 18:32:57,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:32:57 BoogieIcfgContainer [2018-11-12 18:32:57,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 18:32:57,557 INFO L168 Benchmark]: Toolchain (without parser) took 95399.52 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-12 18:32:57,558 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 18:32:57,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.91 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-11-12 18:32:57,561 INFO L168 Benchmark]: Boogie Procedure Inliner took 158.38 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-12 18:32:57,561 INFO L168 Benchmark]: Boogie Preprocessor took 107.15 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 18:32:57,562 INFO L168 Benchmark]: RCFGBuilder took 3218.02 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.3 MB). Peak memory consumption was 108.3 MB. Max. memory is 7.1 GB. [2018-11-12 18:32:57,563 INFO L168 Benchmark]: TraceAbstraction took 91136.06 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.7 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 2.5 GB. Max. memory is 7.1 GB. [2018-11-12 18:32:57,568 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.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.91 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 158.38 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.15 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3218.02 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.3 MB). Peak memory consumption was 108.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 91136.06 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.7 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 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 88]: 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: (((((((((((!(\old(a1) == 23) || (!(a19 == 7) && !(a19 == 10))) || !(inputF == 6)) || !(\old(a10) == 0)) || !(a12 == 0)) || !(4 == inputD)) || !(inputE == 5)) || ((!(a10 == 3) && !(a19 == 10)) && 1 <= a10)) || !(14 == a4)) || !(3 == inputC)) || !(2 == inputB)) || !(\old(a19) == 9)) || (!(a19 == 7) && a10 <= 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 91.0s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 70.2s AutomataDifference, 0.0s DeadEndRemovalTime, 7.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1052 SDtfs, 8851 SDslu, 1289 SDs, 0 SdLazy, 13059 SolverSat, 2711 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.5s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1691 GetRequests, 1525 SyntacticMatches, 11 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6737occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.3s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9964079198050575 AbsIntWeakeningRatio, 0.11623246492985972 AbsIntAvgWeakeningVarsNumRemoved, 16.52304609218437 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 1198 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 119 PreInvPairs, 197 NumberOfFragments, 316 HoareAnnotationTreeSize, 119 FomulaSimplifications, 23643 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12620 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1986 NumberOfCodeBlocks, 1986 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2494 ConstructedInterpolants, 0 QuantifiedInterpolants, 2676870 SizeOfPredicates, 2 NumberOfNonLiveVariables, 909 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 1832/1956 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...