java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:08:50,323 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:08:50,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:08:50,342 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:08:50,342 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:08:50,343 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:08:50,345 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:08:50,347 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:08:50,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:08:50,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:08:50,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:08:50,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:08:50,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:08:50,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:08:50,357 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:08:50,364 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:08:50,365 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:08:50,370 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:08:50,372 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:08:50,376 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:08:50,377 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:08:50,378 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:08:50,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:08:50,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:08:50,380 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:08:50,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:08:50,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:08:50,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:08:50,384 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:08:50,385 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:08:50,385 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:08:50,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:08:50,386 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:08:50,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:08:50,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:08:50,387 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:08:50,388 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:08:50,412 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:08:50,412 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:08:50,413 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:08:50,413 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:08:50,413 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:08:50,414 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:08:50,414 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:08:50,414 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:08:50,414 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:08:50,414 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:08:50,415 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:08:50,415 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:08:50,415 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:08:50,415 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:08:50,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:08:50,416 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:08:50,416 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:08:50,416 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:08:50,417 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:08:50,417 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:08:50,417 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:08:50,417 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:08:50,417 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:08:50,417 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:08:50,418 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:08:50,418 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:08:50,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:08:50,418 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:08:50,418 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:08:50,418 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:08:50,419 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:08:50,419 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:08:50,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:08:50,419 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:08:50,419 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:08:50,420 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:08:50,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:08:50,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:08:50,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:08:50,495 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:08:50,495 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:08:50,496 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.c [2018-10-25 00:08:50,567 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c0b8e4a8d/7348449e7303404a8097e23eb9711d9b/FLAGa364906e3 [2018-10-25 00:08:51,189 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:08:51,191 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.c [2018-10-25 00:08:51,202 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c0b8e4a8d/7348449e7303404a8097e23eb9711d9b/FLAGa364906e3 [2018-10-25 00:08:51,218 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c0b8e4a8d/7348449e7303404a8097e23eb9711d9b [2018-10-25 00:08:51,229 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:08:51,230 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:08:51,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:08:51,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:08:51,235 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:08:51,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:08:51" (1/1) ... [2018-10-25 00:08:51,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c0d0dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:51, skipping insertion in model container [2018-10-25 00:08:51,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:08:51" (1/1) ... [2018-10-25 00:08:51,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:08:51,303 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:08:51,741 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:08:51,749 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:08:51,857 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:08:51,878 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:08:51,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:51 WrapperNode [2018-10-25 00:08:51,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:08:51,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:08:51,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:08:51,880 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:08:51,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:51" (1/1) ... [2018-10-25 00:08:51,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:51" (1/1) ... [2018-10-25 00:08:52,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:08:52,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:08:52,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:08:52,083 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:08:52,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:51" (1/1) ... [2018-10-25 00:08:52,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:51" (1/1) ... [2018-10-25 00:08:52,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:51" (1/1) ... [2018-10-25 00:08:52,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:51" (1/1) ... [2018-10-25 00:08:52,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:51" (1/1) ... [2018-10-25 00:08:52,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:51" (1/1) ... [2018-10-25 00:08:52,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:51" (1/1) ... [2018-10-25 00:08:52,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:08:52,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:08:52,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:08:52,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:08:52,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:08:52,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:08:52,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:08:52,236 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:08:52,236 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:08:52,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:08:52,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:08:52,237 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:08:52,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:08:55,535 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:08:55,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:08:55 BoogieIcfgContainer [2018-10-25 00:08:55,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:08:55,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:08:55,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:08:55,541 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:08:55,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:08:51" (1/3) ... [2018-10-25 00:08:55,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e8e15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:08:55, skipping insertion in model container [2018-10-25 00:08:55,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:51" (2/3) ... [2018-10-25 00:08:55,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e8e15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:08:55, skipping insertion in model container [2018-10-25 00:08:55,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:08:55" (3/3) ... [2018-10-25 00:08:55,552 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label56_true-unreach-call_false-termination.c [2018-10-25 00:08:55,562 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:08:55,571 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:08:55,589 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:08:55,627 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:08:55,627 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:08:55,627 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:08:55,627 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:08:55,628 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:08:55,629 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:08:55,629 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:08:55,629 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:08:55,656 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:08:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-25 00:08:55,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:55,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:55,676 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:55,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:55,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1901339872, now seen corresponding path program 1 times [2018-10-25 00:08:55,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:55,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:55,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:55,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:55,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:56,375 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:08:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:56,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:56,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:08:56,537 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:56,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:08:56,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:08:56,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:08:56,566 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:08:57,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:57,978 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-25 00:08:57,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:08:57,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2018-10-25 00:08:57,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:58,001 INFO L225 Difference]: With dead ends: 621 [2018-10-25 00:08:58,002 INFO L226 Difference]: Without dead ends: 382 [2018-10-25 00:08:58,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:08:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-25 00:08:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-25 00:08:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-25 00:08:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-25 00:08:58,087 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 130 [2018-10-25 00:08:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:58,089 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-25 00:08:58,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:08:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-25 00:08:58,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-25 00:08:58,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:58,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:58,097 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:58,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:58,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1819679469, now seen corresponding path program 1 times [2018-10-25 00:08:58,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:58,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:58,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:58,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:58,100 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:58,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:58,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:58,564 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:58,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:58,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:58,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:58,567 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-25 00:09:00,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:00,027 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-25 00:09:00,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:09:00,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-10-25 00:09:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:00,033 INFO L225 Difference]: With dead ends: 903 [2018-10-25 00:09:00,033 INFO L226 Difference]: Without dead ends: 381 [2018-10-25 00:09:00,039 INFO L605 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-10-25 00:09:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-25 00:09:00,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-25 00:09:00,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-25 00:09:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-25 00:09:00,067 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 139 [2018-10-25 00:09:00,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:00,068 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-25 00:09:00,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:09:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-25 00:09:00,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-25 00:09:00,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:00,072 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:09:00,072 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:00,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:00,073 INFO L82 PathProgramCache]: Analyzing trace with hash 484067553, now seen corresponding path program 1 times [2018-10-25 00:09:00,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:00,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:00,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:00,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:00,075 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:00,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:09:00,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:09:00,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:09:00,544 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:09:00,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:09:00,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:09:00,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:09:00,546 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-25 00:09:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:02,306 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-25 00:09:02,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:09:02,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-10-25 00:09:02,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:02,316 INFO L225 Difference]: With dead ends: 901 [2018-10-25 00:09:02,317 INFO L226 Difference]: Without dead ends: 380 [2018-10-25 00:09:02,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:09:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-25 00:09:02,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-25 00:09:02,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-25 00:09:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-25 00:09:02,339 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 145 [2018-10-25 00:09:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:02,339 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-25 00:09:02,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:09:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-25 00:09:02,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-25 00:09:02,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:02,342 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:09:02,343 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:02,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:02,343 INFO L82 PathProgramCache]: Analyzing trace with hash 191966186, now seen corresponding path program 1 times [2018-10-25 00:09:02,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:02,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:02,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:02,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:02,345 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:02,581 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:09:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:09:02,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:09:02,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:09:02,699 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:09:02,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:09:02,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:09:02,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:09:02,700 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-25 00:09:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:05,092 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-25 00:09:05,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:09:05,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2018-10-25 00:09:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:05,098 INFO L225 Difference]: With dead ends: 1193 [2018-10-25 00:09:05,098 INFO L226 Difference]: Without dead ends: 819 [2018-10-25 00:09:05,100 INFO L605 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-10-25 00:09:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-25 00:09:05,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-25 00:09:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-25 00:09:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-25 00:09:05,138 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 153 [2018-10-25 00:09:05,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:05,138 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-25 00:09:05,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:09:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-25 00:09:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-25 00:09:05,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:05,142 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:09:05,143 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:05,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:05,146 INFO L82 PathProgramCache]: Analyzing trace with hash -684578330, now seen corresponding path program 1 times [2018-10-25 00:09:05,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:05,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:05,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:05,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:05,147 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:09:05,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:09:05,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:09:05,419 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:09:05,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:09:05,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:09:05,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:09:05,420 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-25 00:09:06,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:06,531 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-25 00:09:06,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:09:06,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-10-25 00:09:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:06,539 INFO L225 Difference]: With dead ends: 1753 [2018-10-25 00:09:06,539 INFO L226 Difference]: Without dead ends: 804 [2018-10-25 00:09:06,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:09:06,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-25 00:09:06,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-25 00:09:06,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-25 00:09:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-25 00:09:06,576 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 155 [2018-10-25 00:09:06,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:06,576 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-25 00:09:06,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:09:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-25 00:09:06,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-25 00:09:06,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:06,581 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:09:06,581 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:06,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:06,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1228371938, now seen corresponding path program 1 times [2018-10-25 00:09:06,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:06,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:06,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:06,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:06,583 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:09:06,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:09:06,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:09:06,878 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:09:06,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:09:06,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:09:06,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:09:06,879 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-25 00:09:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:07,885 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-25 00:09:07,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:09:07,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2018-10-25 00:09:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:07,898 INFO L225 Difference]: With dead ends: 1747 [2018-10-25 00:09:07,898 INFO L226 Difference]: Without dead ends: 801 [2018-10-25 00:09:07,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:09:07,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-25 00:09:07,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-25 00:09:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-25 00:09:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-25 00:09:07,925 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 157 [2018-10-25 00:09:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:07,926 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-25 00:09:07,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:09:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-25 00:09:07,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-25 00:09:07,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:07,930 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:09:07,930 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:07,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:07,930 INFO L82 PathProgramCache]: Analyzing trace with hash -977337382, now seen corresponding path program 1 times [2018-10-25 00:09:07,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:07,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:07,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:07,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:07,932 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:09:08,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:09:08,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:09:08,099 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:09:08,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:09:08,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:09:08,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:09:08,100 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-25 00:09:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:10,104 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-25 00:09:10,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:09:10,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2018-10-25 00:09:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:10,114 INFO L225 Difference]: With dead ends: 2381 [2018-10-25 00:09:10,114 INFO L226 Difference]: Without dead ends: 1586 [2018-10-25 00:09:10,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:09:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-25 00:09:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-25 00:09:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-25 00:09:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-25 00:09:10,164 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 161 [2018-10-25 00:09:10,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:10,165 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-25 00:09:10,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:09:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-25 00:09:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-25 00:09:10,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:10,171 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:09:10,171 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:10,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:10,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1994030385, now seen corresponding path program 1 times [2018-10-25 00:09:10,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:10,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:10,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:10,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:10,173 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:09:10,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:10,420 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:09:10,421 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2018-10-25 00:09:10,423 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], [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], [643], [651], [659], [667], [675], [683], [691], [699], [707], [711], [713], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:09:10,484 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:09:10,485 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:09:12,255 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:09:12,257 INFO L272 AbstractInterpreter]: Visited 135 different actions 400 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:09:12,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:12,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:09:12,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:12,302 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:09:12,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:12,314 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:09:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:12,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:09:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:09:12,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:09:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:09:13,031 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:09:13,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-25 00:09:13,031 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:09:13,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:09:13,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:09:13,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:09:13,032 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-10-25 00:09:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:14,829 INFO L93 Difference]: Finished difference Result 4406 states and 6474 transitions. [2018-10-25 00:09:14,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:09:14,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2018-10-25 00:09:14,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:14,838 INFO L225 Difference]: With dead ends: 4406 [2018-10-25 00:09:14,838 INFO L226 Difference]: Without dead ends: 1398 [2018-10-25 00:09:14,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 334 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:09:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2018-10-25 00:09:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1396. [2018-10-25 00:09:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2018-10-25 00:09:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1807 transitions. [2018-10-25 00:09:14,905 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1807 transitions. Word has length 167 [2018-10-25 00:09:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:14,905 INFO L481 AbstractCegarLoop]: Abstraction has 1396 states and 1807 transitions. [2018-10-25 00:09:14,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:09:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1807 transitions. [2018-10-25 00:09:14,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-25 00:09:14,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:14,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:09:14,912 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:14,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:14,913 INFO L82 PathProgramCache]: Analyzing trace with hash -396743574, now seen corresponding path program 1 times [2018-10-25 00:09:14,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:14,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:14,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:14,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:14,914 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:09:15,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:15,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:09:15,170 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-10-25 00:09:15,171 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], [202], [205], [209], [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], [643], [651], [659], [667], [675], [683], [691], [699], [707], [711], [713], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:09:15,177 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:09:15,177 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:09:15,686 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:09:15,686 INFO L272 AbstractInterpreter]: Visited 134 different actions 262 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-25 00:09:15,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:15,724 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:09:16,775 INFO L232 lantSequenceWeakener]: Weakened 194 states. On average, predicates are now at 81.06% of their original sizes. [2018-10-25 00:09:16,776 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:09:18,854 INFO L413 sIntCurrentIteration]: We have 198 unified AI predicates [2018-10-25 00:09:18,854 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:09:18,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:09:18,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:09:18,855 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:09:18,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:09:18,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:09:18,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:09:18,857 INFO L87 Difference]: Start difference. First operand 1396 states and 1807 transitions. Second operand 10 states. [2018-10-25 00:09:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:29,503 INFO L93 Difference]: Finished difference Result 3747 states and 4838 transitions. [2018-10-25 00:09:29,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 00:09:29,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2018-10-25 00:09:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:29,513 INFO L225 Difference]: With dead ends: 3747 [2018-10-25 00:09:29,513 INFO L226 Difference]: Without dead ends: 2357 [2018-10-25 00:09:29,517 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 70 SyntacticMatches, 120 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:09:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2018-10-25 00:09:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2350. [2018-10-25 00:09:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2018-10-25 00:09:29,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 2908 transitions. [2018-10-25 00:09:29,575 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 2908 transitions. Word has length 199 [2018-10-25 00:09:29,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:29,575 INFO L481 AbstractCegarLoop]: Abstraction has 2350 states and 2908 transitions. [2018-10-25 00:09:29,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:09:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 2908 transitions. [2018-10-25 00:09:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-25 00:09:29,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:29,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:09:29,584 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:29,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:29,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1370846630, now seen corresponding path program 1 times [2018-10-25 00:09:29,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:29,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:29,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:29,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:29,586 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:09:29,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:09:29,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 00:09:29,815 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:09:29,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 00:09:29,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 00:09:29,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 00:09:29,816 INFO L87 Difference]: Start difference. First operand 2350 states and 2908 transitions. Second operand 4 states. [2018-10-25 00:09:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:30,746 INFO L93 Difference]: Finished difference Result 5284 states and 6585 transitions. [2018-10-25 00:09:30,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:09:30,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2018-10-25 00:09:30,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:30,748 INFO L225 Difference]: With dead ends: 5284 [2018-10-25 00:09:30,748 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:09:30,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 00:09:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:09:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:09:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:09:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:09:30,761 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2018-10-25 00:09:30,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:30,761 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:09:30,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 00:09:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:09:30,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:09:30,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:09:30,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:30,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:30,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:30,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:30,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:30,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:30,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:30,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:31,688 WARN L179 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 74 [2018-10-25 00:09:31,897 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2018-10-25 00:09:32,114 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 38 [2018-10-25 00:09:32,116 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:09:32,117 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= |old(~a25~0)| ~a25~0)) [2018-10-25 00:09:32,117 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:09:32,117 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,117 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,117 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,117 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,117 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,118 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:09:32,118 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:09:32,118 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:09:32,118 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:09:32,118 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:09:32,118 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:09:32,118 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:09:32,118 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:09:32,119 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:09:32,119 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:09:32,119 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:09:32,119 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:09:32,119 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:09:32,119 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,119 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,119 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,120 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,120 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:09:32,120 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,120 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:09:32,120 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:09:32,120 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:09:32,120 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:09:32,120 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:09:32,120 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:09:32,120 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:09:32,120 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:09:32,121 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:09:32,121 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:09:32,121 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:09:32,121 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:09:32,121 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:09:32,121 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:09:32,121 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:09:32,121 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,121 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,122 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,122 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,122 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,122 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:09:32,122 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:09:32,122 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:09:32,122 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:09:32,122 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:09:32,123 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:09:32,123 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:09:32,123 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:09:32,123 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:09:32,123 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:09:32,123 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:09:32,123 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,124 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,124 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,124 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,124 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,124 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:09:32,124 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:09:32,124 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:09:32,124 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:09:32,124 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:09:32,125 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:09:32,125 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:09:32,125 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:09:32,125 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:09:32,125 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:09:32,125 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:09:32,125 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:09:32,126 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:09:32,126 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,126 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,126 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,126 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,126 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,126 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:09:32,127 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:09:32,127 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:09:32,127 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:09:32,127 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:09:32,127 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:09:32,127 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:09:32,127 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:09:32,127 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:09:32,128 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:09:32,128 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:09:32,128 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:09:32,128 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:09:32,128 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:09:32,128 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:09:32,128 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:09:32,128 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,128 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,129 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,129 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,129 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:09:32,129 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,129 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:09:32,129 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,129 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:09:32,130 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:09:32,130 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:09:32,130 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,130 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,130 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 541) no Hoare annotation was computed. [2018-10-25 00:09:32,130 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:09:32,131 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:09:32,131 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:09:32,131 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:09:32,131 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:09:32,131 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:09:32,131 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:09:32,131 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:09:32,131 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:09:32,132 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:09:32,132 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:09:32,132 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,132 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,132 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,132 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,132 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,132 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,133 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:09:32,133 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:09:32,133 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:09:32,133 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:09:32,133 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:09:32,133 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:09:32,133 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:09:32,133 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:09:32,134 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:09:32,134 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:09:32,134 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:09:32,134 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,134 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,134 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,134 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,134 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,135 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,135 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:09:32,135 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:09:32,135 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:09:32,135 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:09:32,135 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:09:32,135 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:09:32,135 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:09:32,135 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:09:32,136 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:09:32,136 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:09:32,136 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:09:32,136 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:09:32,136 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:09:32,136 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:09:32,136 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,136 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,136 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,137 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse15 (= |old(~a28~0)| ~a28~0)) (.cse11 (= |old(~a25~0)| ~a25~0)) (.cse12 (= 1 |old(~a11~0)|)) (.cse13 (= 1 |old(~a19~0)|)) (.cse14 (= 1 |old(~a25~0)|))) (let ((.cse9 (= 10 |old(~a28~0)|)) (.cse3 (not (= 7 |old(~a28~0)|))) (.cse4 (not .cse14)) (.cse1 (not .cse13)) (.cse2 (not (= 8 |old(~a17~0)|))) (.cse6 (= 1 ~a11~0)) (.cse10 (= 8 ~a17~0)) (.cse7 (= 1 ~a19~0)) (.cse5 (not .cse12)) (.cse8 (and .cse15 .cse11)) (.cse0 (not (= 1 ~a21~0)))) (and (or (or .cse0 .cse1 (= 0 |old(~a28~0)|) (not (= 0 |old(~a11~0)|)) .cse2 (= |calculate_output_#in~input| 0)) (and (= ~a11~0 0) (= ~a17~0 8) (= ~a19~0 1))) (or .cse0 .cse3 .cse4 .cse1 .cse5 (and .cse6 (= 7 ~a17~0) .cse7) (not (= 7 |old(~a17~0)|))) (or .cse0 .cse8 .cse9) (or (and .cse6 .cse10 .cse7 .cse11 (= 10 ~a28~0)) .cse0 (not .cse9) .cse4 .cse1 .cse2 .cse5) (or .cse0 .cse12 (not (= ~a11~0 1))) (or .cse13 .cse0 .cse3 .cse2 (and .cse6 .cse10 (not .cse7)) .cse5 .cse14) (or .cse0 .cse4 .cse1 .cse2 (and .cse6 .cse10 .cse7) (not (= 9 |old(~a28~0)|)) .cse5) (or .cse0 .cse12 .cse8) (or .cse0 (and .cse15 (<= ~a17~0 7) .cse11) (< 7 |old(~a17~0)|))))) [2018-10-25 00:09:32,137 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,137 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,137 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,137 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:09:32,138 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:09:32,138 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:09:32,138 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:09:32,138 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:09:32,138 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:09:32,138 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:09:32,138 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:09:32,138 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:09:32,138 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:09:32,138 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:09:32,138 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:09:32,139 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:09:32,139 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,139 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,139 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,139 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,139 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,139 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,139 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:09:32,139 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:09:32,139 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:09:32,139 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:09:32,139 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:09:32,139 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:09:32,140 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:09:32,140 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:09:32,140 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:09:32,140 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:09:32,140 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:09:32,140 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:09:32,140 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:09:32,140 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:09:32,140 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:09:32,140 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:09:32,141 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,141 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,141 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,141 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,141 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:32,141 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:09:32,141 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:09:32,141 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:09:32,141 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:09:32,141 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:09:32,142 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:09:32,142 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:09:32,142 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:09:32,142 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:09:32,142 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:09:32,142 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:09:32,142 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:09:32,142 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:09:32,142 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:09:32,142 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:09:32,142 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:09:32,142 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:09:32,143 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:09:32,143 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:09:32,143 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:09:32,143 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-10-25 00:09:32,143 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:09:32,143 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:09:32,143 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (= ~a11~0 0) (= ~a17~0 8) (= |old(~a25~0)| ~a25~0) (= ~a19~0 1) (= ~a28~0 7)) (not (= 1 |old(~a19~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-10-25 00:09:32,143 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:09:32,143 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 10 ~a28~0)) (not (= ~a11~0 1)) (not (= 0 |old(~a11~0)|)) (<= ~a17~0 7) (not (= 1 |old(~a19~0)|)) (and (= 1 ~a25~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-10-25 00:09:32,143 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:09:32,144 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:09:32,144 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 10 ~a28~0)) (not (= ~a11~0 1)) (not (= 0 |old(~a11~0)|)) (<= ~a17~0 7) (not (= 1 |old(~a19~0)|)) (and (= 1 ~a25~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-10-25 00:09:32,144 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:09:32,144 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:09:32,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:09:32 BoogieIcfgContainer [2018-10-25 00:09:32,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:09:32,157 INFO L168 Benchmark]: Toolchain (without parser) took 40927.66 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -590.4 MB). Peak memory consumption was 617.6 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:32,158 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:09:32,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:32,160 INFO L168 Benchmark]: Boogie Procedure Inliner took 203.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -818.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:32,161 INFO L168 Benchmark]: Boogie Preprocessor took 74.15 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:32,161 INFO L168 Benchmark]: RCFGBuilder took 3379.09 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: 103.3 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:32,162 INFO L168 Benchmark]: TraceAbstraction took 36618.81 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 478.2 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 79.1 MB). Peak memory consumption was 557.2 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:32,167 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.25 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 647.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 203.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -818.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.15 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3379.09 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: 103.3 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36618.81 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 478.2 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 79.1 MB). Peak memory consumption was 557.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((!(1 == a21) || !(7 == \old(a28))) || !(10 == a28)) || !(a11 == 1)) || !(0 == \old(a11))) || a17 <= 7) || !(1 == \old(a19))) || ((1 == a25 && 8 == a17) && 1 == a19)) || !(8 == \old(a17))) || !(0 == \old(a25)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 36.5s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 24.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1398 SDtfs, 5044 SDslu, 992 SDs, 0 SdLazy, 7710 SolverSat, 1391 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 613 GetRequests, 429 SyntacticMatches, 129 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2350occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.4s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9978905121061985 AbsIntWeakeningRatio, 0.18181818181818182 AbsIntAvgWeakeningVarsNumRemoved, 0.12626262626262627 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 49 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 85 PreInvPairs, 145 NumberOfFragments, 401 HoareAnnotationTreeSize, 85 FomulaSimplifications, 2721 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2066 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1787 NumberOfCodeBlocks, 1787 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1942 ConstructedInterpolants, 0 QuantifiedInterpolants, 1674018 SizeOfPredicates, 2 NumberOfNonLiveVariables, 424 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 393/414 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...