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/Problem10_label49_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:25:18,466 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:25:18,471 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:25:18,488 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:25:18,488 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:25:18,490 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:25:18,491 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:25:18,493 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:25:18,494 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:25:18,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:25:18,497 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:25:18,498 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:25:18,499 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:25:18,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:25:18,509 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:25:18,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:25:18,512 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:25:18,516 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:25:18,519 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:25:18,521 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:25:18,522 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:25:18,525 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:25:18,527 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:25:18,528 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:25:18,530 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:25:18,531 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:25:18,532 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:25:18,532 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:25:18,533 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:25:18,536 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:25:18,536 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:25:18,537 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:25:18,538 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:25:18,538 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:25:18,539 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:25:18,540 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:25:18,540 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 01:25:18,567 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:25:18,567 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:25:18,568 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:25:18,569 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:25:18,569 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:25:18,569 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:25:18,570 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:25:18,570 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:25:18,570 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:25:18,570 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:25:18,570 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:25:18,571 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:25:18,571 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:25:18,571 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:25:18,573 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:25:18,573 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:25:18,573 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:25:18,573 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:25:18,574 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:25:18,575 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:25:18,575 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:25:18,575 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:25:18,575 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:25:18,576 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:25:18,576 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:25:18,576 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:25:18,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:25:18,576 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:25:18,577 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:25:18,577 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:25:18,577 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:25:18,577 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:25:18,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:25:18,578 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:25:18,578 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:25:18,578 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:25:18,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:25:18,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:25:18,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:25:18,652 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:25:18,652 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:25:18,653 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label49_true-unreach-call.c [2018-10-25 01:25:18,736 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/40d22cc00/16f52fba32004500b9f442283bb92495/FLAG5734c70f3 [2018-10-25 01:25:19,308 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:25:19,311 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label49_true-unreach-call.c [2018-10-25 01:25:19,333 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/40d22cc00/16f52fba32004500b9f442283bb92495/FLAG5734c70f3 [2018-10-25 01:25:19,354 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/40d22cc00/16f52fba32004500b9f442283bb92495 [2018-10-25 01:25:19,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:25:19,370 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:25:19,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:25:19,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:25:19,379 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:25:19,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:25:19" (1/1) ... [2018-10-25 01:25:19,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e34a1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:25:19, skipping insertion in model container [2018-10-25 01:25:19,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:25:19" (1/1) ... [2018-10-25 01:25:19,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:25:19,453 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:25:19,932 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:25:19,937 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:25:20,103 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:25:20,130 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:25:20,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:25:20 WrapperNode [2018-10-25 01:25:20,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:25:20,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:25:20,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:25:20,132 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:25:20,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:25:20" (1/1) ... [2018-10-25 01:25:20,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:25:20" (1/1) ... [2018-10-25 01:25:20,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:25:20,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:25:20,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:25:20,329 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:25:20,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:25:20" (1/1) ... [2018-10-25 01:25:20,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:25:20" (1/1) ... [2018-10-25 01:25:20,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:25:20" (1/1) ... [2018-10-25 01:25:20,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:25:20" (1/1) ... [2018-10-25 01:25:20,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:25:20" (1/1) ... [2018-10-25 01:25:20,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:25:20" (1/1) ... [2018-10-25 01:25:20,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:25:20" (1/1) ... [2018-10-25 01:25:20,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:25:20,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:25:20,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:25:20,469 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:25:20,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:25:20" (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 01:25:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:25:20,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:25:20,540 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:25:20,540 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:25:20,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:25:20,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:25:20,541 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:25:20,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:25:23,826 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:25:23,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:25:23 BoogieIcfgContainer [2018-10-25 01:25:23,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:25:23,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:25:23,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:25:23,832 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:25:23,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:25:19" (1/3) ... [2018-10-25 01:25:23,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a413d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:25:23, skipping insertion in model container [2018-10-25 01:25:23,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:25:20" (2/3) ... [2018-10-25 01:25:23,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a413d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:25:23, skipping insertion in model container [2018-10-25 01:25:23,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:25:23" (3/3) ... [2018-10-25 01:25:23,840 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label49_true-unreach-call.c [2018-10-25 01:25:23,850 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:25:23,861 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:25:23,881 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:25:23,917 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:25:23,918 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:25:23,918 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:25:23,918 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:25:23,918 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:25:23,918 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:25:23,919 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:25:23,919 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:25:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-25 01:25:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-25 01:25:23,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:23,958 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] [2018-10-25 01:25:23,961 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:23,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:23,967 INFO L82 PathProgramCache]: Analyzing trace with hash -654369111, now seen corresponding path program 1 times [2018-10-25 01:25:23,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:24,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:24,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:24,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:24,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:24,401 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:25:24,512 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 01:25:24,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:25:24,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:25:24,516 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:25:24,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:25:24,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:25:24,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:25:24,543 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-10-25 01:25:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:27,105 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-10-25 01:25:27,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:25:27,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-25 01:25:27,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:27,129 INFO L225 Difference]: With dead ends: 574 [2018-10-25 01:25:27,129 INFO L226 Difference]: Without dead ends: 356 [2018-10-25 01:25:27,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:25:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-25 01:25:27,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-10-25 01:25:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-25 01:25:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-10-25 01:25:27,231 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 29 [2018-10-25 01:25:27,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:27,232 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-10-25 01:25:27,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:25:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-10-25 01:25:27,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-25 01:25:27,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:27,239 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:25:27,239 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:27,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:27,240 INFO L82 PathProgramCache]: Analyzing trace with hash 350526568, now seen corresponding path program 1 times [2018-10-25 01:25:27,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:27,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:27,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:27,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:27,242 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:27,599 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:25:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:25:27,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:25:27,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:25:27,647 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:25:27,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:25:27,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:25:27,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:25:27,650 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 6 states. [2018-10-25 01:25:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:29,256 INFO L93 Difference]: Finished difference Result 867 states and 1507 transitions. [2018-10-25 01:25:29,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:25:29,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-10-25 01:25:29,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:29,264 INFO L225 Difference]: With dead ends: 867 [2018-10-25 01:25:29,264 INFO L226 Difference]: Without dead ends: 517 [2018-10-25 01:25:29,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:25:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-10-25 01:25:29,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 508. [2018-10-25 01:25:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-10-25 01:25:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 831 transitions. [2018-10-25 01:25:29,309 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 831 transitions. Word has length 103 [2018-10-25 01:25:29,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:29,310 INFO L481 AbstractCegarLoop]: Abstraction has 508 states and 831 transitions. [2018-10-25 01:25:29,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:25:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 831 transitions. [2018-10-25 01:25:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-25 01:25:29,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:29,316 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:25:29,316 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:29,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:29,316 INFO L82 PathProgramCache]: Analyzing trace with hash -781565036, now seen corresponding path program 1 times [2018-10-25 01:25:29,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:29,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:29,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:29,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:29,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:25:29,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:25:29,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:25:29,550 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:25:29,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:25:29,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:25:29,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:25:29,553 INFO L87 Difference]: Start difference. First operand 508 states and 831 transitions. Second operand 4 states. [2018-10-25 01:25:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:31,892 INFO L93 Difference]: Finished difference Result 1742 states and 2991 transitions. [2018-10-25 01:25:31,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:25:31,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-10-25 01:25:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:31,913 INFO L225 Difference]: With dead ends: 1742 [2018-10-25 01:25:31,914 INFO L226 Difference]: Without dead ends: 1240 [2018-10-25 01:25:31,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:25:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2018-10-25 01:25:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1240. [2018-10-25 01:25:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2018-10-25 01:25:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1869 transitions. [2018-10-25 01:25:32,002 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1869 transitions. Word has length 109 [2018-10-25 01:25:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:32,003 INFO L481 AbstractCegarLoop]: Abstraction has 1240 states and 1869 transitions. [2018-10-25 01:25:32,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:25:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1869 transitions. [2018-10-25 01:25:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-25 01:25:32,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:32,013 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:25:32,013 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:32,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:32,014 INFO L82 PathProgramCache]: Analyzing trace with hash -883752961, now seen corresponding path program 1 times [2018-10-25 01:25:32,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:32,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:32,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:25:32,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:25:32,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:25:32,338 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:25:32,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:25:32,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:25:32,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:25:32,340 INFO L87 Difference]: Start difference. First operand 1240 states and 1869 transitions. Second operand 6 states. [2018-10-25 01:25:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:35,824 INFO L93 Difference]: Finished difference Result 2759 states and 4120 transitions. [2018-10-25 01:25:35,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:25:35,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2018-10-25 01:25:35,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:35,840 INFO L225 Difference]: With dead ends: 2759 [2018-10-25 01:25:35,840 INFO L226 Difference]: Without dead ends: 1525 [2018-10-25 01:25:35,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:25:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-10-25 01:25:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1485. [2018-10-25 01:25:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2018-10-25 01:25:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2034 transitions. [2018-10-25 01:25:35,909 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2034 transitions. Word has length 166 [2018-10-25 01:25:35,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:35,912 INFO L481 AbstractCegarLoop]: Abstraction has 1485 states and 2034 transitions. [2018-10-25 01:25:35,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:25:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2034 transitions. [2018-10-25 01:25:35,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-25 01:25:35,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:35,919 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:25:35,921 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:35,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:35,921 INFO L82 PathProgramCache]: Analyzing trace with hash 752941163, now seen corresponding path program 1 times [2018-10-25 01:25:35,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:35,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:35,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:35,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:35,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:36,237 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:25:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:25:36,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:25:36,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:25:36,639 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:25:36,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:25:36,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:25:36,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:25:36,640 INFO L87 Difference]: Start difference. First operand 1485 states and 2034 transitions. Second operand 6 states. [2018-10-25 01:25:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:38,379 INFO L93 Difference]: Finished difference Result 3547 states and 5008 transitions. [2018-10-25 01:25:38,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:25:38,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2018-10-25 01:25:38,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:38,407 INFO L225 Difference]: With dead ends: 3547 [2018-10-25 01:25:38,408 INFO L226 Difference]: Without dead ends: 2068 [2018-10-25 01:25:38,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:25:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2018-10-25 01:25:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2051. [2018-10-25 01:25:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2018-10-25 01:25:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2708 transitions. [2018-10-25 01:25:38,486 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 2708 transitions. Word has length 172 [2018-10-25 01:25:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:38,487 INFO L481 AbstractCegarLoop]: Abstraction has 2051 states and 2708 transitions. [2018-10-25 01:25:38,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:25:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2708 transitions. [2018-10-25 01:25:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-25 01:25:38,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:38,495 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:25:38,496 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:38,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:38,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1320084340, now seen corresponding path program 1 times [2018-10-25 01:25:38,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:38,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:38,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:38,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:38,498 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-25 01:25:38,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:25:38,888 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:25:38,889 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-10-25 01:25:38,891 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:25:38,943 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:25:38,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:25:40,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:25:40,069 INFO L272 AbstractInterpreter]: Visited 146 different actions 290 times. Merged at 7 different actions 10 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-25 01:25:40,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:40,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:25:40,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:25:40,116 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 01:25:40,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:40,136 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:25:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:40,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:25:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 122 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:25:40,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:25:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 122 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:25:41,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 01:25:41,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2018-10-25 01:25:41,495 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 01:25:41,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 01:25:41,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 01:25:41,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-25 01:25:41,497 INFO L87 Difference]: Start difference. First operand 2051 states and 2708 transitions. Second operand 11 states. [2018-10-25 01:25:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:46,668 INFO L93 Difference]: Finished difference Result 5282 states and 7182 transitions. [2018-10-25 01:25:46,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 01:25:46,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 246 [2018-10-25 01:25:46,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:46,679 INFO L225 Difference]: With dead ends: 5282 [2018-10-25 01:25:46,679 INFO L226 Difference]: Without dead ends: 1645 [2018-10-25 01:25:46,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 496 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2018-10-25 01:25:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2018-10-25 01:25:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1200. [2018-10-25 01:25:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2018-10-25 01:25:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1360 transitions. [2018-10-25 01:25:46,754 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1360 transitions. Word has length 246 [2018-10-25 01:25:46,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:46,755 INFO L481 AbstractCegarLoop]: Abstraction has 1200 states and 1360 transitions. [2018-10-25 01:25:46,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 01:25:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1360 transitions. [2018-10-25 01:25:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-25 01:25:46,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:46,762 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:25:46,762 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:46,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:46,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1377879184, now seen corresponding path program 1 times [2018-10-25 01:25:46,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:46,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:46,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:46,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:46,764 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:47,235 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 01:25:47,423 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-25 01:25:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 118 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:25:48,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:25:48,186 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:25:48,186 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-10-25 01:25:48,187 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [786], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:25:48,202 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:25:48,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:25:48,367 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:25:48,368 INFO L272 AbstractInterpreter]: Visited 148 different actions 148 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:25:48,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:48,406 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:25:48,877 INFO L232 lantSequenceWeakener]: Weakened 251 states. On average, predicates are now at 72.88% of their original sizes. [2018-10-25 01:25:48,877 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:25:49,148 INFO L413 sIntCurrentIteration]: We have 259 unified AI predicates [2018-10-25 01:25:49,148 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:25:49,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:25:49,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2018-10-25 01:25:49,149 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:25:49,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:25:49,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:25:49,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:25:49,151 INFO L87 Difference]: Start difference. First operand 1200 states and 1360 transitions. Second operand 6 states. [2018-10-25 01:26:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:26:19,428 INFO L93 Difference]: Finished difference Result 2252 states and 2548 transitions. [2018-10-25 01:26:19,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:26:19,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 260 [2018-10-25 01:26:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:26:19,434 INFO L225 Difference]: With dead ends: 2252 [2018-10-25 01:26:19,434 INFO L226 Difference]: Without dead ends: 1202 [2018-10-25 01:26:19,437 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 260 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 01:26:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2018-10-25 01:26:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1200. [2018-10-25 01:26:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2018-10-25 01:26:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1340 transitions. [2018-10-25 01:26:19,467 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1340 transitions. Word has length 260 [2018-10-25 01:26:19,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:26:19,468 INFO L481 AbstractCegarLoop]: Abstraction has 1200 states and 1340 transitions. [2018-10-25 01:26:19,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:26:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1340 transitions. [2018-10-25 01:26:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-25 01:26:19,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:26:19,474 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:26:19,474 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:26:19,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:26:19,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1863027052, now seen corresponding path program 1 times [2018-10-25 01:26:19,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:26:19,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:26:19,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:26:19,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:26:19,476 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:26:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:26:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-25 01:26:20,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:26:20,624 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:26:20,624 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-10-25 01:26:20,625 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:26:20,630 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:26:20,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:26:21,209 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:26:21,209 INFO L272 AbstractInterpreter]: Visited 146 different actions 429 times. Merged at 7 different actions 15 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-25 01:26:21,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:26:21,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:26:21,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:26:21,221 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 01:26:21,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:26:21,230 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:26:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:26:21,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:26:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-25 01:26:21,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:26:21,733 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-25 01:26:21,902 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-25 01:26:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-25 01:26:22,002 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:26:22,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 11 [2018-10-25 01:26:22,002 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:26:22,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:26:22,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:26:22,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-25 01:26:22,004 INFO L87 Difference]: Start difference. First operand 1200 states and 1340 transitions. Second operand 3 states. [2018-10-25 01:26:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:26:22,857 INFO L93 Difference]: Finished difference Result 2831 states and 3167 transitions. [2018-10-25 01:26:22,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:26:22,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2018-10-25 01:26:22,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:26:22,865 INFO L225 Difference]: With dead ends: 2831 [2018-10-25 01:26:22,865 INFO L226 Difference]: Without dead ends: 1634 [2018-10-25 01:26:22,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 565 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-25 01:26:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2018-10-25 01:26:22,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1490. [2018-10-25 01:26:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2018-10-25 01:26:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1644 transitions. [2018-10-25 01:26:22,905 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1644 transitions. Word has length 282 [2018-10-25 01:26:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:26:22,906 INFO L481 AbstractCegarLoop]: Abstraction has 1490 states and 1644 transitions. [2018-10-25 01:26:22,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:26:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1644 transitions. [2018-10-25 01:26:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-25 01:26:22,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:26:22,912 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:26:22,913 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:26:22,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:26:22,913 INFO L82 PathProgramCache]: Analyzing trace with hash -827909397, now seen corresponding path program 1 times [2018-10-25 01:26:22,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:26:22,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:26:22,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:26:22,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:26:22,914 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:26:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:26:23,273 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:26:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 144 proven. 140 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-25 01:26:23,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:26:23,775 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:26:23,775 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-10-25 01:26:23,776 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:26:23,887 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:26:23,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:26:24,514 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:26:24,514 INFO L272 AbstractInterpreter]: Visited 126 different actions 379 times. Merged at 8 different actions 25 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-25 01:26:24,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:26:24,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:26:24,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:26:24,529 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 01:26:24,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:26:24,539 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:26:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:26:24,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:26:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 214 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-25 01:26:24,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:26:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 214 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-25 01:26:25,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 01:26:25,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 18 [2018-10-25 01:26:25,554 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 01:26:25,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-25 01:26:25,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-25 01:26:25,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-10-25 01:26:25,556 INFO L87 Difference]: Start difference. First operand 1490 states and 1644 transitions. Second operand 16 states. [2018-10-25 01:26:34,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:26:34,379 INFO L93 Difference]: Finished difference Result 4641 states and 5496 transitions. [2018-10-25 01:26:34,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-25 01:26:34,379 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 292 [2018-10-25 01:26:34,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:26:34,395 INFO L225 Difference]: With dead ends: 4641 [2018-10-25 01:26:34,395 INFO L226 Difference]: Without dead ends: 3154 [2018-10-25 01:26:34,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 612 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=730, Invalid=3430, Unknown=0, NotChecked=0, Total=4160 [2018-10-25 01:26:34,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2018-10-25 01:26:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 2768. [2018-10-25 01:26:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2768 states. [2018-10-25 01:26:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 3055 transitions. [2018-10-25 01:26:34,494 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 3055 transitions. Word has length 292 [2018-10-25 01:26:34,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:26:34,495 INFO L481 AbstractCegarLoop]: Abstraction has 2768 states and 3055 transitions. [2018-10-25 01:26:34,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-25 01:26:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 3055 transitions. [2018-10-25 01:26:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-25 01:26:34,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:26:34,504 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-10-25 01:26:34,504 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:26:34,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:26:34,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1133583438, now seen corresponding path program 1 times [2018-10-25 01:26:34,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:26:34,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:26:34,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:26:34,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:26:34,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:26:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:26:34,854 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:26:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 219 proven. 77 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-25 01:26:35,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:26:35,291 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:26:35,291 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 306 with the following transitions: [2018-10-25 01:26:35,291 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [558], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:26:35,294 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:26:35,294 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:26:36,102 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:26:36,102 INFO L272 AbstractInterpreter]: Visited 126 different actions 379 times. Merged at 8 different actions 25 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-25 01:26:36,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:26:36,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:26:36,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:26:36,103 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 01:26:36,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:26:36,111 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:26:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:26:36,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:26:40,766 WARN L179 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 118 DAG size of output: 16 [2018-10-25 01:26:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-10-25 01:26:40,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:26:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-10-25 01:26:41,330 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:26:41,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [12] total 14 [2018-10-25 01:26:41,330 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:26:41,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:26:41,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:26:41,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2018-10-25 01:26:41,331 INFO L87 Difference]: Start difference. First operand 2768 states and 3055 transitions. Second operand 3 states. [2018-10-25 01:26:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:26:49,162 INFO L93 Difference]: Finished difference Result 6113 states and 6846 transitions. [2018-10-25 01:26:49,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:26:49,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2018-10-25 01:26:49,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:26:49,166 INFO L225 Difference]: With dead ends: 6113 [2018-10-25 01:26:49,166 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 01:26:49,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 608 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2018-10-25 01:26:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 01:26:49,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 01:26:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 01:26:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 01:26:49,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 305 [2018-10-25 01:26:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:26:49,182 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 01:26:49,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:26:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 01:26:49,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 01:26:49,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 01:26:49,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:49,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:49,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:49,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:49,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:49,467 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 154 [2018-10-25 01:26:49,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:49,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:49,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:49,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:49,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:26:49,624 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 156 [2018-10-25 01:26:50,032 WARN L179 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 15 [2018-10-25 01:26:50,431 WARN L179 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 27 [2018-10-25 01:26:52,277 WARN L179 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 181 DAG size of output: 64 [2018-10-25 01:26:53,326 WARN L179 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 164 DAG size of output: 55 [2018-10-25 01:26:54,602 WARN L179 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 167 DAG size of output: 55 [2018-10-25 01:26:54,605 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 01:26:54,606 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a19~0)| ~a19~0) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-10-25 01:26:54,606 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 01:26:54,606 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-10-25 01:26:54,606 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,606 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,606 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,606 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,606 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,607 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,607 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-10-25 01:26:54,607 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-10-25 01:26:54,607 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-10-25 01:26:54,607 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-10-25 01:26:54,607 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-10-25 01:26:54,607 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-10-25 01:26:54,607 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-10-25 01:26:54,607 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-25 01:26:54,607 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-10-25 01:26:54,607 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-10-25 01:26:54,607 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-10-25 01:26:54,607 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,608 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,608 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,608 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,608 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,608 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-10-25 01:26:54,608 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-10-25 01:26:54,608 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-10-25 01:26:54,608 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-10-25 01:26:54,608 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-25 01:26:54,608 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-10-25 01:26:54,608 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-25 01:26:54,609 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-10-25 01:26:54,609 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-25 01:26:54,609 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-10-25 01:26:54,609 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-10-25 01:26:54,609 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-10-25 01:26:54,609 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-10-25 01:26:54,609 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-10-25 01:26:54,609 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,609 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,609 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,609 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,610 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,610 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-10-25 01:26:54,610 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-10-25 01:26:54,610 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-10-25 01:26:54,610 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-25 01:26:54,610 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-10-25 01:26:54,610 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-25 01:26:54,610 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-10-25 01:26:54,610 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-10-25 01:26:54,610 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-10-25 01:26:54,610 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-10-25 01:26:54,611 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,611 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,611 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,611 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,611 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,611 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-10-25 01:26:54,611 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-10-25 01:26:54,611 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-10-25 01:26:54,611 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-10-25 01:26:54,611 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-10-25 01:26:54,612 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-10-25 01:26:54,612 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-10-25 01:26:54,612 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-25 01:26:54,612 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-10-25 01:26:54,612 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-10-25 01:26:54,612 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-10-25 01:26:54,612 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-10-25 01:26:54,612 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-10-25 01:26:54,612 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,613 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,613 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,613 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,613 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,613 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-10-25 01:26:54,613 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-10-25 01:26:54,613 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-10-25 01:26:54,613 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-10-25 01:26:54,613 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-10-25 01:26:54,614 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-10-25 01:26:54,614 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-10-25 01:26:54,614 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2018-10-25 01:26:54,614 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-10-25 01:26:54,614 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-10-25 01:26:54,614 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,614 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,614 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,614 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,614 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,614 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,615 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,615 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-10-25 01:26:54,615 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-10-25 01:26:54,615 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-10-25 01:26:54,615 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-10-25 01:26:54,615 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-25 01:26:54,615 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-10-25 01:26:54,615 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-10-25 01:26:54,615 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-10-25 01:26:54,616 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-10-25 01:26:54,616 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-10-25 01:26:54,616 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-10-25 01:26:54,616 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-10-25 01:26:54,616 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-10-25 01:26:54,616 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,616 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,616 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,616 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,617 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-10-25 01:26:54,617 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,617 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,617 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-10-25 01:26:54,617 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-10-25 01:26:54,617 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-10-25 01:26:54,617 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-10-25 01:26:54,617 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-10-25 01:26:54,617 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-25 01:26:54,617 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-10-25 01:26:54,618 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-25 01:26:54,618 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-25 01:26:54,618 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-10-25 01:26:54,618 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-10-25 01:26:54,618 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-10-25 01:26:54,618 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-10-25 01:26:54,618 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,618 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,618 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,618 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,619 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,619 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,619 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-10-25 01:26:54,619 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-10-25 01:26:54,619 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-10-25 01:26:54,619 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-10-25 01:26:54,619 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-10-25 01:26:54,619 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-25 01:26:54,619 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-25 01:26:54,620 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-10-25 01:26:54,620 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-25 01:26:54,620 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-10-25 01:26:54,620 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-10-25 01:26:54,620 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse9 (= |old(~a19~0)| ~a19~0)) (.cse10 (= |old(~a10~0)| ~a10~0))) (let ((.cse2 (= 10 |old(~a19~0)|)) (.cse8 (and .cse9 .cse10)) (.cse7 (= 2 |old(~a10~0)|)) (.cse6 (= 8 |old(~a19~0)|)) (.cse5 (forall ((v_prenex_8 Int)) (let ((.cse12 (* 9 v_prenex_8))) (let ((.cse11 (div .cse12 10))) (or (< .cse11 0) (< .cse12 0) (< (+ (mod .cse11 25) 12) |old(~a1~0)|)))))) (.cse0 (= 4 |old(~a10~0)|)) (.cse4 (< 8 |old(~a19~0)|)) (.cse1 (and .cse9 .cse10 (= ~a1~0 |old(~a1~0)|))) (.cse3 (= 1 |old(~a10~0)|))) (and (or (< |old(~a10~0)| 1) .cse0 .cse1 (< |old(~a1~0)| 219) .cse2 .cse3) (or .cse0 (< 0 (+ |old(~a1~0)| 437977)) .cse4 (<= (+ ~a1~0 437977) 0) .cse3) (or .cse5 (or .cse2 .cse6) .cse1) (or (or .cse2 .cse7 .cse6) .cse1) (or .cse4 .cse8 .cse6) (or .cse4 .cse7 .cse8) (or .cse1 (or .cse0 .cse7 .cse6)) (or .cse5 .cse0 .cse4 .cse1 (= 0 |old(~a10~0)|) .cse3)))) [2018-10-25 01:26:54,620 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-10-25 01:26:54,621 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-10-25 01:26:54,621 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-10-25 01:26:54,621 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,621 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,621 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,621 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,621 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,621 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,622 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-10-25 01:26:54,622 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-10-25 01:26:54,622 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-10-25 01:26:54,622 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-10-25 01:26:54,622 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-10-25 01:26:54,622 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-10-25 01:26:54,622 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-25 01:26:54,622 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-10-25 01:26:54,623 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-10-25 01:26:54,623 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-10-25 01:26:54,623 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-10-25 01:26:54,623 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-10-25 01:26:54,623 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-10-25 01:26:54,623 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,623 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,623 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,624 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,624 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,624 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,624 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-10-25 01:26:54,624 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-10-25 01:26:54,624 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-10-25 01:26:54,624 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-10-25 01:26:54,624 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-10-25 01:26:54,625 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-10-25 01:26:54,625 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-10-25 01:26:54,625 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-25 01:26:54,625 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-25 01:26:54,625 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-10-25 01:26:54,625 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-10-25 01:26:54,625 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-10-25 01:26:54,625 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,625 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,626 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,626 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,626 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,626 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:26:54,626 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-10-25 01:26:54,626 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-10-25 01:26:54,626 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-10-25 01:26:54,626 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-10-25 01:26:54,626 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-10-25 01:26:54,627 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-10-25 01:26:54,627 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-25 01:26:54,627 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-10-25 01:26:54,627 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-25 01:26:54,627 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-10-25 01:26:54,627 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-10-25 01:26:54,627 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-10-25 01:26:54,627 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 01:26:54,628 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a19~0 9) (= ~a10~0 0) (= ~a12~0 0) (= ~a1~0 23) (= ~a4~0 14)) [2018-10-25 01:26:54,628 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 01:26:54,628 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 01:26:54,628 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (not (= 14 ~a4~0)) (not (= 0 ~a12~0)) (not (= 9 |old(~a19~0)|)) (and (= |old(~a19~0)| ~a19~0) (= ~a1~0 23) (= |old(~a10~0)| ~a10~0)) (not (= 23 |old(~a1~0)|)) (not (= 0 |old(~a10~0)|))) [2018-10-25 01:26:54,628 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-10-25 01:26:54,628 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse0 (not (= ~a19~0 10))) (.cse3 (not (= 2 ~a10~0)))) (or (not (= 23 |old(~a1~0)|)) (not (= 0 ~a12~0)) (not (= 0 |old(~a10~0)|)) (and (< 218 ~a1~0) .cse0) (and .cse0 (exists ((v_prenex_8 Int)) (let ((.cse2 (* 9 v_prenex_8))) (let ((.cse1 (div .cse2 10))) (and (<= ~a1~0 (+ (mod .cse1 25) 12)) (<= 0 .cse2) (<= 0 .cse1)))))) (not (= 9 |old(~a19~0)|)) (and .cse0 .cse3) (not (= 14 ~a4~0)) (and (<= ~a19~0 8) (not (= ~a19~0 8))) (and (not (= ~a10~0 4)) .cse3))) [2018-10-25 01:26:54,628 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-10-25 01:26:54,629 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-10-25 01:26:54,629 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-10-25 01:26:54,629 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= ~a19~0 10))) (.cse3 (not (= 2 ~a10~0)))) (or (not (= 23 |old(~a1~0)|)) (not (= 0 ~a12~0)) (not (= 0 |old(~a10~0)|)) (and (< 218 ~a1~0) .cse0) (and .cse0 (exists ((v_prenex_8 Int)) (let ((.cse2 (* 9 v_prenex_8))) (let ((.cse1 (div .cse2 10))) (and (<= ~a1~0 (+ (mod .cse1 25) 12)) (<= 0 .cse2) (<= 0 .cse1)))))) (not (= 9 |old(~a19~0)|)) (and .cse0 .cse3) (not (= 14 ~a4~0)) (and (<= ~a19~0 8) (not (= ~a19~0 8))) (and (not (= ~a10~0 4)) .cse3))) [2018-10-25 01:26:54,629 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-10-25 01:26:54,635 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-10-25 01:26:54,636 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-10-25 01:26:54,636 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-10-25 01:26:54,642 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-10-25 01:26:54,642 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-10-25 01:26:54,643 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-10-25 01:26:54,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 01:26:54 BoogieIcfgContainer [2018-10-25 01:26:54,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 01:26:54,647 INFO L168 Benchmark]: Toolchain (without parser) took 95277.80 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-25 01:26:54,648 INFO L168 Benchmark]: CDTParser took 0.20 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 01:26:54,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.49 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 01:26:54,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 196.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:26:54,650 INFO L168 Benchmark]: Boogie Preprocessor took 139.48 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.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:26:54,651 INFO L168 Benchmark]: RCFGBuilder took 3358.96 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: 115.9 MB). Peak memory consumption was 115.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:26:54,652 INFO L168 Benchmark]: TraceAbstraction took 90817.61 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -885.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-25 01:26:54,657 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.20 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 759.49 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 196.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.48 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.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3358.96 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: 115.9 MB). Peak memory consumption was 115.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90817.61 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -885.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant [2018-10-25 01:26:54,666 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-10-25 01:26:54,666 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-10-25 01:26:54,666 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-10-25 01:26:54,667 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-10-25 01:26:54,667 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-10-25 01:26:54,668 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] Derived loop invariant: ((((((((!(23 == \old(a1)) || !(0 == a12)) || !(0 == \old(a10))) || (218 < a1 && !(a19 == 10))) || (!(a19 == 10) && (\exists v_prenex_8 : int :: (a1 <= 9 * v_prenex_8 / 10 % 25 + 12 && 0 <= 9 * v_prenex_8) && 0 <= 9 * v_prenex_8 / 10))) || !(9 == \old(a19))) || (!(a19 == 10) && !(2 == a10))) || !(14 == a4)) || (a19 <= 8 && !(a19 == 8))) || (!(a10 == 4) && !(2 == a10)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 90.7s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 64.9s AutomataDifference, 0.0s DeadEndRemovalTime, 5.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 990 SDtfs, 8983 SDslu, 1160 SDs, 0 SdLazy, 14797 SolverSat, 2604 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 49.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 2700 GetRequests, 2547 SyntacticMatches, 17 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2768occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.6s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.9978263049691625 AbsIntWeakeningRatio, 0.10038610038610038 AbsIntAvgWeakeningVarsNumRemoved, 15.428571428571429 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 1043 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 122 PreInvPairs, 208 NumberOfFragments, 449 HoareAnnotationTreeSize, 122 FomulaSimplifications, 7970 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8488 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 3089 NumberOfCodeBlocks, 3089 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4196 ConstructedInterpolants, 25 QuantifiedInterpolants, 5309321 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1899 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 18 InterpolantComputations, 9 PerfectInterpolantSequences, 2542/2830 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...