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/Problem01_label40_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:09:31,288 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:09:31,290 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:09:31,303 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:09:31,303 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:09:31,304 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:09:31,305 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:09:31,307 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:09:31,309 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:09:31,310 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:09:31,310 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:09:31,311 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:09:31,312 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:09:31,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:09:31,314 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:09:31,315 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:09:31,316 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:09:31,318 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:09:31,320 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:09:31,321 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:09:31,326 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:09:31,327 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:09:31,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:09:31,333 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:09:31,333 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:09:31,334 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:09:31,335 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:09:31,336 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:09:31,337 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:09:31,338 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:09:31,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:09:31,339 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:09:31,339 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:09:31,339 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:09:31,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:09:31,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:09:31,341 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 17:09:31,370 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:09:31,370 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:09:31,372 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:09:31,372 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:09:31,372 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:09:31,373 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:09:31,373 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:09:31,373 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:09:31,373 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:09:31,374 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:09:31,374 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:09:31,374 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:09:31,374 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:09:31,375 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:09:31,375 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:09:31,375 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:09:31,376 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:09:31,377 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:09:31,377 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:09:31,377 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:09:31,377 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:09:31,377 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:09:31,378 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:09:31,378 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:09:31,378 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:09:31,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:09:31,378 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:09:31,379 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:09:31,379 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:09:31,380 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:09:31,380 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:09:31,380 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:09:31,380 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:09:31,380 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:09:31,380 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:09:31,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:09:31,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:09:31,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:09:31,457 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:09:31,457 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:09:31,458 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label40_true-unreach-call_false-termination.c [2018-11-12 17:09:31,527 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf68fe106/46d24b24bf094fbb8d1f65422c887d90/FLAG1b6bdcbaa [2018-11-12 17:09:32,158 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:09:32,159 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label40_true-unreach-call_false-termination.c [2018-11-12 17:09:32,173 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf68fe106/46d24b24bf094fbb8d1f65422c887d90/FLAG1b6bdcbaa [2018-11-12 17:09:32,189 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf68fe106/46d24b24bf094fbb8d1f65422c887d90 [2018-11-12 17:09:32,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:09:32,207 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:09:32,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:09:32,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:09:32,213 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:09:32,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:09:32" (1/1) ... [2018-11-12 17:09:32,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ff260c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:32, skipping insertion in model container [2018-11-12 17:09:32,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:09:32" (1/1) ... [2018-11-12 17:09:32,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:09:32,307 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:09:32,813 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:09:32,824 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:09:32,988 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:09:33,010 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:09:33,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:33 WrapperNode [2018-11-12 17:09:33,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:09:33,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:09:33,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:09:33,012 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:09:33,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:33" (1/1) ... [2018-11-12 17:09:33,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:33" (1/1) ... [2018-11-12 17:09:33,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:09:33,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:09:33,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:09:33,142 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:09:33,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:33" (1/1) ... [2018-11-12 17:09:33,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:33" (1/1) ... [2018-11-12 17:09:33,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:33" (1/1) ... [2018-11-12 17:09:33,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:33" (1/1) ... [2018-11-12 17:09:33,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:33" (1/1) ... [2018-11-12 17:09:33,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:33" (1/1) ... [2018-11-12 17:09:33,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:33" (1/1) ... [2018-11-12 17:09:33,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:09:33,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:09:33,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:09:33,252 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:09:33,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:33" (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 17:09:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:09:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:09:33,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:09:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:09:33,323 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:09:33,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:09:33,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:09:33,323 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:09:33,324 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:09:36,290 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:09:36,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:09:36 BoogieIcfgContainer [2018-11-12 17:09:36,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:09:36,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:09:36,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:09:36,296 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:09:36,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:09:32" (1/3) ... [2018-11-12 17:09:36,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ca2e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:09:36, skipping insertion in model container [2018-11-12 17:09:36,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:33" (2/3) ... [2018-11-12 17:09:36,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ca2e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:09:36, skipping insertion in model container [2018-11-12 17:09:36,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:09:36" (3/3) ... [2018-11-12 17:09:36,303 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label40_true-unreach-call_false-termination.c [2018-11-12 17:09:36,313 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:09:36,320 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:09:36,333 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:09:36,372 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:09:36,372 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:09:36,372 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:09:36,372 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:09:36,372 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:09:36,373 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:09:36,373 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:09:36,373 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:09:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-12 17:09:36,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-12 17:09:36,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:36,415 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:36,418 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:36,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:36,423 INFO L82 PathProgramCache]: Analyzing trace with hash 861402336, now seen corresponding path program 1 times [2018-11-12 17:09:36,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:36,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:36,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:36,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:36,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:37,032 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:09:37,173 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 17:09:37,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:37,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:09:37,176 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:37,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:09:37,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:09:37,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:09:37,207 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-12 17:09:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:38,964 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-12 17:09:38,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:09:38,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-11-12 17:09:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:38,985 INFO L225 Difference]: With dead ends: 550 [2018-11-12 17:09:38,986 INFO L226 Difference]: Without dead ends: 340 [2018-11-12 17:09:38,993 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:09:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-12 17:09:39,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-12 17:09:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-12 17:09:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 569 transitions. [2018-11-12 17:09:39,070 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 569 transitions. Word has length 94 [2018-11-12 17:09:39,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:39,072 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 569 transitions. [2018-11-12 17:09:39,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:09:39,072 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 569 transitions. [2018-11-12 17:09:39,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-12 17:09:39,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:39,079 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-12 17:09:39,079 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:39,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:39,080 INFO L82 PathProgramCache]: Analyzing trace with hash -461810857, now seen corresponding path program 1 times [2018-11-12 17:09:39,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:39,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:39,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:39,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:39,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:39,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:39,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:09:39,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:39,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:09:39,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:09:39,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:09:39,250 INFO L87 Difference]: Start difference. First operand 340 states and 569 transitions. Second operand 5 states. [2018-11-12 17:09:41,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:41,187 INFO L93 Difference]: Finished difference Result 1079 states and 1888 transitions. [2018-11-12 17:09:41,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:09:41,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-11-12 17:09:41,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:41,196 INFO L225 Difference]: With dead ends: 1079 [2018-11-12 17:09:41,196 INFO L226 Difference]: Without dead ends: 745 [2018-11-12 17:09:41,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-12 17:09:41,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-11-12 17:09:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 733. [2018-11-12 17:09:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-11-12 17:09:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1163 transitions. [2018-11-12 17:09:41,264 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1163 transitions. Word has length 104 [2018-11-12 17:09:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:41,265 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 1163 transitions. [2018-11-12 17:09:41,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:09:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1163 transitions. [2018-11-12 17:09:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-12 17:09:41,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:41,274 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 17:09:41,274 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:41,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:41,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1700574034, now seen corresponding path program 1 times [2018-11-12 17:09:41,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:41,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:41,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:41,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:41,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:41,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:41,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:41,597 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2018-11-12 17:09:41,599 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [65], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:41,669 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:41,669 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:43,152 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:09:43,154 INFO L272 AbstractInterpreter]: Visited 98 different actions 163 times. Merged at 4 different actions 4 times. Never widened. Performed 2194 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2194 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:09:43,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:43,201 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:09:43,847 INFO L227 lantSequenceWeakener]: Weakened 127 states. On average, predicates are now at 80.06% of their original sizes. [2018-11-12 17:09:43,847 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:09:44,408 INFO L415 sIntCurrentIteration]: We unified 129 AI predicates to 129 [2018-11-12 17:09:44,408 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:09:44,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:09:44,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-12 17:09:44,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:44,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:09:44,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:09:44,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:09:44,416 INFO L87 Difference]: Start difference. First operand 733 states and 1163 transitions. Second operand 11 states. [2018-11-12 17:09:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:56,617 INFO L93 Difference]: Finished difference Result 2333 states and 3723 transitions. [2018-11-12 17:09:56,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:09:56,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 130 [2018-11-12 17:09:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:56,628 INFO L225 Difference]: With dead ends: 2333 [2018-11-12 17:09:56,628 INFO L226 Difference]: Without dead ends: 1606 [2018-11-12 17:09:56,633 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 140 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-12 17:09:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2018-11-12 17:09:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1579. [2018-11-12 17:09:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2018-11-12 17:09:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2094 transitions. [2018-11-12 17:09:56,691 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2094 transitions. Word has length 130 [2018-11-12 17:09:56,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:56,692 INFO L480 AbstractCegarLoop]: Abstraction has 1579 states and 2094 transitions. [2018-11-12 17:09:56,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:09:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2094 transitions. [2018-11-12 17:09:56,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 17:09:56,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:56,701 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:56,701 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:56,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:56,702 INFO L82 PathProgramCache]: Analyzing trace with hash 109773897, now seen corresponding path program 1 times [2018-11-12 17:09:56,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:56,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:56,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:56,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:56,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 52 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 17:09:56,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:56,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:56,901 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-11-12 17:09:56,901 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [65], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:56,906 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:56,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:57,293 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:09:57,293 INFO L272 AbstractInterpreter]: Visited 99 different actions 166 times. Merged at 5 different actions 5 times. Never widened. Performed 2545 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2545 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:09:57,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:57,305 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:09:57,814 INFO L227 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 80.77% of their original sizes. [2018-11-12 17:09:57,814 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:09:58,525 INFO L415 sIntCurrentIteration]: We unified 142 AI predicates to 142 [2018-11-12 17:09:58,525 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:09:58,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:09:58,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-12 17:09:58,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:58,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 17:09:58,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 17:09:58,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-12 17:09:58,528 INFO L87 Difference]: Start difference. First operand 1579 states and 2094 transitions. Second operand 19 states. [2018-11-12 17:10:16,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:16,226 INFO L93 Difference]: Finished difference Result 3437 states and 4621 transitions. [2018-11-12 17:10:16,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 17:10:16,226 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 143 [2018-11-12 17:10:16,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:16,236 INFO L225 Difference]: With dead ends: 3437 [2018-11-12 17:10:16,236 INFO L226 Difference]: Without dead ends: 2000 [2018-11-12 17:10:16,241 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 154 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-12 17:10:16,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2018-11-12 17:10:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1990. [2018-11-12 17:10:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1990 states. [2018-11-12 17:10:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2546 transitions. [2018-11-12 17:10:16,302 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2546 transitions. Word has length 143 [2018-11-12 17:10:16,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:16,303 INFO L480 AbstractCegarLoop]: Abstraction has 1990 states and 2546 transitions. [2018-11-12 17:10:16,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 17:10:16,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2546 transitions. [2018-11-12 17:10:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-12 17:10:16,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:16,309 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:10:16,310 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:16,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:16,310 INFO L82 PathProgramCache]: Analyzing trace with hash -604261450, now seen corresponding path program 1 times [2018-11-12 17:10:16,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:16,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:16,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 66 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-12 17:10:16,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:16,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:16,530 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2018-11-12 17:10:16,530 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [65], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:16,534 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:16,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:18,018 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:10:18,018 INFO L272 AbstractInterpreter]: Visited 101 different actions 474 times. Merged at 9 different actions 43 times. Never widened. Performed 8321 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8321 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 11 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:10:18,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:18,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:10:18,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:18,029 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 17:10:18,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:18,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:10:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:18,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:10:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-12 17:10:18,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:10:18,756 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-12 17:10:19,425 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 66 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-12 17:10:19,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:10:19,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-12 17:10:19,454 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:10:19,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 17:10:19,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 17:10:19,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:10:19,456 INFO L87 Difference]: Start difference. First operand 1990 states and 2546 transitions. Second operand 8 states. [2018-11-12 17:10:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:24,095 INFO L93 Difference]: Finished difference Result 5759 states and 8248 transitions. [2018-11-12 17:10:24,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 17:10:24,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 155 [2018-11-12 17:10:24,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:24,112 INFO L225 Difference]: With dead ends: 5759 [2018-11-12 17:10:24,112 INFO L226 Difference]: Without dead ends: 2956 [2018-11-12 17:10:24,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-11-12 17:10:24,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-11-12 17:10:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2846. [2018-11-12 17:10:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2846 states. [2018-11-12 17:10:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 3454 transitions. [2018-11-12 17:10:24,216 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 3454 transitions. Word has length 155 [2018-11-12 17:10:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:24,216 INFO L480 AbstractCegarLoop]: Abstraction has 2846 states and 3454 transitions. [2018-11-12 17:10:24,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 17:10:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 3454 transitions. [2018-11-12 17:10:24,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-12 17:10:24,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:24,229 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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 17:10:24,229 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:24,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:24,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1011492385, now seen corresponding path program 1 times [2018-11-12 17:10:24,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:24,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:24,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:24,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:24,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 141 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 17:10:24,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:24,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:24,666 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-11-12 17:10:24,666 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [261], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:24,669 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:24,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:25,024 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:10:25,024 INFO L272 AbstractInterpreter]: Visited 99 different actions 165 times. Merged at 5 different actions 5 times. Never widened. Performed 2797 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2797 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:10:25,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:25,032 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:10:25,936 INFO L227 lantSequenceWeakener]: Weakened 119 states. On average, predicates are now at 80.34% of their original sizes. [2018-11-12 17:10:25,937 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:10:27,285 INFO L415 sIntCurrentIteration]: We unified 224 AI predicates to 224 [2018-11-12 17:10:27,285 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:10:27,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:10:27,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [6] total 30 [2018-11-12 17:10:27,286 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:10:27,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 17:10:27,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 17:10:27,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-11-12 17:10:27,288 INFO L87 Difference]: Start difference. First operand 2846 states and 3454 transitions. Second operand 26 states. [2018-11-12 17:10:48,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:48,246 INFO L93 Difference]: Finished difference Result 5697 states and 6997 transitions. [2018-11-12 17:10:48,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 17:10:48,247 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 225 [2018-11-12 17:10:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:48,261 INFO L225 Difference]: With dead ends: 5697 [2018-11-12 17:10:48,261 INFO L226 Difference]: Without dead ends: 3056 [2018-11-12 17:10:48,271 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 243 GetRequests, 191 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=372, Invalid=1608, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 17:10:48,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2018-11-12 17:10:48,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 2772. [2018-11-12 17:10:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2772 states. [2018-11-12 17:10:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 3377 transitions. [2018-11-12 17:10:48,345 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 3377 transitions. Word has length 225 [2018-11-12 17:10:48,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:48,346 INFO L480 AbstractCegarLoop]: Abstraction has 2772 states and 3377 transitions. [2018-11-12 17:10:48,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 17:10:48,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 3377 transitions. [2018-11-12 17:10:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-12 17:10:48,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:48,359 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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 17:10:48,359 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:48,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:48,360 INFO L82 PathProgramCache]: Analyzing trace with hash -791452258, now seen corresponding path program 1 times [2018-11-12 17:10:48,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:48,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:48,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:48,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:48,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 139 proven. 62 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 17:10:48,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:48,577 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:48,578 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-11-12 17:10:48,578 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [261], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:48,581 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:48,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:49,805 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:10:49,805 INFO L272 AbstractInterpreter]: Visited 101 different actions 480 times. Merged at 9 different actions 49 times. Widened at 1 different actions 1 times. Performed 7984 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7984 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-12 17:10:49,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:49,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:10:49,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:49,816 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 17:10:49,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:49,827 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:10:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:49,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:10:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-12 17:10:50,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:10:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 145 proven. 54 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-12 17:10:50,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:10:50,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-12 17:10:50,580 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:10:50,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:10:50,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:10:50,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-12 17:10:50,581 INFO L87 Difference]: Start difference. First operand 2772 states and 3377 transitions. Second operand 11 states. [2018-11-12 17:10:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:53,418 INFO L93 Difference]: Finished difference Result 10276 states and 13172 transitions. [2018-11-12 17:10:53,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 17:10:53,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2018-11-12 17:10:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:53,461 INFO L225 Difference]: With dead ends: 10276 [2018-11-12 17:10:53,461 INFO L226 Difference]: Without dead ends: 7709 [2018-11-12 17:10:53,480 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 471 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-12 17:10:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7709 states. [2018-11-12 17:10:53,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7709 to 7544. [2018-11-12 17:10:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7544 states. [2018-11-12 17:10:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7544 states to 7544 states and 9216 transitions. [2018-11-12 17:10:53,685 INFO L78 Accepts]: Start accepts. Automaton has 7544 states and 9216 transitions. Word has length 234 [2018-11-12 17:10:53,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:53,685 INFO L480 AbstractCegarLoop]: Abstraction has 7544 states and 9216 transitions. [2018-11-12 17:10:53,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:10:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 7544 states and 9216 transitions. [2018-11-12 17:10:53,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-12 17:10:53,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:53,718 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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 17:10:53,718 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:53,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:53,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1003107116, now seen corresponding path program 1 times [2018-11-12 17:10:53,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:53,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:53,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:53,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:53,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 161 proven. 72 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-12 17:10:54,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:54,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:54,029 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2018-11-12 17:10:54,029 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [261], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:54,031 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:54,031 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:54,703 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:10:54,704 INFO L272 AbstractInterpreter]: Visited 100 different actions 267 times. Merged at 7 different actions 16 times. Never widened. Performed 4525 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4525 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:10:54,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:54,747 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:10:55,342 INFO L227 lantSequenceWeakener]: Weakened 240 states. On average, predicates are now at 80.06% of their original sizes. [2018-11-12 17:10:55,343 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:10:55,452 INFO L415 sIntCurrentIteration]: We unified 242 AI predicates to 242 [2018-11-12 17:10:55,452 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:10:55,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:10:55,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-12 17:10:55,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:10:55,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 17:10:55,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 17:10:55,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:10:55,454 INFO L87 Difference]: Start difference. First operand 7544 states and 9216 transitions. Second operand 10 states. [2018-11-12 17:11:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:01,343 INFO L93 Difference]: Finished difference Result 15168 states and 18607 transitions. [2018-11-12 17:11:01,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:11:01,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 243 [2018-11-12 17:11:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:01,378 INFO L225 Difference]: With dead ends: 15168 [2018-11-12 17:11:01,378 INFO L226 Difference]: Without dead ends: 7967 [2018-11-12 17:11:01,404 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 249 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-12 17:11:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7967 states. [2018-11-12 17:11:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7967 to 7958. [2018-11-12 17:11:01,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7958 states. [2018-11-12 17:11:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7958 states to 7958 states and 9679 transitions. [2018-11-12 17:11:01,601 INFO L78 Accepts]: Start accepts. Automaton has 7958 states and 9679 transitions. Word has length 243 [2018-11-12 17:11:01,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:01,601 INFO L480 AbstractCegarLoop]: Abstraction has 7958 states and 9679 transitions. [2018-11-12 17:11:01,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 17:11:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 7958 states and 9679 transitions. [2018-11-12 17:11:01,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-12 17:11:01,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:01,634 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 17:11:01,634 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:01,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:01,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1953014093, now seen corresponding path program 1 times [2018-11-12 17:11:01,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:01,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:01,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:01,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:01,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:02,174 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 17:11:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 163 proven. 15 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-12 17:11:02,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:02,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:11:02,292 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2018-11-12 17:11:02,292 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [261], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:11:02,294 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:11:02,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:11:02,568 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:11:02,568 INFO L272 AbstractInterpreter]: Visited 99 different actions 165 times. Merged at 5 different actions 5 times. Never widened. Performed 2133 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2133 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:11:02,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:02,582 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:11:02,980 INFO L227 lantSequenceWeakener]: Weakened 244 states. On average, predicates are now at 80.05% of their original sizes. [2018-11-12 17:11:02,981 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:11:03,072 INFO L415 sIntCurrentIteration]: We unified 246 AI predicates to 246 [2018-11-12 17:11:03,072 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:11:03,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:11:03,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-12 17:11:03,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:03,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:11:03,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:11:03,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:11:03,075 INFO L87 Difference]: Start difference. First operand 7958 states and 9679 transitions. Second operand 11 states. [2018-11-12 17:11:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:09,531 INFO L93 Difference]: Finished difference Result 15296 states and 18696 transitions. [2018-11-12 17:11:09,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:11:09,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 247 [2018-11-12 17:11:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:09,558 INFO L225 Difference]: With dead ends: 15296 [2018-11-12 17:11:09,558 INFO L226 Difference]: Without dead ends: 8097 [2018-11-12 17:11:09,576 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 255 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-12 17:11:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8097 states. [2018-11-12 17:11:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8097 to 8096. [2018-11-12 17:11:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8096 states. [2018-11-12 17:11:09,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8096 states to 8096 states and 9824 transitions. [2018-11-12 17:11:09,735 INFO L78 Accepts]: Start accepts. Automaton has 8096 states and 9824 transitions. Word has length 247 [2018-11-12 17:11:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:09,736 INFO L480 AbstractCegarLoop]: Abstraction has 8096 states and 9824 transitions. [2018-11-12 17:11:09,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:11:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 8096 states and 9824 transitions. [2018-11-12 17:11:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-12 17:11:09,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:09,766 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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 17:11:09,766 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:09,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:09,767 INFO L82 PathProgramCache]: Analyzing trace with hash -838571264, now seen corresponding path program 1 times [2018-11-12 17:11:09,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:09,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:09,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:09,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:09,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 161 proven. 84 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 17:11:10,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:10,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:11:10,074 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-11-12 17:11:10,074 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [261], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:11:10,076 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:11:10,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:11:10,716 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:11:10,716 INFO L272 AbstractInterpreter]: Visited 100 different actions 268 times. Merged at 7 different actions 17 times. Never widened. Performed 4254 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4254 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:11:10,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:10,752 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:11:11,194 INFO L227 lantSequenceWeakener]: Weakened 253 states. On average, predicates are now at 80.08% of their original sizes. [2018-11-12 17:11:11,195 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:11:11,299 INFO L415 sIntCurrentIteration]: We unified 255 AI predicates to 255 [2018-11-12 17:11:11,300 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:11:11,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:11:11,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-11-12 17:11:11,300 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:11,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:11:11,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:11:11,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:11:11,301 INFO L87 Difference]: Start difference. First operand 8096 states and 9824 transitions. Second operand 11 states. [2018-11-12 17:11:20,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:20,085 INFO L93 Difference]: Finished difference Result 16965 states and 20658 transitions. [2018-11-12 17:11:20,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 17:11:20,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 256 [2018-11-12 17:11:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:20,114 INFO L225 Difference]: With dead ends: 16965 [2018-11-12 17:11:20,114 INFO L226 Difference]: Without dead ends: 9350 [2018-11-12 17:11:20,129 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 265 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-12 17:11:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9350 states. [2018-11-12 17:11:20,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9350 to 9333. [2018-11-12 17:11:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9333 states. [2018-11-12 17:11:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9333 states to 9333 states and 11173 transitions. [2018-11-12 17:11:20,314 INFO L78 Accepts]: Start accepts. Automaton has 9333 states and 11173 transitions. Word has length 256 [2018-11-12 17:11:20,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:20,315 INFO L480 AbstractCegarLoop]: Abstraction has 9333 states and 11173 transitions. [2018-11-12 17:11:20,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:11:20,315 INFO L276 IsEmpty]: Start isEmpty. Operand 9333 states and 11173 transitions. [2018-11-12 17:11:20,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-12 17:11:20,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:20,344 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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 17:11:20,344 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:20,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:20,345 INFO L82 PathProgramCache]: Analyzing trace with hash 378234234, now seen corresponding path program 1 times [2018-11-12 17:11:20,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:20,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:20,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:20,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:20,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 216 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 17:11:20,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:20,808 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:11:20,808 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2018-11-12 17:11:20,809 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [261], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:11:20,811 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:11:20,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:11:21,721 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:11:21,722 INFO L272 AbstractInterpreter]: Visited 101 different actions 374 times. Merged at 9 different actions 33 times. Never widened. Performed 6340 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6340 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-12 17:11:21,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:21,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:11:21,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:21,729 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:11:21,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:21,740 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:11:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:21,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:11:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-12 17:11:21,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:11:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-12 17:11:22,084 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:11:22,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-12 17:11:22,084 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:22,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:11:22,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:11:22,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:11:22,085 INFO L87 Difference]: Start difference. First operand 9333 states and 11173 transitions. Second operand 3 states. [2018-11-12 17:11:22,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:22,962 INFO L93 Difference]: Finished difference Result 22116 states and 27025 transitions. [2018-11-12 17:11:22,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:11:22,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2018-11-12 17:11:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:22,963 INFO L225 Difference]: With dead ends: 22116 [2018-11-12 17:11:22,963 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:11:22,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:11:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:11:22,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:11:22,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:11:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:11:23,000 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 259 [2018-11-12 17:11:23,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:23,000 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:11:23,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:11:23,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:11:23,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:11:23,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:11:23,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:23,894 WARN L179 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 173 [2018-11-12 17:11:24,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:24,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:24,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:24,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:24,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:24,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:24,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:24,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:24,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:24,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:24,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:24,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:24,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:24,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:24,286 WARN L179 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 165 [2018-11-12 17:11:25,290 WARN L179 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-11-12 17:11:27,121 WARN L179 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 138 DAG size of output: 86 [2018-11-12 17:11:32,465 WARN L179 SmtUtils]: Spent 5.32 s on a formula simplification. DAG size of input: 431 DAG size of output: 124 [2018-11-12 17:11:33,042 WARN L179 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 89 [2018-11-12 17:11:33,388 WARN L179 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 89 [2018-11-12 17:11:33,391 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:11:33,392 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0)) [2018-11-12 17:11:33,392 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:11:33,392 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-12 17:11:33,392 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-12 17:11:33,392 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,392 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,392 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,393 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,393 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,393 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,393 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-12 17:11:33,393 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-12 17:11:33,393 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-12 17:11:33,393 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-12 17:11:33,393 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-12 17:11:33,393 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-12 17:11:33,394 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-12 17:11:33,394 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-12 17:11:33,394 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 437) no Hoare annotation was computed. [2018-11-12 17:11:33,394 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-12 17:11:33,394 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-12 17:11:33,394 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,394 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,395 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,395 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,395 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,395 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,395 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-12 17:11:33,395 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-12 17:11:33,395 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-12 17:11:33,395 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-12 17:11:33,396 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-12 17:11:33,396 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-12 17:11:33,396 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-12 17:11:33,396 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-12 17:11:33,396 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-12 17:11:33,396 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-12 17:11:33,396 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-12 17:11:33,396 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-12 17:11:33,397 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-12 17:11:33,397 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-12 17:11:33,397 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-11-12 17:11:33,397 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,397 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,397 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,397 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,397 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,397 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-12 17:11:33,398 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-12 17:11:33,398 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-12 17:11:33,398 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-12 17:11:33,398 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-12 17:11:33,398 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-12 17:11:33,398 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-12 17:11:33,398 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-12 17:11:33,398 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-12 17:11:33,399 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,399 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,399 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,399 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,399 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,399 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-12 17:11:33,399 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-12 17:11:33,399 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-12 17:11:33,399 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-12 17:11:33,400 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-12 17:11:33,400 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-12 17:11:33,400 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-12 17:11:33,400 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-12 17:11:33,400 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-12 17:11:33,400 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-12 17:11:33,400 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-12 17:11:33,400 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-12 17:11:33,400 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-12 17:11:33,401 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,401 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,401 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,401 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,401 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,401 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-12 17:11:33,401 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-12 17:11:33,401 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-12 17:11:33,401 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-12 17:11:33,402 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-12 17:11:33,402 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-12 17:11:33,402 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-12 17:11:33,402 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-12 17:11:33,402 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-12 17:11:33,402 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,402 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,402 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,402 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,403 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,403 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,403 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-12 17:11:33,403 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,403 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-12 17:11:33,403 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-12 17:11:33,403 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-12 17:11:33,403 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-12 17:11:33,403 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-12 17:11:33,404 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-12 17:11:33,404 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-12 17:11:33,404 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-12 17:11:33,404 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-12 17:11:33,404 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-12 17:11:33,404 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-12 17:11:33,404 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-12 17:11:33,404 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-12 17:11:33,404 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,405 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,405 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,405 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,405 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,405 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-12 17:11:33,405 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-12 17:11:33,405 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-12 17:11:33,405 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-12 17:11:33,405 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-12 17:11:33,405 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-12 17:11:33,406 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-12 17:11:33,406 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-12 17:11:33,406 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,406 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,406 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,406 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,406 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,406 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-12 17:11:33,406 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-12 17:11:33,407 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-12 17:11:33,407 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-12 17:11:33,407 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-12 17:11:33,407 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-12 17:11:33,407 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-12 17:11:33,407 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-12 17:11:33,407 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-12 17:11:33,407 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-12 17:11:33,408 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse26 (= ~a7~0 |old(~a7~0)|)) (.cse24 (= |old(~a8~0)| ~a8~0)) (.cse25 (= |old(~a20~0)| ~a20~0))) (let ((.cse20 (not (= 5 |old(~a16~0)|))) (.cse21 (= ~a16~0 5)) (.cse29 (not (= 4 |old(~a16~0)|))) (.cse31 (= ~a16~0 4)) (.cse13 (= 6 |old(~a16~0)|)) (.cse3 (< 6 |calculate_output_#in~input|)) (.cse9 (<= ~a16~0 5)) (.cse11 (<= 4 ~a16~0)) (.cse16 (< 1 |old(~a17~0)|)) (.cse19 (< |old(~a20~0)| 0)) (.cse7 (< 5 |old(~a16~0)|)) (.cse8 (< |old(~a16~0)| 4)) (.cse18 (< |old(~a17~0)| 0)) (.cse22 (< 0 |old(~a20~0)|)) (.cse12 (< |calculate_output_#in~input| 1)) (.cse27 (and .cse26 .cse24 .cse25)) (.cse1 (= 13 |old(~a8~0)|)) (.cse0 (= ~a17~0 1)) (.cse15 (< |old(~a20~0)| 1)) (.cse23 (not (= 1 |old(~a7~0)|))) (.cse2 (not (= 1 |old(~a17~0)|))) (.cse14 (not (= 0 |old(~a7~0)|))) (.cse4 (not (= 1 |old(~a21~0)|))) (.cse17 (not (= 15 |old(~a8~0)|))) (.cse28 (not (= 0 |old(~a17~0)|))) (.cse5 (not (= 8 ~a12~0))) (.cse6 (not (= 1 |old(~a20~0)|))) (.cse10 (= ~a21~0 1)) (.cse30 (= ~a17~0 0))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 (< 15 |old(~a8~0)|) .cse5 .cse2 .cse6 .cse7 .cse8 (< 1 |old(~a7~0)|) (< |old(~a8~0)| 13) (and .cse9 .cse10 .cse11) (< |old(~a7~0)| 0) .cse12) (or .cse13 (not (= ~a16~0 6))) (or .cse3 .cse14 .cse4 .cse15 .cse5 .cse16 .cse10 (< 1 |old(~a20~0)|) .cse17 .cse7 .cse8 .cse18 .cse12) (or .cse3 .cse14 .cse4 .cse5 .cse16 .cse19 .cse17 .cse20 .cse18 .cse21 .cse22 .cse12) (or .cse15 .cse23 (and (= 1 ~a7~0) .cse24 .cse25)) (or .cse6 .cse2 (and .cse26 .cse24 .cse25 .cse0)) (or .cse13 .cse27) (or .cse3 (and (or .cse14 .cse4 .cse20 .cse5 .cse2) (or .cse14 .cse4 .cse28 .cse29 .cse5)) .cse6 .cse17 (or (and .cse30 .cse31) (and .cse0 .cse21)) .cse12) (or .cse3 (or .cse4 .cse29 (not .cse1)) .cse5 .cse2 .cse6 .cse23 .cse12 .cse31) (or .cse13 .cse0 .cse2) (or .cse3 .cse14 .cse4 (and (<= 0 ~a17~0) .cse9 .cse10 (<= ~a17~0 1) .cse11) .cse5 .cse16 .cse19 .cse17 .cse7 .cse8 .cse18 .cse22 .cse12) (or .cse27 .cse1) (or .cse0 .cse15 .cse23 .cse2) (or (or .cse14 .cse4 (< 6 |old(~a16~0)|) (< |old(~a16~0)| 5) .cse17 .cse28 .cse5) .cse6 (and (<= 5 ~a16~0) .cse10 .cse30 (<= ~a16~0 6)))))) [2018-11-12 17:11:33,408 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-12 17:11:33,408 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,408 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,408 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,408 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,408 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-12 17:11:33,409 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,409 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,409 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-12 17:11:33,409 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-12 17:11:33,409 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-12 17:11:33,409 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-12 17:11:33,409 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-12 17:11:33,409 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-12 17:11:33,409 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-12 17:11:33,410 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-12 17:11:33,410 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-12 17:11:33,410 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-12 17:11:33,410 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-12 17:11:33,410 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-12 17:11:33,410 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,410 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,410 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,410 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,411 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,411 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-12 17:11:33,411 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,411 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-12 17:11:33,411 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-12 17:11:33,411 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-12 17:11:33,411 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-12 17:11:33,411 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-12 17:11:33,411 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-12 17:11:33,411 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-12 17:11:33,412 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-12 17:11:33,412 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-12 17:11:33,412 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-12 17:11:33,412 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-12 17:11:33,412 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-12 17:11:33,412 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-12 17:11:33,412 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-12 17:11:33,412 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,412 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,412 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,413 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,413 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,413 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:33,413 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-12 17:11:33,413 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-12 17:11:33,413 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-12 17:11:33,413 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-12 17:11:33,413 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-12 17:11:33,413 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-12 17:11:33,413 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-12 17:11:33,414 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-12 17:11:33,414 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-12 17:11:33,414 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-12 17:11:33,414 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:11:33,414 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-12 17:11:33,414 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:11:33,414 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:11:33,414 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (and (= ~a21~0 1) (= |old(~a8~0)| ~a8~0) (= ~a17~0 1) (= ~a7~0 |old(~a7~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-12 17:11:33,415 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:11:33,415 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (or (not (= ~a8~0 13)) (not (= ~a16~0 6)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and (= 1 ~a7~0) (<= 1 ~a20~0)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (and (= |old(~a20~0)| ~a20~0) (= ~a17~0 1)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))) [2018-11-12 17:11:33,415 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-12 17:11:33,415 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-12 17:11:33,415 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-12 17:11:33,415 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (or (not (= ~a8~0 13)) (not (= ~a16~0 6)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and (= 1 ~a7~0) (<= 1 ~a20~0)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (and (= |old(~a20~0)| ~a20~0) (= ~a17~0 1)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))) [2018-11-12 17:11:33,415 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:11:33,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:11:33 BoogieIcfgContainer [2018-11-12 17:11:33,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:11:33,430 INFO L168 Benchmark]: Toolchain (without parser) took 121225.64 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-12 17:11:33,431 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:11:33,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-12 17:11:33,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.65 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-12 17:11:33,433 INFO L168 Benchmark]: Boogie Preprocessor took 109.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-12 17:11:33,439 INFO L168 Benchmark]: RCFGBuilder took 3039.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 119.2 MB). Peak memory consumption was 119.2 MB. Max. memory is 7.1 GB. [2018-11-12 17:11:33,440 INFO L168 Benchmark]: TraceAbstraction took 117136.16 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 17:11:33,446 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 803.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 129.65 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3039.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 119.2 MB). Peak memory consumption was 119.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 117136.16 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 437]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(a8 == 13) || !(a16 == 6)) || !(\old(a21) == 1)) || !(b == 2)) || !(y == 25)) || (1 == a7 && 1 <= a20)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || (\old(a20) == a20 && a17 == 1)) || !(3 == c)) || !(\old(a20) == 1)) || !(23 == w)) || !(a == 1)) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 117.0s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 84.4s AutomataDifference, 0.0s DeadEndRemovalTime, 10.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1747 SDtfs, 10946 SDslu, 2829 SDs, 0 SdLazy, 16282 SolverSat, 2362 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.6s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 2692 GetRequests, 2471 SyntacticMatches, 14 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9333occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.7s AbstIntTime, 9 AbstIntIterations, 6 AbstIntStrong, 0.9972100526862959 AbsIntWeakeningRatio, 0.2035541195476575 AbsIntAvgWeakeningVarsNumRemoved, 27.517770597738288 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 635 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 392 PreInvPairs, 622 NumberOfFragments, 866 HoareAnnotationTreeSize, 392 FomulaSimplifications, 17341 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9824 FormulaSimplificationTreeSizeReductionInter, 9.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2738 NumberOfCodeBlocks, 2738 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3369 ConstructedInterpolants, 0 QuantifiedInterpolants, 1435050 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1813 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 2641/3047 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...