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/Problem01_label08_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:00:48,403 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:00:48,405 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:00:48,419 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:00:48,420 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:00:48,421 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:00:48,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:00:48,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:00:48,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:00:48,434 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:00:48,435 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:00:48,435 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:00:48,436 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:00:48,437 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:00:48,439 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:00:48,439 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:00:48,440 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:00:48,445 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:00:48,451 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:00:48,454 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:00:48,455 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:00:48,456 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:00:48,459 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:00:48,460 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:00:48,462 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:00:48,463 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:00:48,464 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:00:48,465 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:00:48,467 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:00:48,468 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:00:48,468 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:00:48,469 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:00:48,469 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:00:48,470 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:00:48,470 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:00:48,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:00:48,473 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:00:48,500 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:00:48,500 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:00:48,501 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:00:48,501 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:00:48,501 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:00:48,501 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:00:48,502 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:00:48,503 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:00:48,503 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:00:48,503 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:00:48,503 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:00:48,503 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:00:48,504 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:00:48,504 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:00:48,505 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:00:48,505 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:00:48,505 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:00:48,505 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:00:48,505 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:00:48,505 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:00:48,506 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:00:48,506 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:00:48,506 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:00:48,506 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:00:48,506 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:00:48,507 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:00:48,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:00:48,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:00:48,508 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:00:48,508 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:00:48,508 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:00:48,508 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:00:48,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:00:48,510 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:00:48,510 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:00:48,510 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:00:48,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:00:48,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:00:48,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:00:48,586 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:00:48,586 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:00:48,587 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label08_true-unreach-call_false-termination.c [2018-10-25 00:00:48,651 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4760efeb7/e13f9cf31a814aa6841515058517397a/FLAG0f66433f8 [2018-10-25 00:00:49,250 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:00:49,251 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label08_true-unreach-call_false-termination.c [2018-10-25 00:00:49,265 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4760efeb7/e13f9cf31a814aa6841515058517397a/FLAG0f66433f8 [2018-10-25 00:00:49,284 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4760efeb7/e13f9cf31a814aa6841515058517397a [2018-10-25 00:00:49,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:00:49,297 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:00:49,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:00:49,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:00:49,304 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:00:49,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:00:49" (1/1) ... [2018-10-25 00:00:49,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68109397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:49, skipping insertion in model container [2018-10-25 00:00:49,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:00:49" (1/1) ... [2018-10-25 00:00:49,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:00:49,382 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:00:49,853 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:00:49,862 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:00:49,996 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:00:50,016 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:00:50,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:50 WrapperNode [2018-10-25 00:00:50,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:00:50,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:00:50,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:00:50,019 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:00:50,029 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:00:50" (1/1) ... [2018-10-25 00:00:50,049 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:00:50" (1/1) ... [2018-10-25 00:00:50,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:00:50,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:00:50,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:00:50,211 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:00:50,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:50" (1/1) ... [2018-10-25 00:00:50,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:50" (1/1) ... [2018-10-25 00:00:50,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:50" (1/1) ... [2018-10-25 00:00:50,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:50" (1/1) ... [2018-10-25 00:00:50,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:50" (1/1) ... [2018-10-25 00:00:50,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:50" (1/1) ... [2018-10-25 00:00:50,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:50" (1/1) ... [2018-10-25 00:00:50,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:00:50,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:00:50,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:00:50,325 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:00:50,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:50" (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:00:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:00:50,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:00:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:00:50,398 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:00:50,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:00:50,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:00:50,399 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:00:50,399 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:00:53,869 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:00:53,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:00:53 BoogieIcfgContainer [2018-10-25 00:00:53,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:00:53,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:00:53,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:00:53,874 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:00:53,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:00:49" (1/3) ... [2018-10-25 00:00:53,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b16a889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:00:53, skipping insertion in model container [2018-10-25 00:00:53,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:50" (2/3) ... [2018-10-25 00:00:53,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b16a889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:00:53, skipping insertion in model container [2018-10-25 00:00:53,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:00:53" (3/3) ... [2018-10-25 00:00:53,879 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label08_true-unreach-call_false-termination.c [2018-10-25 00:00:53,889 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:00:53,898 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:00:53,916 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:00:53,955 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:00:53,956 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:00:53,956 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:00:53,956 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:00:53,956 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:00:53,957 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:00:53,957 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:00:53,957 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:00:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-25 00:00:53,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-25 00:00:53,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:00:53,998 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] [2018-10-25 00:00:54,000 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:00:54,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:00:54,006 INFO L82 PathProgramCache]: Analyzing trace with hash -682702232, now seen corresponding path program 1 times [2018-10-25 00:00:54,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:00:54,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:00:54,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:00:54,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:00:54,058 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:00:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:00:54,696 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:00:54,859 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:00:54,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:00:54,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:00:54,863 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:00:54,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:00:54,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:00:54,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:00:54,891 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-25 00:00:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:00:56,271 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-25 00:00:56,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:00:56,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-10-25 00:00:56,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:00:56,301 INFO L225 Difference]: With dead ends: 550 [2018-10-25 00:00:56,302 INFO L226 Difference]: Without dead ends: 340 [2018-10-25 00:00:56,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:00:56,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-25 00:00:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-25 00:00:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-25 00:00:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 553 transitions. [2018-10-25 00:00:56,381 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 553 transitions. Word has length 120 [2018-10-25 00:00:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:00:56,382 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 553 transitions. [2018-10-25 00:00:56,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:00:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 553 transitions. [2018-10-25 00:00:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-25 00:00:56,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:00:56,389 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-25 00:00:56,390 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:00:56,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:00:56,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1009333063, now seen corresponding path program 1 times [2018-10-25 00:00:56,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:00:56,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:00:56,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:00:56,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:00:56,393 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:00:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:00:56,620 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:00:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:00:56,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:00:56,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:00:56,754 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:00:56,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:00:56,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:00:56,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:00:56,757 INFO L87 Difference]: Start difference. First operand 340 states and 553 transitions. Second operand 6 states. [2018-10-25 00:00:59,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:00:59,071 INFO L93 Difference]: Finished difference Result 1075 states and 1835 transitions. [2018-10-25 00:00:59,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:00:59,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-10-25 00:00:59,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:00:59,084 INFO L225 Difference]: With dead ends: 1075 [2018-10-25 00:00:59,085 INFO L226 Difference]: Without dead ends: 741 [2018-10-25 00:00:59,091 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:00:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-10-25 00:00:59,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-10-25 00:00:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-25 00:00:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1145 transitions. [2018-10-25 00:00:59,150 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1145 transitions. Word has length 131 [2018-10-25 00:00:59,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:00:59,152 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1145 transitions. [2018-10-25 00:00:59,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:00:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1145 transitions. [2018-10-25 00:00:59,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-25 00:00:59,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:00:59,163 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-25 00:00:59,163 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:00:59,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:00:59,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1121563035, now seen corresponding path program 1 times [2018-10-25 00:00:59,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:00:59,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:00:59,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:00:59,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:00:59,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:00:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:00:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:00:59,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:00:59,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:00:59,664 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:00:59,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:00:59,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:00:59,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:00:59,665 INFO L87 Difference]: Start difference. First operand 724 states and 1145 transitions. Second operand 5 states. [2018-10-25 00:01:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:01,881 INFO L93 Difference]: Finished difference Result 1578 states and 2533 transitions. [2018-10-25 00:01:01,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:01:01,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-10-25 00:01:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:01,892 INFO L225 Difference]: With dead ends: 1578 [2018-10-25 00:01:01,893 INFO L226 Difference]: Without dead ends: 721 [2018-10-25 00:01:01,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 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:01:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-10-25 00:01:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-10-25 00:01:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-10-25 00:01:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1069 transitions. [2018-10-25 00:01:01,955 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1069 transitions. Word has length 132 [2018-10-25 00:01:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:01,955 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 1069 transitions. [2018-10-25 00:01:01,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:01:01,955 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1069 transitions. [2018-10-25 00:01:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-25 00:01:01,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:01,959 INFO L375 BasicCegarLoop]: trace histogram [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:01:01,959 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:01,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:01,960 INFO L82 PathProgramCache]: Analyzing trace with hash 915740739, now seen corresponding path program 1 times [2018-10-25 00:01:01,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:01,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:01,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:01,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:01,961 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:02,608 WARN L179 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-25 00:01:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:01:02,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:01:02,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:01:02,738 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:02,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:01:02,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:01:02,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:01:02,740 INFO L87 Difference]: Start difference. First operand 721 states and 1069 transitions. Second operand 5 states. [2018-10-25 00:01:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:03,891 INFO L93 Difference]: Finished difference Result 1572 states and 2365 transitions. [2018-10-25 00:01:03,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:01:03,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-10-25 00:01:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:03,899 INFO L225 Difference]: With dead ends: 1572 [2018-10-25 00:01:03,899 INFO L226 Difference]: Without dead ends: 720 [2018-10-25 00:01:03,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:01:03,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-10-25 00:01:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2018-10-25 00:01:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-10-25 00:01:03,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1062 transitions. [2018-10-25 00:01:03,934 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1062 transitions. Word has length 133 [2018-10-25 00:01:03,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:03,934 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 1062 transitions. [2018-10-25 00:01:03,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:01:03,935 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1062 transitions. [2018-10-25 00:01:03,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-25 00:01:03,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:03,938 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-25 00:01:03,938 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:03,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:03,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1024180077, now seen corresponding path program 1 times [2018-10-25 00:01:03,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:03,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:03,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:03,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:03,940 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:01:04,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:01:04,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:01:04,091 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:04,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:01:04,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:01:04,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:01:04,093 INFO L87 Difference]: Start difference. First operand 720 states and 1062 transitions. Second operand 3 states. [2018-10-25 00:01:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:04,741 INFO L93 Difference]: Finished difference Result 1882 states and 2820 transitions. [2018-10-25 00:01:04,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:01:04,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-10-25 00:01:04,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:04,756 INFO L225 Difference]: With dead ends: 1882 [2018-10-25 00:01:04,756 INFO L226 Difference]: Without dead ends: 1168 [2018-10-25 00:01:04,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:01:04,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-10-25 00:01:04,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1164. [2018-10-25 00:01:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-10-25 00:01:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1592 transitions. [2018-10-25 00:01:04,796 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1592 transitions. Word has length 136 [2018-10-25 00:01:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:04,797 INFO L481 AbstractCegarLoop]: Abstraction has 1164 states and 1592 transitions. [2018-10-25 00:01:04,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:01:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1592 transitions. [2018-10-25 00:01:04,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-25 00:01:04,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:04,804 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:04,804 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:04,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:04,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1336149662, now seen corresponding path program 1 times [2018-10-25 00:01:04,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:04,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:04,806 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:01:05,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:05,063 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:01:05,064 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 169 with the following transitions: [2018-10-25 00:01:05,066 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [597], [599], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:01:05,119 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:01:05,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:01:05,812 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:01:05,814 INFO L272 AbstractInterpreter]: Visited 121 different actions 121 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-25 00:01:05,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:05,856 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:01:06,425 INFO L232 lantSequenceWeakener]: Weakened 159 states. On average, predicates are now at 80.46% of their original sizes. [2018-10-25 00:01:06,426 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:01:06,530 INFO L413 sIntCurrentIteration]: We have 167 unified AI predicates [2018-10-25 00:01:06,530 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:01:06,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:01:06,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 00:01:06,532 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:06,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:01:06,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:01:06,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:01:06,533 INFO L87 Difference]: Start difference. First operand 1164 states and 1592 transitions. Second operand 6 states. [2018-10-25 00:01:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:12,934 INFO L93 Difference]: Finished difference Result 2460 states and 3350 transitions. [2018-10-25 00:01:12,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 00:01:12,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2018-10-25 00:01:12,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:12,941 INFO L225 Difference]: With dead ends: 2460 [2018-10-25 00:01:12,941 INFO L226 Difference]: Without dead ends: 1302 [2018-10-25 00:01:12,945 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:01:12,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2018-10-25 00:01:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1300. [2018-10-25 00:01:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-10-25 00:01:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1734 transitions. [2018-10-25 00:01:12,980 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1734 transitions. Word has length 168 [2018-10-25 00:01:12,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:12,980 INFO L481 AbstractCegarLoop]: Abstraction has 1300 states and 1734 transitions. [2018-10-25 00:01:12,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:01:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1734 transitions. [2018-10-25 00:01:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-25 00:01:12,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:12,987 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:01:12,988 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:12,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:12,988 INFO L82 PathProgramCache]: Analyzing trace with hash 213477505, now seen corresponding path program 1 times [2018-10-25 00:01:12,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:12,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:12,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:12,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:12,990 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:01:13,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:13,301 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:01:13,301 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-10-25 00:01:13,302 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [597], [599], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:01:13,307 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:01:13,308 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:01:13,737 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:01:13,737 INFO L272 AbstractInterpreter]: Visited 125 different actions 244 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:01:13,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:13,777 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:01:14,720 INFO L232 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 80.54% of their original sizes. [2018-10-25 00:01:14,721 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:01:15,354 INFO L413 sIntCurrentIteration]: We have 176 unified AI predicates [2018-10-25 00:01:15,354 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:01:15,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:01:15,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:01:15,355 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:15,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:01:15,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:01:15,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:01:15,358 INFO L87 Difference]: Start difference. First operand 1300 states and 1734 transitions. Second operand 10 states. [2018-10-25 00:01:23,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:23,528 INFO L93 Difference]: Finished difference Result 2599 states and 3521 transitions. [2018-10-25 00:01:23,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:01:23,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2018-10-25 00:01:23,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:23,536 INFO L225 Difference]: With dead ends: 2599 [2018-10-25 00:01:23,536 INFO L226 Difference]: Without dead ends: 1441 [2018-10-25 00:01:23,540 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 184 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:01:23,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2018-10-25 00:01:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1438. [2018-10-25 00:01:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-10-25 00:01:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1882 transitions. [2018-10-25 00:01:23,578 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1882 transitions. Word has length 177 [2018-10-25 00:01:23,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:23,578 INFO L481 AbstractCegarLoop]: Abstraction has 1438 states and 1882 transitions. [2018-10-25 00:01:23,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:01:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1882 transitions. [2018-10-25 00:01:23,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-25 00:01:23,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:23,585 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:01:23,586 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:23,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:23,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1364345835, now seen corresponding path program 1 times [2018-10-25 00:01:23,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:23,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:23,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:23,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:23,588 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-25 00:01:23,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:23,816 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:01:23,817 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-10-25 00:01:23,817 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [597], [599], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:01:23,822 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:01:23,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:01:24,275 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:01:24,275 INFO L272 AbstractInterpreter]: Visited 125 different actions 244 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:01:24,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:24,312 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:01:25,289 INFO L232 lantSequenceWeakener]: Weakened 146 states. On average, predicates are now at 80.75% of their original sizes. [2018-10-25 00:01:25,289 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:01:28,716 INFO L413 sIntCurrentIteration]: We have 209 unified AI predicates [2018-10-25 00:01:28,717 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:01:28,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:01:28,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:01:28,717 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:28,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:01:28,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:01:28,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:01:28,719 INFO L87 Difference]: Start difference. First operand 1438 states and 1882 transitions. Second operand 15 states. [2018-10-25 00:01:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:41,738 INFO L93 Difference]: Finished difference Result 3065 states and 4058 transitions. [2018-10-25 00:01:41,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:01:41,738 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 210 [2018-10-25 00:01:41,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:41,748 INFO L225 Difference]: With dead ends: 3065 [2018-10-25 00:01:41,748 INFO L226 Difference]: Without dead ends: 1907 [2018-10-25 00:01:41,753 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 72 SyntacticMatches, 124 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:01:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2018-10-25 00:01:41,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1760. [2018-10-25 00:01:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1760 states. [2018-10-25 00:01:41,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2226 transitions. [2018-10-25 00:01:41,804 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2226 transitions. Word has length 210 [2018-10-25 00:01:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:41,804 INFO L481 AbstractCegarLoop]: Abstraction has 1760 states and 2226 transitions. [2018-10-25 00:01:41,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:01:41,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2226 transitions. [2018-10-25 00:01:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-25 00:01:41,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:41,813 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:01:41,813 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:41,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:41,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1434391096, now seen corresponding path program 1 times [2018-10-25 00:01:41,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:41,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:41,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:41,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:41,815 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-25 00:01:42,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:42,046 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:01:42,046 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-10-25 00:01:42,046 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [597], [599], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:01:42,051 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:01:42,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:01:43,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:01:43,548 INFO L272 AbstractInterpreter]: Visited 127 different actions 513 times. Merged at 9 different actions 41 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:01:43,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:43,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:01:43,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:43,559 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:01:43,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:43,572 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:01:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:43,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:01:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-25 00:01:44,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:01:44,364 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 00:01:45,027 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-25 00:01:45,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:01:45,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-25 00:01:45,050 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:01:45,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:01:45,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:01:45,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:01:45,051 INFO L87 Difference]: Start difference. First operand 1760 states and 2226 transitions. Second operand 11 states. [2018-10-25 00:01:47,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:47,620 INFO L93 Difference]: Finished difference Result 3634 states and 4754 transitions. [2018-10-25 00:01:47,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:01:47,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 219 [2018-10-25 00:01:47,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:47,629 INFO L225 Difference]: With dead ends: 3634 [2018-10-25 00:01:47,630 INFO L226 Difference]: Without dead ends: 2338 [2018-10-25 00:01:47,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 439 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:01:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2018-10-25 00:01:47,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2330. [2018-10-25 00:01:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2330 states. [2018-10-25 00:01:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 2908 transitions. [2018-10-25 00:01:47,696 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 2908 transitions. Word has length 219 [2018-10-25 00:01:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:47,697 INFO L481 AbstractCegarLoop]: Abstraction has 2330 states and 2908 transitions. [2018-10-25 00:01:47,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:01:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 2908 transitions. [2018-10-25 00:01:47,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-25 00:01:47,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:47,707 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:01:47,707 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:47,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:47,707 INFO L82 PathProgramCache]: Analyzing trace with hash 49211626, now seen corresponding path program 2 times [2018-10-25 00:01:47,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:47,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:47,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:47,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:47,709 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 54 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-25 00:01:48,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:48,670 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:01:48,670 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 00:01:48,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 00:01:48,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:48,670 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:01:48,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-25 00:01:48,678 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-25 00:01:48,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-25 00:01:48,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 00:01:48,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:01:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-25 00:01:48,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:01:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-25 00:01:49,150 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:01:49,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-25 00:01:49,151 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:49,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:01:49,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:01:49,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:01:49,153 INFO L87 Difference]: Start difference. First operand 2330 states and 2908 transitions. Second operand 3 states. [2018-10-25 00:01:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:50,344 INFO L93 Difference]: Finished difference Result 4608 states and 6017 transitions. [2018-10-25 00:01:50,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:01:50,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-25 00:01:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:50,356 INFO L225 Difference]: With dead ends: 4608 [2018-10-25 00:01:50,356 INFO L226 Difference]: Without dead ends: 2880 [2018-10-25 00:01:50,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:01:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2018-10-25 00:01:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2744. [2018-10-25 00:01:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2744 states. [2018-10-25 00:01:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 3371 transitions. [2018-10-25 00:01:50,434 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 3371 transitions. Word has length 219 [2018-10-25 00:01:50,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:50,435 INFO L481 AbstractCegarLoop]: Abstraction has 2744 states and 3371 transitions. [2018-10-25 00:01:50,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:01:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 3371 transitions. [2018-10-25 00:01:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-25 00:01:50,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:50,445 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:01:50,446 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:50,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:50,446 INFO L82 PathProgramCache]: Analyzing trace with hash 725737755, now seen corresponding path program 1 times [2018-10-25 00:01:50,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:50,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:50,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-25 00:01:50,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:50,447 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 107 proven. 49 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 00:01:50,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:50,646 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:01:50,646 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-10-25 00:01:50,646 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [205], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [597], [599], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:01:50,652 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:01:50,652 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:01:52,132 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:01:52,133 INFO L272 AbstractInterpreter]: Visited 125 different actions 505 times. Merged at 8 different actions 38 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:01:52,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:52,172 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:01:55,593 INFO L232 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 82.5% of their original sizes. [2018-10-25 00:01:55,593 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:02,664 INFO L413 sIntCurrentIteration]: We have 229 unified AI predicates [2018-10-25 00:02:02,664 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:02,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:02,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2018-10-25 00:02:02,665 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:02,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:02:02,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:02:02,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:02:02,666 INFO L87 Difference]: Start difference. First operand 2744 states and 3371 transitions. Second operand 12 states. [2018-10-25 00:02:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:18,790 INFO L93 Difference]: Finished difference Result 7256 states and 9285 transitions. [2018-10-25 00:02:18,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 00:02:18,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 230 [2018-10-25 00:02:18,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:18,809 INFO L225 Difference]: With dead ends: 7256 [2018-10-25 00:02:18,809 INFO L226 Difference]: Without dead ends: 5114 [2018-10-25 00:02:18,816 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 235 GetRequests, 33 SyntacticMatches, 186 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:02:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5114 states. [2018-10-25 00:02:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5114 to 5092. [2018-10-25 00:02:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5092 states. [2018-10-25 00:02:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5092 states to 5092 states and 6119 transitions. [2018-10-25 00:02:18,959 INFO L78 Accepts]: Start accepts. Automaton has 5092 states and 6119 transitions. Word has length 230 [2018-10-25 00:02:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:18,960 INFO L481 AbstractCegarLoop]: Abstraction has 5092 states and 6119 transitions. [2018-10-25 00:02:18,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:02:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 5092 states and 6119 transitions. [2018-10-25 00:02:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-25 00:02:18,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:18,981 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:02:18,981 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:18,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:18,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1447497907, now seen corresponding path program 1 times [2018-10-25 00:02:18,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:18,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:18,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:18,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:18,983 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 148 proven. 84 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-25 00:02:19,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:19,802 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:19,802 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2018-10-25 00:02:19,803 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [205], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [597], [599], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:19,805 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:19,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:20,938 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:20,938 INFO L272 AbstractInterpreter]: Visited 128 different actions 523 times. Merged at 10 different actions 47 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:02:20,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:20,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:20,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:20,943 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:02:20,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:20,952 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:21,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 155 proven. 2 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-10-25 00:02:21,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 154 proven. 20 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-25 00:02:21,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:02:21,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-25 00:02:21,324 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:02:21,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:02:21,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:02:21,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-10-25 00:02:21,325 INFO L87 Difference]: Start difference. First operand 5092 states and 6119 transitions. Second operand 12 states. [2018-10-25 00:02:21,955 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-25 00:02:26,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:26,963 INFO L93 Difference]: Finished difference Result 18494 states and 24016 transitions. [2018-10-25 00:02:26,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-25 00:02:26,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 267 [2018-10-25 00:02:26,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:27,029 INFO L225 Difference]: With dead ends: 18494 [2018-10-25 00:02:27,030 INFO L226 Difference]: Without dead ends: 13682 [2018-10-25 00:02:27,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 565 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352 [2018-10-25 00:02:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13682 states. [2018-10-25 00:02:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13682 to 13055. [2018-10-25 00:02:27,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13055 states. [2018-10-25 00:02:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13055 states to 13055 states and 16080 transitions. [2018-10-25 00:02:27,511 INFO L78 Accepts]: Start accepts. Automaton has 13055 states and 16080 transitions. Word has length 267 [2018-10-25 00:02:27,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:27,512 INFO L481 AbstractCegarLoop]: Abstraction has 13055 states and 16080 transitions. [2018-10-25 00:02:27,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:02:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 13055 states and 16080 transitions. [2018-10-25 00:02:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-25 00:02:27,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:27,576 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:02:27,576 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:27,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:27,577 INFO L82 PathProgramCache]: Analyzing trace with hash -773602765, now seen corresponding path program 1 times [2018-10-25 00:02:27,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:27,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:27,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:27,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:27,578 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 175 proven. 101 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-25 00:02:27,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:27,859 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:27,859 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 277 with the following transitions: [2018-10-25 00:02:27,859 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [205], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [597], [599], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:27,862 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:27,862 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:29,233 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:29,233 INFO L272 AbstractInterpreter]: Visited 128 different actions 648 times. Merged at 10 different actions 56 times. Widened at 1 different actions 7 times. Found 11 fixpoints after 4 different actions. Largest state had 42 variables. [2018-10-25 00:02:29,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:29,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:29,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:29,238 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:02:29,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:29,246 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:29,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 245 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-25 00:02:29,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 245 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-25 00:02:29,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:02:29,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-25 00:02:29,819 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:02:29,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:02:29,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:02:29,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:02:29,821 INFO L87 Difference]: Start difference. First operand 13055 states and 16080 transitions. Second operand 9 states. [2018-10-25 00:02:33,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:33,553 INFO L93 Difference]: Finished difference Result 31821 states and 43246 transitions. [2018-10-25 00:02:33,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-25 00:02:33,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 276 [2018-10-25 00:02:33,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:33,554 INFO L225 Difference]: With dead ends: 31821 [2018-10-25 00:02:33,554 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:02:33,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:02:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:02:33,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:02:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:02:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:02:33,673 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 276 [2018-10-25 00:02:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:33,673 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:02:33,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:02:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:02:33,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:02:33,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:02:34,015 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2018-10-25 00:02:39,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:39,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:40,573 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 112 [2018-10-25 00:02:40,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:41,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:41,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:41,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:41,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:42,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:43,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:44,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:44,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:45,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:45,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:47,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:47,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:47,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:48,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:48,756 WARN L179 SmtUtils]: Spent 7.99 s on a formula simplification. DAG size of input: 640 DAG size of output: 561 [2018-10-25 00:02:49,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:49,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:49,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:50,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:50,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:50,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:52,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:52,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:52,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:53,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:53,450 WARN L179 SmtUtils]: Spent 4.69 s on a formula simplification. DAG size of input: 628 DAG size of output: 555 [2018-10-25 00:02:53,564 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-10-25 00:02:53,917 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 86 [2018-10-25 00:02:58,178 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 482 DAG size of output: 155 [2018-10-25 00:03:05,819 WARN L179 SmtUtils]: Spent 7.63 s on a formula simplification. DAG size of input: 581 DAG size of output: 114 [2018-10-25 00:03:13,140 WARN L179 SmtUtils]: Spent 7.31 s on a formula simplification. DAG size of input: 578 DAG size of output: 114 [2018-10-25 00:03:13,143 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:03:13,143 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a20~0)| ~a20~0) (= ~a17~0 |old(~a17~0)|) (= |old(~a16~0)| ~a16~0)) [2018-10-25 00:03:13,143 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:03:13,143 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-25 00:03:13,144 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-25 00:03:13,144 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,144 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,144 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,144 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,144 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,144 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,145 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-25 00:03:13,145 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-25 00:03:13,145 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-25 00:03:13,145 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-25 00:03:13,145 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-25 00:03:13,145 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-25 00:03:13,145 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-25 00:03:13,145 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-25 00:03:13,145 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-25 00:03:13,145 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-25 00:03:13,146 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,146 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,146 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,146 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,146 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,146 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,146 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-25 00:03:13,146 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-25 00:03:13,146 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-25 00:03:13,147 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-25 00:03:13,147 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-25 00:03:13,147 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-25 00:03:13,147 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-25 00:03:13,147 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-25 00:03:13,147 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-25 00:03:13,147 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-25 00:03:13,147 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-25 00:03:13,147 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-25 00:03:13,148 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-25 00:03:13,148 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-25 00:03:13,148 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-25 00:03:13,148 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,148 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,148 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,148 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,148 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,148 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-25 00:03:13,149 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-25 00:03:13,149 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-25 00:03:13,149 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-25 00:03:13,149 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-25 00:03:13,149 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-25 00:03:13,149 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-25 00:03:13,149 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-25 00:03:13,149 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-25 00:03:13,150 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,150 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,150 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,150 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,150 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,150 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-25 00:03:13,150 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-25 00:03:13,150 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-25 00:03:13,150 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-25 00:03:13,150 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-25 00:03:13,151 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-25 00:03:13,151 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-25 00:03:13,151 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-25 00:03:13,151 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-25 00:03:13,151 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-25 00:03:13,151 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-25 00:03:13,151 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-25 00:03:13,151 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-25 00:03:13,152 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,152 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,152 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,152 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,152 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,152 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-25 00:03:13,152 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-25 00:03:13,152 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-25 00:03:13,152 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-25 00:03:13,153 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-25 00:03:13,153 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-25 00:03:13,153 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-25 00:03:13,153 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-25 00:03:13,153 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 515) no Hoare annotation was computed. [2018-10-25 00:03:13,153 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-25 00:03:13,153 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,153 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,154 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,154 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,154 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,154 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,154 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-25 00:03:13,154 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,154 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-25 00:03:13,154 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-25 00:03:13,154 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-25 00:03:13,154 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-25 00:03:13,155 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-25 00:03:13,155 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-25 00:03:13,155 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-25 00:03:13,155 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-25 00:03:13,155 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-25 00:03:13,155 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-25 00:03:13,155 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-25 00:03:13,155 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-25 00:03:13,155 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-25 00:03:13,156 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,156 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,156 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,156 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,156 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,156 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-25 00:03:13,156 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-25 00:03:13,156 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-25 00:03:13,156 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-25 00:03:13,156 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-25 00:03:13,157 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-25 00:03:13,157 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-25 00:03:13,157 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-25 00:03:13,157 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,157 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,157 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,157 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,157 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,158 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-25 00:03:13,158 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-25 00:03:13,158 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-25 00:03:13,158 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-25 00:03:13,158 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-25 00:03:13,158 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-25 00:03:13,158 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-25 00:03:13,158 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-25 00:03:13,158 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-25 00:03:13,158 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-25 00:03:13,159 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse36 (= ~a21~0 1)) (.cse24 (= 1 |old(~a21~0)|))) (let ((.cse9 (= 1 |old(~a17~0)|)) (.cse3 (= 13 |old(~a8~0)|)) (.cse33 (= 1 |old(~a7~0)|)) (.cse25 (not .cse24)) (.cse34 (= 0 |old(~a16~0)|)) (.cse4 (not (= 8 ~a12~0))) (.cse35 (= 0 |old(~a8~0)|)) (.cse27 (= 1 ~a7~0)) (.cse7 (not (= ~a8~0 13))) (.cse19 (= |old(~a20~0)| ~a20~0)) (.cse20 (= ~a17~0 |old(~a17~0)|)) (.cse21 (and (= ~a7~0 0) (not (= ~a16~0 0)) (not (= ~a8~0 0)) .cse36)) (.cse22 (= |old(~a16~0)| ~a16~0))) (let ((.cse13 (not (= |old(~a20~0)| 1))) (.cse18 (and .cse19 .cse20 .cse21 .cse22)) (.cse0 (and .cse27 .cse19 .cse20 .cse22 .cse7)) (.cse6 (< 0 |old(~a17~0)|)) (.cse10 (and .cse19 .cse20 .cse22 .cse21)) (.cse8 (or (not (= 0 |old(~a7~0)|)) .cse25 .cse34 .cse4 .cse35)) (.cse1 (= 6 |old(~a16~0)|)) (.cse11 (< 0 |old(~a20~0)|)) (.cse23 (and (not .cse36) .cse27 .cse19 .cse20 .cse22)) (.cse5 (not .cse33)) (.cse2 (not (= 1 |old(~a20~0)|))) (.cse26 (not (= 4 |old(~a16~0)|))) (.cse28 (= 1 ~a20~0)) (.cse29 (= 13 ~a8~0)) (.cse30 (= 1 ~a21~0)) (.cse31 (= 1 ~a17~0)) (.cse32 (not .cse3)) (.cse12 (= ~a8~0 15)) (.cse15 (not (= 15 |old(~a8~0)|))) (.cse16 (not (= 5 |old(~a16~0)|))) (.cse14 (or (not (= ~v~0 22)) .cse34 (not (= ~u~0 21)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (= |calculate_output_#in~input| 0) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) .cse35 (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23)))) (.cse17 (not .cse9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse2 .cse3 .cse7 .cse8) (or .cse1 .cse9 .cse8 .cse10 .cse11) (or .cse12 .cse13 .cse14 (or .cse15 .cse16 .cse17)) (or .cse1 .cse18 .cse13 .cse8 .cse6) (or .cse3 (and .cse19 .cse20 .cse21 .cse22 .cse7) .cse8 .cse11) (or .cse2 .cse18 .cse8 .cse17) (or (or (or .cse2 .cse15) .cse6 .cse14) .cse12) (or .cse23 (or .cse2 .cse24 .cse4) .cse5) (or .cse1 .cse3 .cse0 .cse4 .cse5 .cse6 .cse11) (or .cse10 .cse2 .cse3 .cse8) (or .cse1 .cse24 .cse4 .cse5 .cse11 .cse23) (or .cse25 .cse2 .cse26 (and .cse27 .cse28 .cse29 .cse22 .cse30 .cse31) .cse4 .cse5 .cse32 .cse17) (or .cse25 .cse33 .cse2 .cse26 .cse4 (and (not (= ~a7~0 1)) .cse28 .cse29 .cse22 .cse30 .cse31) .cse32 .cse17) (or .cse12 (or .cse15 (not (= 0 |old(~a20~0)|)) .cse16) .cse14 .cse17))))) [2018-10-25 00:03:13,159 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-25 00:03:13,159 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,159 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,159 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,160 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,160 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-25 00:03:13,160 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,160 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,160 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-25 00:03:13,160 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-25 00:03:13,160 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-25 00:03:13,160 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-25 00:03:13,160 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-25 00:03:13,160 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-25 00:03:13,161 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-25 00:03:13,161 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-25 00:03:13,161 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-25 00:03:13,161 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-25 00:03:13,161 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-25 00:03:13,161 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-25 00:03:13,161 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,161 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,161 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,161 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,162 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,162 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-25 00:03:13,162 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,162 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-25 00:03:13,162 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-25 00:03:13,162 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-25 00:03:13,162 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-25 00:03:13,162 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-25 00:03:13,162 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-25 00:03:13,162 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-25 00:03:13,162 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-25 00:03:13,163 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-25 00:03:13,163 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-25 00:03:13,163 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-25 00:03:13,163 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-25 00:03:13,163 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-25 00:03:13,163 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-25 00:03:13,163 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,163 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,163 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,163 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,163 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,164 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:13,164 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-25 00:03:13,164 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-25 00:03:13,164 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-25 00:03:13,164 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-25 00:03:13,164 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-25 00:03:13,164 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-25 00:03:13,164 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-25 00:03:13,164 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-25 00:03:13,164 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-25 00:03:13,164 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-25 00:03:13,165 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:03:13,165 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-25 00:03:13,165 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:03:13,165 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:03:13,165 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (and (= ~a8~0 15) (= ~a21~0 1) (= ~a7~0 |old(~a7~0)|) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:03:13,165 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:03:13,165 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse9 (= ~a21~0 1))) (let ((.cse2 (= 1 ~a20~0)) (.cse7 (not (= ~a8~0 13))) (.cse0 (= |old(~a20~0)| ~a20~0)) (.cse1 (and (= ~a7~0 0) (not (= ~a16~0 0)) (not (= ~a8~0 0)) .cse9)) (.cse6 (<= ~a17~0 0)) (.cse8 (not .cse9)) (.cse5 (= 1 ~a7~0)) (.cse3 (not (= ~a16~0 6))) (.cse4 (<= ~a20~0 0))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 (= ~a17~0 |old(~a17~0)|) .cse1) (not (= ~x~0 24)) (not (= ~c~0 3)) (not (= |old(~a7~0)| 0)) (and .cse2 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) (= 1 ~a17~0)) (not (= 25 ~y~0)) (not (= |old(~a17~0)| 1)) (not (= ~w~0 23)) (not (= 4 ~d~0)) (and .cse1 .cse3 (not (= ~a17~0 1)) .cse4) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a16~0)| 5)) (and .cse5 .cse3 .cse6 .cse7 .cse4) (not (= 1 ~a~0)) (and .cse8 .cse5 .cse2) (not (= 26 ~z~0)) (not (= ~f~0 6)) (and .cse1 .cse4 .cse7) (not (= 2 ~b~0)) (and .cse5 .cse0 .cse3 .cse6 .cse7) (and .cse2 .cse1 .cse7) (and .cse0 .cse1 .cse3 .cse6) (and .cse8 .cse5 .cse3 .cse4) (not (= |old(~a20~0)| 1)) (not (= 15 |old(~a8~0)|))))) [2018-10-25 00:03:13,165 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-25 00:03:13,166 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-25 00:03:13,166 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-25 00:03:13,166 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse9 (= ~a21~0 1))) (let ((.cse2 (= 1 ~a20~0)) (.cse7 (not (= ~a8~0 13))) (.cse0 (= |old(~a20~0)| ~a20~0)) (.cse1 (and (= ~a7~0 0) (not (= ~a16~0 0)) (not (= ~a8~0 0)) .cse9)) (.cse6 (<= ~a17~0 0)) (.cse8 (not .cse9)) (.cse5 (= 1 ~a7~0)) (.cse3 (not (= ~a16~0 6))) (.cse4 (<= ~a20~0 0))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 (= ~a17~0 |old(~a17~0)|) .cse1) (not (= ~x~0 24)) (not (= ~c~0 3)) (not (= |old(~a7~0)| 0)) (and .cse2 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) (= 1 ~a17~0)) (not (= 25 ~y~0)) (not (= |old(~a17~0)| 1)) (not (= ~w~0 23)) (not (= 4 ~d~0)) (and .cse1 .cse3 (not (= ~a17~0 1)) .cse4) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a16~0)| 5)) (and .cse5 .cse3 .cse6 .cse7 .cse4) (not (= 1 ~a~0)) (and .cse8 .cse5 .cse2) (not (= 26 ~z~0)) (not (= ~f~0 6)) (and .cse1 .cse4 .cse7) (not (= 2 ~b~0)) (and .cse5 .cse0 .cse3 .cse6 .cse7) (and .cse2 .cse1 .cse7) (and .cse0 .cse1 .cse3 .cse6) (and .cse8 .cse5 .cse3 .cse4) (not (= |old(~a20~0)| 1)) (not (= 15 |old(~a8~0)|))))) [2018-10-25 00:03:13,166 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:03:13,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:03:13 BoogieIcfgContainer [2018-10-25 00:03:13,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:03:13,192 INFO L168 Benchmark]: Toolchain (without parser) took 143895.49 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-10-25 00:03:13,194 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:03:13,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:13,195 INFO L168 Benchmark]: Boogie Procedure Inliner took 191.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.4 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:13,196 INFO L168 Benchmark]: Boogie Preprocessor took 113.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:13,197 INFO L168 Benchmark]: RCFGBuilder took 3545.06 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: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:13,197 INFO L168 Benchmark]: TraceAbstraction took 139319.98 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -570.7 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-10-25 00:03:13,202 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 719.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 191.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.4 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3545.06 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: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 139319.98 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -570.7 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 515]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(1 == \old(a21)) || ((\old(a20) == a20 && a17 == \old(a17)) && ((a7 == 0 && !(a16 == 0)) && !(a8 == 0)) && a21 == 1)) || !(x == 24)) || !(c == 3)) || !(\old(a7) == 0)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || !(25 == y)) || !(\old(a17) == 1)) || !(w == 23)) || !(4 == d)) || ((((((a7 == 0 && !(a16 == 0)) && !(a8 == 0)) && a21 == 1) && !(a16 == 6)) && !(a17 == 1)) && a20 <= 0)) || !(a12 == 8)) || !(e == 5)) || !(21 == u)) || !(22 == v)) || !(\old(a16) == 5)) || ((((1 == a7 && !(a16 == 6)) && a17 <= 0) && !(a8 == 13)) && a20 <= 0)) || !(1 == a)) || ((!(a21 == 1) && 1 == a7) && 1 == a20)) || !(26 == z)) || !(f == 6)) || (((((a7 == 0 && !(a16 == 0)) && !(a8 == 0)) && a21 == 1) && a20 <= 0) && !(a8 == 13))) || !(2 == b)) || ((((1 == a7 && \old(a20) == a20) && !(a16 == 6)) && a17 <= 0) && !(a8 == 13))) || ((1 == a20 && ((a7 == 0 && !(a16 == 0)) && !(a8 == 0)) && a21 == 1) && !(a8 == 13))) || (((\old(a20) == a20 && ((a7 == 0 && !(a16 == 0)) && !(a8 == 0)) && a21 == 1) && !(a16 == 6)) && a17 <= 0)) || (((!(a21 == 1) && 1 == a7) && !(a16 == 6)) && a20 <= 0)) || !(\old(a20) == 1)) || !(15 == \old(a8)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 139.2s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 64.9s AutomataDifference, 0.0s DeadEndRemovalTime, 39.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1699 SDtfs, 11519 SDslu, 2231 SDs, 0 SdLazy, 16594 SolverSat, 2387 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.5s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2937 GetRequests, 2452 SyntacticMatches, 322 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2553 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13055occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.3s AbstIntTime, 7 AbstIntIterations, 4 AbstIntStrong, 0.9974672499026598 AbsIntWeakeningRatio, 0.2023047375160051 AbsIntAvgWeakeningVarsNumRemoved, 6.9103713188220235 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 966 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 720 PreInvPairs, 1588 NumberOfFragments, 1540 HoareAnnotationTreeSize, 720 FomulaSimplifications, 101040 FormulaSimplificationTreeSizeReduction, 19.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 208672 FormulaSimplificationTreeSizeReductionInter, 19.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 3399 NumberOfCodeBlocks, 3332 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4359 ConstructedInterpolants, 0 QuantifiedInterpolants, 2487557 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2413 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 2964/3408 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...