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/Problem02_label24_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 18:44:52,372 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 18:44:52,374 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 18:44:52,387 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 18:44:52,387 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 18:44:52,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 18:44:52,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 18:44:52,391 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 18:44:52,393 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 18:44:52,394 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 18:44:52,395 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 18:44:52,395 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 18:44:52,396 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 18:44:52,397 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 18:44:52,399 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 18:44:52,399 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 18:44:52,400 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 18:44:52,402 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 18:44:52,405 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 18:44:52,407 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 18:44:52,408 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 18:44:52,409 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 18:44:52,412 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 18:44:52,412 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 18:44:52,412 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 18:44:52,413 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 18:44:52,415 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 18:44:52,416 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 18:44:52,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 18:44:52,418 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 18:44:52,418 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 18:44:52,419 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 18:44:52,419 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 18:44:52,420 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 18:44:52,421 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 18:44:52,422 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 18:44:52,422 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-07 18:44:52,439 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 18:44:52,439 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 18:44:52,440 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 18:44:52,440 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 18:44:52,441 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 18:44:52,441 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 18:44:52,441 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 18:44:52,441 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 18:44:52,442 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 18:44:52,442 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 18:44:52,442 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 18:44:52,442 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 18:44:52,443 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 18:44:52,443 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 18:44:52,443 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 18:44:52,444 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 18:44:52,444 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 18:44:52,444 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 18:44:52,444 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 18:44:52,445 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 18:44:52,445 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 18:44:52,445 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 18:44:52,445 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 18:44:52,445 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 18:44:52,446 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 18:44:52,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:44:52,446 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 18:44:52,446 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 18:44:52,446 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 18:44:52,447 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 18:44:52,447 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 18:44:52,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 18:44:52,447 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 18:44:52,447 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 18:44:52,448 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 18:44:52,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 18:44:52,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 18:44:52,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 18:44:52,520 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 18:44:52,520 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 18:44:52,521 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c [2018-11-07 18:44:52,596 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5681a272/135c4c0d3e1a41e29defcbb042ab7032/FLAG973cea932 [2018-11-07 18:44:53,213 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 18:44:53,214 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c [2018-11-07 18:44:53,235 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5681a272/135c4c0d3e1a41e29defcbb042ab7032/FLAG973cea932 [2018-11-07 18:44:53,250 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5681a272/135c4c0d3e1a41e29defcbb042ab7032 [2018-11-07 18:44:53,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 18:44:53,263 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 18:44:53,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 18:44:53,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 18:44:53,270 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 18:44:53,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:44:53" (1/1) ... [2018-11-07 18:44:53,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d73b804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:53, skipping insertion in model container [2018-11-07 18:44:53,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:44:53" (1/1) ... [2018-11-07 18:44:53,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 18:44:53,344 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 18:44:53,844 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:44:53,849 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 18:44:53,951 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:44:53,972 INFO L193 MainTranslator]: Completed translation [2018-11-07 18:44:53,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:53 WrapperNode [2018-11-07 18:44:53,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 18:44:53,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 18:44:53,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 18:44:53,974 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 18:44:53,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:53" (1/1) ... [2018-11-07 18:44:54,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:53" (1/1) ... [2018-11-07 18:44:54,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 18:44:54,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 18:44:54,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 18:44:54,118 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 18:44:54,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:53" (1/1) ... [2018-11-07 18:44:54,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:53" (1/1) ... [2018-11-07 18:44:54,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:53" (1/1) ... [2018-11-07 18:44:54,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:53" (1/1) ... [2018-11-07 18:44:54,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:53" (1/1) ... [2018-11-07 18:44:54,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:53" (1/1) ... [2018-11-07 18:44:54,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:53" (1/1) ... [2018-11-07 18:44:54,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 18:44:54,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 18:44:54,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 18:44:54,219 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 18:44:54,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:53" (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-07 18:44:54,278 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 18:44:54,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 18:44:54,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 18:44:54,278 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 18:44:54,279 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 18:44:54,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 18:44:54,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 18:44:54,279 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 18:44:54,279 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 18:44:57,537 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 18:44:57,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:44:57 BoogieIcfgContainer [2018-11-07 18:44:57,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 18:44:57,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 18:44:57,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 18:44:57,546 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 18:44:57,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:44:53" (1/3) ... [2018-11-07 18:44:57,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bc7820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:44:57, skipping insertion in model container [2018-11-07 18:44:57,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:53" (2/3) ... [2018-11-07 18:44:57,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bc7820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:44:57, skipping insertion in model container [2018-11-07 18:44:57,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:44:57" (3/3) ... [2018-11-07 18:44:57,551 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label24_true-unreach-call_false-termination.c [2018-11-07 18:44:57,561 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 18:44:57,570 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 18:44:57,584 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 18:44:57,623 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 18:44:57,623 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 18:44:57,623 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 18:44:57,623 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 18:44:57,624 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 18:44:57,626 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 18:44:57,626 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 18:44:57,626 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 18:44:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 18:44:57,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 18:44:57,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:44:57,672 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:44:57,674 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:44:57,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:57,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1658764377, now seen corresponding path program 1 times [2018-11-07 18:44:57,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:44:57,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:57,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:57,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:57,736 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:44:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:58,377 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-07 18:44:58,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:44:58,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:44:58,380 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:44:58,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:44:58,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:44:58,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:44:58,405 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 18:45:00,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:45:00,220 INFO L93 Difference]: Finished difference Result 621 states and 1060 transitions. [2018-11-07 18:45:00,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:45:00,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-11-07 18:45:00,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:45:00,240 INFO L225 Difference]: With dead ends: 621 [2018-11-07 18:45:00,240 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 18:45:00,247 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-07 18:45:00,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 18:45:00,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-11-07 18:45:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 18:45:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 637 transitions. [2018-11-07 18:45:00,329 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 637 transitions. Word has length 121 [2018-11-07 18:45:00,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:45:00,330 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 637 transitions. [2018-11-07 18:45:00,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:45:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 637 transitions. [2018-11-07 18:45:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 18:45:00,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:45:00,340 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:45:00,340 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:45:00,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:45:00,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1422747334, now seen corresponding path program 1 times [2018-11-07 18:45:00,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:45:00,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:00,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:45:00,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:00,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:45:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:45:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:45:00,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:45:00,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:45:00,780 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:45:00,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:45:00,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:45:00,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:45:00,783 INFO L87 Difference]: Start difference. First operand 381 states and 637 transitions. Second operand 5 states. [2018-11-07 18:45:02,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:45:02,450 INFO L93 Difference]: Finished difference Result 901 states and 1555 transitions. [2018-11-07 18:45:02,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:45:02,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2018-11-07 18:45:02,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:45:02,456 INFO L225 Difference]: With dead ends: 901 [2018-11-07 18:45:02,457 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 18:45:02,463 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:45:02,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 18:45:02,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-07 18:45:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-07 18:45:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 632 transitions. [2018-11-07 18:45:02,490 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 632 transitions. Word has length 130 [2018-11-07 18:45:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:45:02,491 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 632 transitions. [2018-11-07 18:45:02,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:45:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 632 transitions. [2018-11-07 18:45:02,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 18:45:02,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:45:02,500 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:45:02,500 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:45:02,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:45:02,501 INFO L82 PathProgramCache]: Analyzing trace with hash -2099227971, now seen corresponding path program 1 times [2018-11-07 18:45:02,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:45:02,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:02,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:45:02,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:02,502 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:45:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:45:02,779 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:45:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:45:02,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:45:02,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:45:02,939 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:45:02,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:45:02,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:45:02,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:45:02,940 INFO L87 Difference]: Start difference. First operand 380 states and 632 transitions. Second operand 6 states. [2018-11-07 18:45:05,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:45:05,407 INFO L93 Difference]: Finished difference Result 1184 states and 2066 transitions. [2018-11-07 18:45:05,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:45:05,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-11-07 18:45:05,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:45:05,416 INFO L225 Difference]: With dead ends: 1184 [2018-11-07 18:45:05,416 INFO L226 Difference]: Without dead ends: 810 [2018-11-07 18:45:05,419 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:45:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-11-07 18:45:05,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 800. [2018-11-07 18:45:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-11-07 18:45:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1274 transitions. [2018-11-07 18:45:05,500 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1274 transitions. Word has length 155 [2018-11-07 18:45:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:45:05,501 INFO L480 AbstractCegarLoop]: Abstraction has 800 states and 1274 transitions. [2018-11-07 18:45:05,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:45:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1274 transitions. [2018-11-07 18:45:05,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-07 18:45:05,506 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:45:05,507 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:45:05,507 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:45:05,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:45:05,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1213735243, now seen corresponding path program 1 times [2018-11-07 18:45:05,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:45:05,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:05,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:45:05,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:05,509 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:45:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:45:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:45:05,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:45:05,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:45:05,707 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:45:05,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:45:05,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:45:05,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:45:05,709 INFO L87 Difference]: Start difference. First operand 800 states and 1274 transitions. Second operand 3 states. [2018-11-07 18:45:07,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:45:07,415 INFO L93 Difference]: Finished difference Result 2306 states and 3791 transitions. [2018-11-07 18:45:07,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:45:07,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2018-11-07 18:45:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:45:07,427 INFO L225 Difference]: With dead ends: 2306 [2018-11-07 18:45:07,427 INFO L226 Difference]: Without dead ends: 1512 [2018-11-07 18:45:07,432 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:45:07,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2018-11-07 18:45:07,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1507. [2018-11-07 18:45:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-07 18:45:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2312 transitions. [2018-11-07 18:45:07,486 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2312 transitions. Word has length 156 [2018-11-07 18:45:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:45:07,486 INFO L480 AbstractCegarLoop]: Abstraction has 1507 states and 2312 transitions. [2018-11-07 18:45:07,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:45:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2312 transitions. [2018-11-07 18:45:07,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-07 18:45:07,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:45:07,494 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:45:07,494 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:45:07,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:45:07,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1427113375, now seen corresponding path program 1 times [2018-11-07 18:45:07,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:45:07,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:07,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:45:07,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:07,496 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:45:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:45:07,941 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-11-07 18:45:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:45:08,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:45:08,002 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:45:08,003 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-11-07 18:45:08,005 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [198], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [639], [641], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:45:08,055 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:45:08,056 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:45:09,408 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:45:09,410 INFO L272 AbstractInterpreter]: Visited 124 different actions 244 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 18:45:09,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:45:09,445 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:45:10,619 INFO L227 lantSequenceWeakener]: Weakened 59 states. On average, predicates are now at 82.16% of their original sizes. [2018-11-07 18:45:10,619 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:45:13,456 INFO L415 sIntCurrentIteration]: We unified 172 AI predicates to 172 [2018-11-07 18:45:13,456 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:45:13,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:45:13,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-11-07 18:45:13,458 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:45:13,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 18:45:13,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 18:45:13,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-11-07 18:45:13,459 INFO L87 Difference]: Start difference. First operand 1507 states and 2312 transitions. Second operand 20 states. [2018-11-07 18:45:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:45:34,540 INFO L93 Difference]: Finished difference Result 3750 states and 5776 transitions. [2018-11-07 18:45:34,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 18:45:34,540 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 173 [2018-11-07 18:45:34,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:45:34,552 INFO L225 Difference]: With dead ends: 3750 [2018-11-07 18:45:34,552 INFO L226 Difference]: Without dead ends: 2249 [2018-11-07 18:45:34,559 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 186 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 18:45:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2018-11-07 18:45:34,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2237. [2018-11-07 18:45:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2237 states. [2018-11-07 18:45:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3111 transitions. [2018-11-07 18:45:34,627 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3111 transitions. Word has length 173 [2018-11-07 18:45:34,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:45:34,628 INFO L480 AbstractCegarLoop]: Abstraction has 2237 states and 3111 transitions. [2018-11-07 18:45:34,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 18:45:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3111 transitions. [2018-11-07 18:45:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-07 18:45:34,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:45:34,637 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:45:34,637 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:45:34,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:45:34,638 INFO L82 PathProgramCache]: Analyzing trace with hash 9233952, now seen corresponding path program 1 times [2018-11-07 18:45:34,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:45:34,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:34,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:45:34,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:34,639 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:45:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:45:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 18:45:34,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:45:34,864 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:45:34,864 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-11-07 18:45:34,865 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [198], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [639], [641], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:45:34,872 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:45:34,872 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:45:35,367 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:45:35,367 INFO L272 AbstractInterpreter]: Visited 125 different actions 373 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:45:35,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:45:35,402 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:45:36,118 INFO L227 lantSequenceWeakener]: Weakened 57 states. On average, predicates are now at 82.21% of their original sizes. [2018-11-07 18:45:36,118 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:45:36,855 INFO L415 sIntCurrentIteration]: We unified 182 AI predicates to 182 [2018-11-07 18:45:36,856 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:45:36,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:45:36,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 21 [2018-11-07 18:45:36,857 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:45:36,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 18:45:36,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 18:45:36,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-07 18:45:36,858 INFO L87 Difference]: Start difference. First operand 2237 states and 3111 transitions. Second operand 15 states. [2018-11-07 18:45:48,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:45:48,406 INFO L93 Difference]: Finished difference Result 4628 states and 6683 transitions. [2018-11-07 18:45:48,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 18:45:48,406 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 183 [2018-11-07 18:45:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:45:48,421 INFO L225 Difference]: With dead ends: 4628 [2018-11-07 18:45:48,421 INFO L226 Difference]: Without dead ends: 2833 [2018-11-07 18:45:48,428 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2018-11-07 18:45:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833 states. [2018-11-07 18:45:48,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833 to 2825. [2018-11-07 18:45:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2825 states. [2018-11-07 18:45:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3790 transitions. [2018-11-07 18:45:48,510 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3790 transitions. Word has length 183 [2018-11-07 18:45:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:45:48,510 INFO L480 AbstractCegarLoop]: Abstraction has 2825 states and 3790 transitions. [2018-11-07 18:45:48,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 18:45:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3790 transitions. [2018-11-07 18:45:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-07 18:45:48,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:45:48,522 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:45:48,523 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:45:48,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:45:48,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1466739305, now seen corresponding path program 1 times [2018-11-07 18:45:48,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:45:48,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:48,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:45:48,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:48,525 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:45:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:45:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:45:49,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:45:49,010 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:45:49,010 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-11-07 18:45:49,011 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [248], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [639], [641], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:45:49,015 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:45:49,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:45:49,775 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:45:49,775 INFO L272 AbstractInterpreter]: Visited 125 different actions 246 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 18:45:49,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:45:49,779 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:45:50,134 INFO L227 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 81.04% of their original sizes. [2018-11-07 18:45:50,134 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:45:50,462 INFO L415 sIntCurrentIteration]: We unified 195 AI predicates to 195 [2018-11-07 18:45:50,463 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:45:50,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:45:50,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 18:45:50,463 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:45:50,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 18:45:50,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 18:45:50,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:45:50,464 INFO L87 Difference]: Start difference. First operand 2825 states and 3790 transitions. Second operand 18 states. [2018-11-07 18:46:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:46:00,567 INFO L93 Difference]: Finished difference Result 5659 states and 7882 transitions. [2018-11-07 18:46:00,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 18:46:00,567 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 196 [2018-11-07 18:46:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:46:00,583 INFO L225 Difference]: With dead ends: 5659 [2018-11-07 18:46:00,583 INFO L226 Difference]: Without dead ends: 3570 [2018-11-07 18:46:00,590 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 210 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 18:46:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2018-11-07 18:46:00,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 3415. [2018-11-07 18:46:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2018-11-07 18:46:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 4521 transitions. [2018-11-07 18:46:00,683 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 4521 transitions. Word has length 196 [2018-11-07 18:46:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:46:00,684 INFO L480 AbstractCegarLoop]: Abstraction has 3415 states and 4521 transitions. [2018-11-07 18:46:00,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 18:46:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 4521 transitions. [2018-11-07 18:46:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-07 18:46:00,696 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:46:00,696 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 18:46:00,697 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:46:00,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:46:00,697 INFO L82 PathProgramCache]: Analyzing trace with hash -53175711, now seen corresponding path program 1 times [2018-11-07 18:46:00,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:46:00,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:46:00,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:46:00,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:46:00,699 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:46:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:46:00,855 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 18:46:00,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:46:00,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:46:00,856 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:46:00,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:46:00,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:46:00,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:46:00,857 INFO L87 Difference]: Start difference. First operand 3415 states and 4521 transitions. Second operand 3 states. [2018-11-07 18:46:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:46:01,843 INFO L93 Difference]: Finished difference Result 6239 states and 8375 transitions. [2018-11-07 18:46:01,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:46:01,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-11-07 18:46:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:46:01,855 INFO L225 Difference]: With dead ends: 6239 [2018-11-07 18:46:01,855 INFO L226 Difference]: Without dead ends: 3415 [2018-11-07 18:46:01,863 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:46:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3415 states. [2018-11-07 18:46:01,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3415 to 3415. [2018-11-07 18:46:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2018-11-07 18:46:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 4246 transitions. [2018-11-07 18:46:01,947 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 4246 transitions. Word has length 205 [2018-11-07 18:46:01,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:46:01,947 INFO L480 AbstractCegarLoop]: Abstraction has 3415 states and 4246 transitions. [2018-11-07 18:46:01,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:46:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 4246 transitions. [2018-11-07 18:46:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-07 18:46:01,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:46:01,960 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:46:01,960 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:46:01,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:46:01,960 INFO L82 PathProgramCache]: Analyzing trace with hash -923173500, now seen corresponding path program 1 times [2018-11-07 18:46:01,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:46:01,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:46:01,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:46:01,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:46:01,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:46:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:46:02,228 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:46:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 108 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:46:02,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:46:02,513 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:46:02,513 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-11-07 18:46:02,514 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [639], [641], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:46:02,518 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:46:02,518 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:46:03,151 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:46:03,151 INFO L272 AbstractInterpreter]: Visited 127 different actions 377 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:46:03,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:46:03,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:46:03,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:46:03,163 INFO L194 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-07 18:46:03,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:46:03,175 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:46:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:46:03,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:46:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 123 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 18:46:03,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:46:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 123 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 18:46:04,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:46:04,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-07 18:46:04,432 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:46:04,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 18:46:04,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 18:46:04,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-07 18:46:04,434 INFO L87 Difference]: Start difference. First operand 3415 states and 4246 transitions. Second operand 14 states. [2018-11-07 18:46:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:46:08,773 INFO L93 Difference]: Finished difference Result 8816 states and 11542 transitions. [2018-11-07 18:46:08,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 18:46:08,774 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 217 [2018-11-07 18:46:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:46:08,788 INFO L225 Difference]: With dead ends: 8816 [2018-11-07 18:46:08,788 INFO L226 Difference]: Without dead ends: 2856 [2018-11-07 18:46:08,822 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 448 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=449, Invalid=1273, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 18:46:08,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2018-11-07 18:46:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 2251. [2018-11-07 18:46:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2251 states. [2018-11-07 18:46:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 2624 transitions. [2018-11-07 18:46:08,903 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 2624 transitions. Word has length 217 [2018-11-07 18:46:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:46:08,903 INFO L480 AbstractCegarLoop]: Abstraction has 2251 states and 2624 transitions. [2018-11-07 18:46:08,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 18:46:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 2624 transitions. [2018-11-07 18:46:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-07 18:46:08,912 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:46:08,913 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:46:08,913 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:46:08,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:46:08,913 INFO L82 PathProgramCache]: Analyzing trace with hash -517292809, now seen corresponding path program 1 times [2018-11-07 18:46:08,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:46:08,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:46:08,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:46:08,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:46:08,915 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:46:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:46:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 152 proven. 71 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 18:46:09,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:46:09,861 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:46:09,861 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2018-11-07 18:46:09,862 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [67], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [248], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [639], [641], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:46:09,870 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:46:09,870 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:46:11,402 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:46:11,402 INFO L272 AbstractInterpreter]: Visited 127 different actions 512 times. Merged at 9 different actions 37 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:46:11,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:46:11,440 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:46:12,018 INFO L227 lantSequenceWeakener]: Weakened 251 states. On average, predicates are now at 80.87% of their original sizes. [2018-11-07 18:46:12,018 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:46:12,966 INFO L415 sIntCurrentIteration]: We unified 253 AI predicates to 253 [2018-11-07 18:46:12,966 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:46:12,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:46:12,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2018-11-07 18:46:12,967 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:46:12,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:46:12,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:46:12,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:46:12,968 INFO L87 Difference]: Start difference. First operand 2251 states and 2624 transitions. Second operand 11 states. [2018-11-07 18:46:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:46:21,112 INFO L93 Difference]: Finished difference Result 2571 states and 3054 transitions. [2018-11-07 18:46:21,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 18:46:21,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 254 [2018-11-07 18:46:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:46:21,114 INFO L225 Difference]: With dead ends: 2571 [2018-11-07 18:46:21,114 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 18:46:21,121 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 263 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-07 18:46:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 18:46:21,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 18:46:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 18:46:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 18:46:21,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 254 [2018-11-07 18:46:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:46:21,122 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 18:46:21,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:46:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 18:46:21,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 18:46:21,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 18:46:21,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:46:21,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:46:21,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:46:21,492 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 99 [2018-11-07 18:46:21,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:46:21,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:46:21,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:46:21,710 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 172 [2018-11-07 18:46:22,666 WARN L179 SmtUtils]: Spent 954.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-11-07 18:46:23,116 WARN L179 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 77 [2018-11-07 18:46:25,014 WARN L179 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 304 DAG size of output: 119 [2018-11-07 18:46:25,856 WARN L179 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 105 [2018-11-07 18:46:26,660 WARN L179 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 109 [2018-11-07 18:46:26,663 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:46:26,663 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a11~0)| ~a11~0) (= |old(~a28~0)| ~a28~0) (= |old(~a17~0)| ~a17~0)) [2018-11-07 18:46:26,663 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:46:26,663 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,664 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,664 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,664 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,664 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,664 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 18:46:26,664 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 18:46:26,664 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 18:46:26,664 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 18:46:26,664 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 18:46:26,665 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 18:46:26,665 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 18:46:26,665 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 18:46:26,665 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 18:46:26,665 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 18:46:26,665 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 18:46:26,665 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 18:46:26,666 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 18:46:26,666 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,666 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,666 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,666 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,666 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,666 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 18:46:26,666 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 18:46:26,667 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 18:46:26,667 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 18:46:26,667 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 18:46:26,667 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 18:46:26,667 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 18:46:26,667 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 18:46:26,667 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 18:46:26,667 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 18:46:26,668 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 18:46:26,668 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 18:46:26,668 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 18:46:26,668 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 18:46:26,668 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 18:46:26,668 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 18:46:26,668 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,668 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,669 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,669 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,669 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,669 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 18:46:26,669 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 18:46:26,669 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 18:46:26,669 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 18:46:26,669 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 18:46:26,670 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 18:46:26,670 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 18:46:26,670 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 18:46:26,670 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 18:46:26,670 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 18:46:26,670 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 18:46:26,670 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,670 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,671 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,671 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,671 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,671 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 18:46:26,671 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 18:46:26,671 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 18:46:26,671 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 18:46:26,671 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 18:46:26,672 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 18:46:26,672 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 18:46:26,672 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 18:46:26,672 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 18:46:26,672 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 18:46:26,672 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 18:46:26,672 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 18:46:26,672 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 18:46:26,673 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,673 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,673 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,673 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,673 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,673 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 18:46:26,673 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 18:46:26,673 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 18:46:26,674 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 18:46:26,674 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 18:46:26,674 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 18:46:26,674 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 18:46:26,674 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 514) no Hoare annotation was computed. [2018-11-07 18:46:26,674 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 18:46:26,674 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 18:46:26,674 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 18:46:26,675 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 18:46:26,675 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 18:46:26,675 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 18:46:26,675 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 18:46:26,675 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 18:46:26,675 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 18:46:26,675 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,675 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,675 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,675 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,675 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,675 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 18:46:26,675 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 18:46:26,676 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,676 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 18:46:26,676 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 18:46:26,676 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 18:46:26,676 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,676 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,676 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 18:46:26,676 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 18:46:26,676 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 18:46:26,676 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 18:46:26,676 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 18:46:26,677 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 18:46:26,677 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 18:46:26,677 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 18:46:26,677 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 18:46:26,677 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 18:46:26,677 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 18:46:26,677 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,677 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,677 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,677 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,677 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,678 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,678 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 18:46:26,678 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 18:46:26,678 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 18:46:26,678 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 18:46:26,678 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 18:46:26,678 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 18:46:26,678 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 18:46:26,678 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 18:46:26,678 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 18:46:26,678 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 18:46:26,678 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 18:46:26,679 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,679 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,679 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,679 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,679 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,679 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,679 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 18:46:26,679 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 18:46:26,679 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 18:46:26,680 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 18:46:26,680 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 18:46:26,680 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 18:46:26,680 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 18:46:26,680 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 18:46:26,680 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 18:46:26,680 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 18:46:26,680 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 18:46:26,680 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 18:46:26,681 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 18:46:26,681 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 18:46:26,681 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,681 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,681 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,681 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,682 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse10 (< (+ |old(~a19~0)| 1) 0)) (.cse30 (< 11 |old(~a28~0)|)) (.cse32 (< |old(~a25~0)| 0)) (.cse12 (< |old(~a28~0)| 7)) (.cse5 (not (= 1 ~a21~0))) (.cse31 (< |old(~a28~0)| 8)) (.cse13 (< 3 |old(~a19~0)|)) (.cse21 (< 1 |old(~a25~0)|)) (.cse22 (< 21 |old(~a28~0)|)) (.cse11 (not (= 0 |old(~a11~0)|))) (.cse7 (not (= 8 |old(~a17~0)|)))) (let ((.cse14 (<= ~a19~0 3)) (.cse15 (<= 0 (+ ~a25~0 1))) (.cse16 (<= ~a25~0 1)) (.cse18 (= ~a11~0 0)) (.cse19 (= ~a17~0 8)) (.cse20 (<= 0 (+ ~a19~0 1))) (.cse23 (< (+ |old(~a25~0)| 1) 0)) (.cse9 (not (= 1 |old(~a11~0)|))) (.cse26 (= 9 |old(~a17~0)|)) (.cse24 (= 1 ~a25~0)) (.cse6 (not (= 1 |old(~a25~0)|))) (.cse28 (= |old(~a11~0)| ~a11~0)) (.cse17 (= |old(~a28~0)| ~a28~0)) (.cse25 (= |old(~a17~0)| ~a17~0)) (.cse8 (= 9 |old(~a28~0)|)) (.cse29 (not (= 7 |old(~a17~0)|))) (.cse0 (< 6 |calculate_output_#in~input|)) (.cse27 (<= 0 ~a25~0)) (.cse2 (not (= 0 |old(~a25~0)|))) (.cse1 (not (= 1 |old(~a19~0)|))) (.cse3 (and (or (< 1 |old(~a19~0)|) .cse5 .cse10 .cse21 .cse11 .cse30 .cse7 .cse32 .cse12) (or .cse5 .cse31 .cse13 .cse21 .cse22 .cse11 .cse7 (< |old(~a19~0)| 0)))) (.cse4 (< |calculate_output_#in~input| 1))) (and (or (or .cse0 (< 10 |old(~a28~0)|) .cse1 .cse2) (= ~a25~0 0) .cse3 .cse4) (or .cse5 .cse6 .cse1 .cse7 (= 1 ~a19~0) (not .cse8) .cse9) (or .cse0 .cse5 .cse10 .cse11 .cse8 .cse12 .cse13 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse21 .cse22 .cse7 .cse4 .cse23) (or .cse0 .cse5 .cse6 .cse10 .cse11 .cse12 .cse13 .cse22 .cse24 .cse7 .cse4) (or .cse5 (and .cse17 (= 1 ~a11~0) .cse25) .cse9 .cse26) (or .cse0 (and .cse14 .cse15 (or (and (<= 0 ~a19~0) .cse16 (<= 8 ~a28~0)) (and (<= ~a28~0 11) .cse27 (<= ~a19~0 1) .cse16)) .cse17 .cse18 .cse19 .cse20) .cse3 .cse4 .cse23) (or .cse5 .cse6 .cse24 .cse9 .cse26) (or .cse5 (and .cse28 .cse17 .cse25 .cse24) .cse6 .cse29) (or .cse5 (and .cse28 .cse17 .cse25) .cse8 .cse29) (or .cse0 (and .cse27 (= ~a19~0 1)) (and (or .cse30 .cse2) (or .cse31 .cse30)) .cse32 .cse1 .cse3 .cse4)))) [2018-11-07 18:46:26,682 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,682 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,682 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 18:46:26,682 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 18:46:26,683 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 18:46:26,683 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 18:46:26,683 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 18:46:26,683 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 18:46:26,683 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 18:46:26,683 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 18:46:26,683 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 18:46:26,683 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 18:46:26,683 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 18:46:26,683 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 18:46:26,683 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 18:46:26,684 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,684 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,684 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,684 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,684 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,684 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,684 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 18:46:26,684 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 18:46:26,684 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 18:46:26,684 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 18:46:26,684 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 18:46:26,684 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 18:46:26,684 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 18:46:26,685 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 18:46:26,685 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 18:46:26,685 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 18:46:26,685 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 18:46:26,685 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 18:46:26,685 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 18:46:26,685 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 18:46:26,685 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 18:46:26,686 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 18:46:26,686 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,686 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,686 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,686 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,686 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:46:26,686 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 18:46:26,686 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 18:46:26,687 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 18:46:26,687 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 18:46:26,687 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 18:46:26,687 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 18:46:26,687 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 18:46:26,687 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 18:46:26,687 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 18:46:26,687 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 18:46:26,687 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 18:46:26,688 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 18:46:26,688 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 18:46:26,688 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 18:46:26,688 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 18:46:26,688 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 18:46:26,688 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 18:46:26,688 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 18:46:26,688 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 18:46:26,688 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:46:26,689 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-07 18:46:26,689 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 18:46:26,689 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:46:26,689 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a19~0 1) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 18:46:26,689 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 18:46:26,690 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (= 1 ~a11~0)) (.cse1 (= 7 ~a17~0)) (.cse11 (not (= ~a28~0 9))) (.cse4 (<= 1 main_~input~0)) (.cse5 (<= main_~input~0 6)) (.cse10 (<= ~a28~0 21)) (.cse6 (<= ~a19~0 3)) (.cse7 (<= 0 (+ ~a25~0 1))) (.cse2 (= ~a11~0 0)) (.cse3 (= ~a17~0 8)) (.cse8 (<= 7 ~a28~0)) (.cse9 (<= ~a25~0 1)) (.cse12 (<= 0 (+ ~a19~0 1)))) (or (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse1 (= 1 ~a25~0)) (and .cse2 (= ~a25~0 0) .cse3 (= ~a19~0 1) (= ~a28~0 7)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse2 .cse10 .cse3 .cse11 .cse12) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (and .cse0 (= |old(~a17~0)| ~a17~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse0 .cse1 .cse11) (not (= 3 ~c~0)) (and .cse4 .cse5 (or (and .cse2 (<= 0 ~a19~0) .cse10 .cse6 .cse3 .cse7 .cse9 (<= 8 ~a28~0)) (and (<= ~a28~0 11) (<= 0 ~a25~0) .cse2 (<= ~a19~0 1) .cse3 .cse8 .cse9)) .cse12) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-07 18:46:26,690 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 18:46:26,690 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 18:46:26,690 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (= 1 ~a11~0)) (.cse1 (= 7 ~a17~0)) (.cse11 (not (= ~a28~0 9))) (.cse2 (<= 1 main_~input~0)) (.cse3 (<= main_~input~0 6)) (.cse9 (<= ~a28~0 21)) (.cse4 (<= ~a19~0 3)) (.cse5 (<= 0 (+ ~a25~0 1))) (.cse8 (= ~a11~0 0)) (.cse10 (= ~a17~0 8)) (.cse6 (<= 7 ~a28~0)) (.cse7 (<= ~a25~0 1)) (.cse12 (<= 0 (+ ~a19~0 1)))) (or (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse1 (= 1 ~a25~0)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (and .cse0 (= |old(~a17~0)| ~a17~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse0 .cse1 .cse11) (not (= 3 ~c~0)) (and .cse2 .cse3 (or (and .cse8 (<= 0 ~a19~0) .cse9 .cse4 .cse10 .cse5 .cse7 (<= 8 ~a28~0)) (and (<= ~a28~0 11) (<= 0 ~a25~0) .cse8 (<= ~a19~0 1) .cse10 .cse6 .cse7)) .cse12) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-07 18:46:26,691 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 18:46:26,691 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 18:46:26,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:46:26 BoogieIcfgContainer [2018-11-07 18:46:26,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 18:46:26,706 INFO L168 Benchmark]: Toolchain (without parser) took 93444.24 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -515.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-07 18:46:26,708 INFO L168 Benchmark]: CDTParser took 0.21 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-07 18:46:26,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.98 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-07 18:46:26,709 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -833.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-07 18:46:26,710 INFO L168 Benchmark]: Boogie Preprocessor took 101.23 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2018-11-07 18:46:26,712 INFO L168 Benchmark]: RCFGBuilder took 3319.98 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: 102.0 MB). Peak memory consumption was 102.0 MB. Max. memory is 7.1 GB. [2018-11-07 18:46:26,713 INFO L168 Benchmark]: TraceAbstraction took 89165.50 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 180.9 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-07 18:46:26,722 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.21 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 708.98 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 143.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -833.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 101.23 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3319.98 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: 102.0 MB). Peak memory consumption was 102.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89165.50 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 180.9 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 514]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(a21 == 1) || !(y == 25)) || ((1 == a11 && 7 == a17) && 1 == a25)) || ((((a11 == 0 && a25 == 0) && a17 == 8) && a19 == 1) && a28 == 7)) || ((((((((((1 <= input && input <= 6) && a19 <= 3) && 0 <= a25 + 1) && 7 <= a28) && a25 <= 1) && a11 == 0) && a28 <= 21) && a17 == 8) && !(a28 == 9)) && 0 <= a19 + 1)) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || (1 == a11 && \old(a17) == a17)) || !(22 == v)) || !(\old(a11) == 0)) || !(z == 26)) || !(0 == \old(a25))) || ((1 == a11 && 7 == a17) && !(a28 == 9))) || !(3 == c)) || (((1 <= input && input <= 6) && ((((((((a11 == 0 && 0 <= a19) && a28 <= 21) && a19 <= 3) && a17 == 8) && 0 <= a25 + 1) && a25 <= 1) && 8 <= a28) || ((((((a28 <= 11 && 0 <= a25) && a11 == 0) && a19 <= 1) && a17 == 8) && 7 <= a28) && a25 <= 1))) && 0 <= a19 + 1)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 89.0s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 64.0s AutomataDifference, 0.0s DeadEndRemovalTime, 5.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1910 SDtfs, 11379 SDslu, 1589 SDs, 0 SdLazy, 11697 SolverSat, 2625 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.3s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1371 GetRequests, 1208 SyntacticMatches, 5 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3415occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.9s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9975713412232402 AbsIntWeakeningRatio, 0.17206982543640897 AbsIntAvgWeakeningVarsNumRemoved, 20.512468827930174 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 796 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 123 PreInvPairs, 210 NumberOfFragments, 1151 HoareAnnotationTreeSize, 123 FomulaSimplifications, 15765 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9079 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2007 NumberOfCodeBlocks, 2007 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2212 ConstructedInterpolants, 0 QuantifiedInterpolants, 1247482 SizeOfPredicates, 1 NumberOfNonLiveVariables, 525 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 893/1009 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...