java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label01_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 19:02:04,369 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 19:02:04,373 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 19:02:04,388 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 19:02:04,389 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 19:02:04,390 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 19:02:04,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 19:02:04,396 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 19:02:04,405 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 19:02:04,406 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 19:02:04,407 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 19:02:04,407 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 19:02:04,411 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 19:02:04,412 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 19:02:04,416 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 19:02:04,416 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 19:02:04,419 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 19:02:04,422 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 19:02:04,426 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 19:02:04,427 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 19:02:04,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 19:02:04,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 19:02:04,437 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 19:02:04,437 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 19:02:04,437 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 19:02:04,438 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 19:02:04,439 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 19:02:04,440 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 19:02:04,444 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 19:02:04,446 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 19:02:04,447 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 19:02:04,448 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 19:02:04,448 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 19:02:04,449 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 19:02:04,449 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 19:02:04,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 19:02:04,450 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 19:02:04,483 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 19:02:04,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 19:02:04,486 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 19:02:04,486 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 19:02:04,486 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 19:02:04,486 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 19:02:04,487 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 19:02:04,487 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 19:02:04,487 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 19:02:04,487 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 19:02:04,487 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 19:02:04,488 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 19:02:04,488 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 19:02:04,489 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 19:02:04,489 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 19:02:04,490 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 19:02:04,490 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 19:02:04,490 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 19:02:04,490 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 19:02:04,490 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 19:02:04,491 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 19:02:04,491 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 19:02:04,491 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 19:02:04,491 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 19:02:04,491 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 19:02:04,492 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 19:02:04,493 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 19:02:04,493 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 19:02:04,494 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 19:02:04,494 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 19:02:04,494 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 19:02:04,494 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 19:02:04,495 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 19:02:04,495 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 19:02:04,495 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 19:02:04,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 19:02:04,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 19:02:04,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 19:02:04,566 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 19:02:04,567 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 19:02:04,567 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label01_true-unreach-call_false-termination.c [2018-11-12 19:02:04,630 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01c320007/c8b77dffb19b4ca6b5eec94a2ca3fb70/FLAG21a02b0be [2018-11-12 19:02:05,174 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 19:02:05,175 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label01_true-unreach-call_false-termination.c [2018-11-12 19:02:05,196 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01c320007/c8b77dffb19b4ca6b5eec94a2ca3fb70/FLAG21a02b0be [2018-11-12 19:02:05,233 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01c320007/c8b77dffb19b4ca6b5eec94a2ca3fb70 [2018-11-12 19:02:05,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 19:02:05,251 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 19:02:05,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 19:02:05,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 19:02:05,256 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 19:02:05,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:02:05" (1/1) ... [2018-11-12 19:02:05,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a969f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:05, skipping insertion in model container [2018-11-12 19:02:05,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:02:05" (1/1) ... [2018-11-12 19:02:05,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 19:02:05,356 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 19:02:05,944 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:02:05,948 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 19:02:06,105 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:02:06,125 INFO L193 MainTranslator]: Completed translation [2018-11-12 19:02:06,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:06 WrapperNode [2018-11-12 19:02:06,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 19:02:06,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 19:02:06,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 19:02:06,127 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 19:02:06,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:06" (1/1) ... [2018-11-12 19:02:06,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:06" (1/1) ... [2018-11-12 19:02:06,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 19:02:06,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 19:02:06,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 19:02:06,286 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 19:02:06,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:06" (1/1) ... [2018-11-12 19:02:06,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:06" (1/1) ... [2018-11-12 19:02:06,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:06" (1/1) ... [2018-11-12 19:02:06,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:06" (1/1) ... [2018-11-12 19:02:06,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:06" (1/1) ... [2018-11-12 19:02:06,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:06" (1/1) ... [2018-11-12 19:02:06,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:06" (1/1) ... [2018-11-12 19:02:06,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 19:02:06,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 19:02:06,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 19:02:06,403 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 19:02:06,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 19:02:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 19:02:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 19:02:06,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 19:02:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 19:02:06,491 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 19:02:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 19:02:06,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 19:02:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 19:02:06,492 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 19:02:09,961 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 19:02:09,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:02:09 BoogieIcfgContainer [2018-11-12 19:02:09,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 19:02:09,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 19:02:09,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 19:02:09,967 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 19:02:09,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:02:05" (1/3) ... [2018-11-12 19:02:09,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6033da45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:02:09, skipping insertion in model container [2018-11-12 19:02:09,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:06" (2/3) ... [2018-11-12 19:02:09,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6033da45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:02:09, skipping insertion in model container [2018-11-12 19:02:09,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:02:09" (3/3) ... [2018-11-12 19:02:09,971 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label01_true-unreach-call_false-termination.c [2018-11-12 19:02:09,979 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 19:02:09,987 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 19:02:10,004 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 19:02:10,042 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 19:02:10,042 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 19:02:10,043 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 19:02:10,043 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 19:02:10,043 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 19:02:10,043 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 19:02:10,043 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 19:02:10,044 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 19:02:10,071 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-12 19:02:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-12 19:02:10,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:02:10,082 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:02:10,085 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:02:10,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:02:10,090 INFO L82 PathProgramCache]: Analyzing trace with hash 105664553, now seen corresponding path program 1 times [2018-11-12 19:02:10,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:02:10,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:10,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:02:10,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:10,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:02:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:02:10,605 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 19:02:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:02:10,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:02:10,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:02:10,700 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:02:10,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:02:10,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:02:10,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:02:10,730 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-12 19:02:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:02:12,418 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-12 19:02:12,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:02:12,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-11-12 19:02:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:02:12,441 INFO L225 Difference]: With dead ends: 691 [2018-11-12 19:02:12,442 INFO L226 Difference]: Without dead ends: 434 [2018-11-12 19:02:12,450 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:02:12,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-12 19:02:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-12 19:02:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-12 19:02:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 767 transitions. [2018-11-12 19:02:12,534 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 767 transitions. Word has length 61 [2018-11-12 19:02:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:02:12,535 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 767 transitions. [2018-11-12 19:02:12,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:02:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 767 transitions. [2018-11-12 19:02:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-12 19:02:12,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:02:12,546 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 19:02:12,547 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:02:12,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:02:12,547 INFO L82 PathProgramCache]: Analyzing trace with hash -175237717, now seen corresponding path program 1 times [2018-11-12 19:02:12,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:02:12,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:12,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:02:12,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:12,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:02:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:02:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:02:12,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:02:12,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 19:02:12,841 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:02:12,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 19:02:12,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 19:02:12,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 19:02:12,845 INFO L87 Difference]: Start difference. First operand 434 states and 767 transitions. Second operand 5 states. [2018-11-12 19:02:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:02:16,337 INFO L93 Difference]: Finished difference Result 1416 states and 2580 transitions. [2018-11-12 19:02:16,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 19:02:16,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2018-11-12 19:02:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:02:16,358 INFO L225 Difference]: With dead ends: 1416 [2018-11-12 19:02:16,358 INFO L226 Difference]: Without dead ends: 988 [2018-11-12 19:02:16,363 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-12 19:02:16,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-11-12 19:02:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 973. [2018-11-12 19:02:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2018-11-12 19:02:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1540 transitions. [2018-11-12 19:02:16,431 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1540 transitions. Word has length 138 [2018-11-12 19:02:16,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:02:16,432 INFO L480 AbstractCegarLoop]: Abstraction has 973 states and 1540 transitions. [2018-11-12 19:02:16,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 19:02:16,432 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1540 transitions. [2018-11-12 19:02:16,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-12 19:02:16,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:02:16,440 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 19:02:16,441 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:02:16,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:02:16,441 INFO L82 PathProgramCache]: Analyzing trace with hash -683828693, now seen corresponding path program 1 times [2018-11-12 19:02:16,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:02:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:16,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:02:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:16,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:02:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:02:16,872 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 19:02:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:02:17,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:02:17,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 19:02:17,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:02:17,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 19:02:17,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 19:02:17,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:02:17,349 INFO L87 Difference]: Start difference. First operand 973 states and 1540 transitions. Second operand 6 states. [2018-11-12 19:02:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:02:20,366 INFO L93 Difference]: Finished difference Result 2347 states and 3916 transitions. [2018-11-12 19:02:20,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:02:20,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 202 [2018-11-12 19:02:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:02:20,385 INFO L225 Difference]: With dead ends: 2347 [2018-11-12 19:02:20,385 INFO L226 Difference]: Without dead ends: 1380 [2018-11-12 19:02:20,389 INFO L604 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-11-12 19:02:20,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2018-11-12 19:02:20,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1352. [2018-11-12 19:02:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-12 19:02:20,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2126 transitions. [2018-11-12 19:02:20,454 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2126 transitions. Word has length 202 [2018-11-12 19:02:20,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:02:20,455 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2126 transitions. [2018-11-12 19:02:20,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 19:02:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2126 transitions. [2018-11-12 19:02:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-12 19:02:20,460 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:02:20,461 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:02:20,461 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:02:20,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:02:20,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1369870952, now seen corresponding path program 1 times [2018-11-12 19:02:20,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:02:20,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:20,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:02:20,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:20,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:02:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:02:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 180 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:02:20,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:02:20,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:02:20,888 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-11-12 19:02:20,890 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:02:20,936 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:02:20,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:02:21,414 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:02:21,432 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:02:21,434 INFO L272 AbstractInterpreter]: Visited 82 different actions 82 times. Never merged. Never widened. Performed 641 root evaluator evaluations with a maximum evaluation depth of 6. Performed 641 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 24 variables. [2018-11-12 19:02:21,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:02:21,467 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:02:22,013 INFO L227 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 78.22% of their original sizes. [2018-11-12 19:02:22,013 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:02:22,393 INFO L415 sIntCurrentIteration]: We unified 211 AI predicates to 211 [2018-11-12 19:02:22,393 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:02:22,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:02:22,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-12 19:02:22,394 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:02:22,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 19:02:22,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 19:02:22,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-12 19:02:22,396 INFO L87 Difference]: Start difference. First operand 1352 states and 2126 transitions. Second operand 7 states. [2018-11-12 19:02:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:02:39,364 INFO L93 Difference]: Finished difference Result 2883 states and 4473 transitions. [2018-11-12 19:02:39,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:02:39,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 212 [2018-11-12 19:02:39,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:02:39,380 INFO L225 Difference]: With dead ends: 2883 [2018-11-12 19:02:39,381 INFO L226 Difference]: Without dead ends: 1537 [2018-11-12 19:02:39,386 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-12 19:02:39,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-11-12 19:02:39,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1535. [2018-11-12 19:02:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-11-12 19:02:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2316 transitions. [2018-11-12 19:02:39,430 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2316 transitions. Word has length 212 [2018-11-12 19:02:39,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:02:39,430 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 2316 transitions. [2018-11-12 19:02:39,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 19:02:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2316 transitions. [2018-11-12 19:02:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-12 19:02:39,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:02:39,438 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:02:39,438 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:02:39,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:02:39,440 INFO L82 PathProgramCache]: Analyzing trace with hash -50001898, now seen corresponding path program 1 times [2018-11-12 19:02:39,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:02:39,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:39,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:02:39,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:39,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:02:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:02:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 314 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-12 19:02:40,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:02:40,045 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:02:40,045 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 298 with the following transitions: [2018-11-12 19:02:40,045 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:02:40,052 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:02:40,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:02:40,120 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:02:40,313 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:02:40,314 INFO L272 AbstractInterpreter]: Visited 94 different actions 181 times. Merged at 4 different actions 4 times. Never widened. Performed 1716 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1716 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:02:40,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:02:40,353 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:02:41,085 INFO L227 lantSequenceWeakener]: Weakened 106 states. On average, predicates are now at 78.26% of their original sizes. [2018-11-12 19:02:41,086 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:02:43,491 INFO L415 sIntCurrentIteration]: We unified 296 AI predicates to 296 [2018-11-12 19:02:43,491 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:02:43,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:02:43,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [7] total 29 [2018-11-12 19:02:43,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:02:43,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 19:02:43,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 19:02:43,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2018-11-12 19:02:43,495 INFO L87 Difference]: Start difference. First operand 1535 states and 2316 transitions. Second operand 24 states. [2018-11-12 19:03:09,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:03:09,705 INFO L93 Difference]: Finished difference Result 4522 states and 6401 transitions. [2018-11-12 19:03:09,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 19:03:09,706 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 297 [2018-11-12 19:03:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:03:09,719 INFO L225 Difference]: With dead ends: 4522 [2018-11-12 19:03:09,720 INFO L226 Difference]: Without dead ends: 3176 [2018-11-12 19:03:09,727 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 307 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 19:03:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3176 states. [2018-11-12 19:03:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3176 to 2929. [2018-11-12 19:03:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2929 states. [2018-11-12 19:03:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 3797 transitions. [2018-11-12 19:03:09,802 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 3797 transitions. Word has length 297 [2018-11-12 19:03:09,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:03:09,802 INFO L480 AbstractCegarLoop]: Abstraction has 2929 states and 3797 transitions. [2018-11-12 19:03:09,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 19:03:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 3797 transitions. [2018-11-12 19:03:09,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-11-12 19:03:09,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:09,812 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-12 19:03:09,813 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:09,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash -599406654, now seen corresponding path program 1 times [2018-11-12 19:03:09,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:09,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:09,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:09,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:09,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:10,986 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-12 19:03:11,299 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-12 19:03:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 316 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:03:11,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:03:11,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:03:11,883 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 324 with the following transitions: [2018-11-12 19:03:11,884 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [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], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:03:11,888 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:03:11,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:03:11,921 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:03:12,018 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:03:12,019 INFO L272 AbstractInterpreter]: Visited 120 different actions 234 times. Merged at 5 different actions 5 times. Never widened. Performed 2132 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2132 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:03:12,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:12,024 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:03:12,328 INFO L227 lantSequenceWeakener]: Weakened 209 states. On average, predicates are now at 78.5% of their original sizes. [2018-11-12 19:03:12,329 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:03:12,630 INFO L415 sIntCurrentIteration]: We unified 322 AI predicates to 322 [2018-11-12 19:03:12,630 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:03:12,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:03:12,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [14] total 30 [2018-11-12 19:03:12,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:12,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 19:03:12,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 19:03:12,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-11-12 19:03:12,632 INFO L87 Difference]: Start difference. First operand 2929 states and 3797 transitions. Second operand 18 states. [2018-11-12 19:03:22,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:03:22,081 INFO L93 Difference]: Finished difference Result 4648 states and 6377 transitions. [2018-11-12 19:03:22,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 19:03:22,081 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 323 [2018-11-12 19:03:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:03:22,094 INFO L225 Difference]: With dead ends: 4648 [2018-11-12 19:03:22,095 INFO L226 Difference]: Without dead ends: 3302 [2018-11-12 19:03:22,100 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 342 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 19:03:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2018-11-12 19:03:22,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3297. [2018-11-12 19:03:22,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3297 states. [2018-11-12 19:03:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3297 states to 3297 states and 4194 transitions. [2018-11-12 19:03:22,179 INFO L78 Accepts]: Start accepts. Automaton has 3297 states and 4194 transitions. Word has length 323 [2018-11-12 19:03:22,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:03:22,180 INFO L480 AbstractCegarLoop]: Abstraction has 3297 states and 4194 transitions. [2018-11-12 19:03:22,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 19:03:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 4194 transitions. [2018-11-12 19:03:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-11-12 19:03:22,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:22,191 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-12 19:03:22,191 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:22,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:22,191 INFO L82 PathProgramCache]: Analyzing trace with hash -860052338, now seen corresponding path program 1 times [2018-11-12 19:03:22,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:22,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:22,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:22,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:22,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 239 proven. 143 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:03:22,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:03:22,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:03:22,858 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 334 with the following transitions: [2018-11-12 19:03:22,859 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [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], [679], [683], [687], [691], [695], [698], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:03:22,863 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:03:22,863 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:03:22,917 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:03:23,083 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:03:23,083 INFO L272 AbstractInterpreter]: Visited 130 different actions 256 times. Merged at 5 different actions 7 times. Never widened. Performed 4344 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4344 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:03:23,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:23,092 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:03:23,560 INFO L227 lantSequenceWeakener]: Weakened 44 states. On average, predicates are now at 79.65% of their original sizes. [2018-11-12 19:03:23,561 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:03:24,261 INFO L415 sIntCurrentIteration]: We unified 332 AI predicates to 332 [2018-11-12 19:03:24,262 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:03:24,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:03:24,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [13] total 30 [2018-11-12 19:03:24,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:24,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 19:03:24,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 19:03:24,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-12 19:03:24,263 INFO L87 Difference]: Start difference. First operand 3297 states and 4194 transitions. Second operand 19 states. [2018-11-12 19:03:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:03:42,962 INFO L93 Difference]: Finished difference Result 5987 states and 7946 transitions. [2018-11-12 19:03:42,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 19:03:42,962 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 333 [2018-11-12 19:03:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:03:42,980 INFO L225 Difference]: With dead ends: 5987 [2018-11-12 19:03:42,980 INFO L226 Difference]: Without dead ends: 4641 [2018-11-12 19:03:42,987 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 341 GetRequests, 309 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-11-12 19:03:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4641 states. [2018-11-12 19:03:43,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4641 to 3960. [2018-11-12 19:03:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2018-11-12 19:03:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 4898 transitions. [2018-11-12 19:03:43,086 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 4898 transitions. Word has length 333 [2018-11-12 19:03:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:03:43,087 INFO L480 AbstractCegarLoop]: Abstraction has 3960 states and 4898 transitions. [2018-11-12 19:03:43,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 19:03:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 4898 transitions. [2018-11-12 19:03:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-11-12 19:03:43,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:43,102 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-12 19:03:43,102 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:43,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash -526563627, now seen corresponding path program 1 times [2018-11-12 19:03:43,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:43,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:43,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:43,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:43,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:44,148 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:03:44,368 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 19:03:44,559 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:03:45,043 WARN L179 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-12 19:03:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 239 proven. 143 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:03:45,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:03:45,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:03:45,445 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 359 with the following transitions: [2018-11-12 19:03:45,445 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [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], [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], [787], [791], [795], [798], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:03:45,449 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:03:45,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:03:45,486 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:03:45,637 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:03:45,638 INFO L272 AbstractInterpreter]: Visited 155 different actions 303 times. Merged at 4 different actions 4 times. Never widened. Performed 3188 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3188 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:03:45,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:45,644 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:03:46,015 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 79.45% of their original sizes. [2018-11-12 19:03:46,015 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:03:46,459 INFO L415 sIntCurrentIteration]: We unified 357 AI predicates to 357 [2018-11-12 19:03:46,459 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:03:46,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:03:46,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [13] total 32 [2018-11-12 19:03:46,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:46,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 19:03:46,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 19:03:46,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-12 19:03:46,461 INFO L87 Difference]: Start difference. First operand 3960 states and 4898 transitions. Second operand 21 states. [2018-11-12 19:04:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:04:06,944 INFO L93 Difference]: Finished difference Result 6769 states and 8796 transitions. [2018-11-12 19:04:06,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 19:04:06,944 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 358 [2018-11-12 19:04:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:04:06,967 INFO L225 Difference]: With dead ends: 6769 [2018-11-12 19:04:06,967 INFO L226 Difference]: Without dead ends: 5423 [2018-11-12 19:04:06,974 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 368 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-11-12 19:04:06,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5423 states. [2018-11-12 19:04:07,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5423 to 4619. [2018-11-12 19:04:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4619 states. [2018-11-12 19:04:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4619 states to 4619 states and 5596 transitions. [2018-11-12 19:04:07,088 INFO L78 Accepts]: Start accepts. Automaton has 4619 states and 5596 transitions. Word has length 358 [2018-11-12 19:04:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:04:07,089 INFO L480 AbstractCegarLoop]: Abstraction has 4619 states and 5596 transitions. [2018-11-12 19:04:07,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 19:04:07,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4619 states and 5596 transitions. [2018-11-12 19:04:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-11-12 19:04:07,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:04:07,106 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 19:04:07,107 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:04:07,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:07,107 INFO L82 PathProgramCache]: Analyzing trace with hash -588792646, now seen corresponding path program 1 times [2018-11-12 19:04:07,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:04:07,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:07,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:04:07,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:07,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:04:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:04:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 317 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-12 19:04:07,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:04:07,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:04:07,863 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 360 with the following transitions: [2018-11-12 19:04:07,863 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [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], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:04:07,866 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:04:07,866 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:04:08,039 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:04:08,295 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:04:08,295 INFO L272 AbstractInterpreter]: Visited 120 different actions 479 times. Merged at 8 different actions 32 times. Widened at 1 different actions 1 times. Performed 5861 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5861 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 19:04:08,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:08,301 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:04:08,856 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 80.95% of their original sizes. [2018-11-12 19:04:08,856 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:04:09,096 INFO L415 sIntCurrentIteration]: We unified 358 AI predicates to 358 [2018-11-12 19:04:09,097 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:04:09,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:04:09,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2018-11-12 19:04:09,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:09,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 19:04:09,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 19:04:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-12 19:04:09,099 INFO L87 Difference]: Start difference. First operand 4619 states and 5596 transitions. Second operand 13 states. [2018-11-12 19:04:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:04:23,733 INFO L93 Difference]: Finished difference Result 6900 states and 9257 transitions. [2018-11-12 19:04:23,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 19:04:23,733 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 359 [2018-11-12 19:04:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:04:23,753 INFO L225 Difference]: With dead ends: 6900 [2018-11-12 19:04:23,753 INFO L226 Difference]: Without dead ends: 5554 [2018-11-12 19:04:23,762 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 367 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-11-12 19:04:23,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5554 states. [2018-11-12 19:04:23,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5554 to 5541. [2018-11-12 19:04:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5541 states. [2018-11-12 19:04:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 6820 transitions. [2018-11-12 19:04:23,883 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 6820 transitions. Word has length 359 [2018-11-12 19:04:23,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:04:23,884 INFO L480 AbstractCegarLoop]: Abstraction has 5541 states and 6820 transitions. [2018-11-12 19:04:23,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 19:04:23,884 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 6820 transitions. [2018-11-12 19:04:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-11-12 19:04:23,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:04:23,903 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:04:23,904 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:04:23,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:23,904 INFO L82 PathProgramCache]: Analyzing trace with hash -400046869, now seen corresponding path program 1 times [2018-11-12 19:04:23,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:04:23,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:23,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:04:23,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:23,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:04:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:04:24,351 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:04:24,914 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 249 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:04:24,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:04:24,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:04:24,915 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 429 with the following transitions: [2018-11-12 19:04:24,915 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [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], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [850], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:04:24,918 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:04:24,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:04:24,992 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:04:25,135 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:04:25,135 INFO L272 AbstractInterpreter]: Visited 168 different actions 329 times. Merged at 4 different actions 4 times. Never widened. Performed 3479 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3479 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:04:25,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:25,137 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:04:26,017 INFO L227 lantSequenceWeakener]: Weakened 163 states. On average, predicates are now at 77.91% of their original sizes. [2018-11-12 19:04:26,018 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:04:26,531 INFO L415 sIntCurrentIteration]: We unified 427 AI predicates to 427 [2018-11-12 19:04:26,532 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:04:26,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:04:26,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [12] total 34 [2018-11-12 19:04:26,533 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:26,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 19:04:26,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 19:04:26,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2018-11-12 19:04:26,535 INFO L87 Difference]: Start difference. First operand 5541 states and 6820 transitions. Second operand 24 states. [2018-11-12 19:04:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:04:48,242 INFO L93 Difference]: Finished difference Result 8897 states and 11441 transitions. [2018-11-12 19:04:48,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 19:04:48,242 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 428 [2018-11-12 19:04:48,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:04:48,258 INFO L225 Difference]: With dead ends: 8897 [2018-11-12 19:04:48,259 INFO L226 Difference]: Without dead ends: 7005 [2018-11-12 19:04:48,266 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 438 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 19:04:48,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7005 states. [2018-11-12 19:04:48,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7005 to 6200. [2018-11-12 19:04:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6200 states. [2018-11-12 19:04:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 7518 transitions. [2018-11-12 19:04:48,382 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 7518 transitions. Word has length 428 [2018-11-12 19:04:48,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:04:48,382 INFO L480 AbstractCegarLoop]: Abstraction has 6200 states and 7518 transitions. [2018-11-12 19:04:48,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 19:04:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 7518 transitions. [2018-11-12 19:04:48,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-11-12 19:04:48,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:04:48,401 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-12 19:04:48,401 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:04:48,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:48,401 INFO L82 PathProgramCache]: Analyzing trace with hash -716636733, now seen corresponding path program 1 times [2018-11-12 19:04:48,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:04:48,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:48,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:04:48,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:48,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:04:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:04:48,857 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:04:49,043 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 19:04:49,252 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:04:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 237 proven. 223 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:04:49,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:04:49,904 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:04:49,904 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 441 with the following transitions: [2018-11-12 19:04:49,904 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [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], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [898], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:04:49,906 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:04:49,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:04:50,023 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:04:50,218 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:04:50,219 INFO L272 AbstractInterpreter]: Visited 180 different actions 356 times. Merged at 5 different actions 7 times. Never widened. Performed 5293 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5293 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:04:50,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:50,230 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:04:50,688 INFO L227 lantSequenceWeakener]: Weakened 105 states. On average, predicates are now at 78.27% of their original sizes. [2018-11-12 19:04:50,688 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:04:51,160 INFO L415 sIntCurrentIteration]: We unified 439 AI predicates to 439 [2018-11-12 19:04:51,160 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:04:51,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:04:51,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [14] total 33 [2018-11-12 19:04:51,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:51,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 19:04:51,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 19:04:51,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-12 19:04:51,162 INFO L87 Difference]: Start difference. First operand 6200 states and 7518 transitions. Second operand 21 states. [2018-11-12 19:05:12,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:12,160 INFO L93 Difference]: Finished difference Result 9555 states and 12138 transitions. [2018-11-12 19:05:12,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 19:05:12,160 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 440 [2018-11-12 19:05:12,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:12,178 INFO L225 Difference]: With dead ends: 9555 [2018-11-12 19:05:12,178 INFO L226 Difference]: Without dead ends: 7663 [2018-11-12 19:05:12,185 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 450 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-11-12 19:05:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7663 states. [2018-11-12 19:05:12,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7663 to 6857. [2018-11-12 19:05:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6857 states. [2018-11-12 19:05:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6857 states to 6857 states and 8214 transitions. [2018-11-12 19:05:12,311 INFO L78 Accepts]: Start accepts. Automaton has 6857 states and 8214 transitions. Word has length 440 [2018-11-12 19:05:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:12,312 INFO L480 AbstractCegarLoop]: Abstraction has 6857 states and 8214 transitions. [2018-11-12 19:05:12,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 19:05:12,312 INFO L276 IsEmpty]: Start isEmpty. Operand 6857 states and 8214 transitions. [2018-11-12 19:05:12,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-11-12 19:05:12,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:05:12,332 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:05:12,332 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:05:12,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:12,333 INFO L82 PathProgramCache]: Analyzing trace with hash 504901905, now seen corresponding path program 1 times [2018-11-12 19:05:12,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:05:12,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:12,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:12,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:12,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:05:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-12 19:05:12,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:05:12,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 19:05:12,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:05:12,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 19:05:12,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 19:05:12,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 19:05:12,673 INFO L87 Difference]: Start difference. First operand 6857 states and 8214 transitions. Second operand 4 states. [2018-11-12 19:05:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:14,323 INFO L93 Difference]: Finished difference Result 11641 states and 14584 transitions. [2018-11-12 19:05:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 19:05:14,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 462 [2018-11-12 19:05:14,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:14,347 INFO L225 Difference]: With dead ends: 11641 [2018-11-12 19:05:14,347 INFO L226 Difference]: Without dead ends: 8537 [2018-11-12 19:05:14,361 INFO L604 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-11-12 19:05:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8537 states. [2018-11-12 19:05:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8537 to 8524. [2018-11-12 19:05:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8524 states. [2018-11-12 19:05:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8524 states to 8524 states and 10081 transitions. [2018-11-12 19:05:14,503 INFO L78 Accepts]: Start accepts. Automaton has 8524 states and 10081 transitions. Word has length 462 [2018-11-12 19:05:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:14,504 INFO L480 AbstractCegarLoop]: Abstraction has 8524 states and 10081 transitions. [2018-11-12 19:05:14,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 19:05:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 8524 states and 10081 transitions. [2018-11-12 19:05:14,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-11-12 19:05:14,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:05:14,531 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-12 19:05:14,531 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:05:14,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:14,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1034840062, now seen corresponding path program 1 times [2018-11-12 19:05:14,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:05:14,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:14,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:14,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:14,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:05:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 309 proven. 166 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2018-11-12 19:05:15,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:05:15,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:05:15,190 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 471 with the following transitions: [2018-11-12 19:05:15,191 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [614], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:05:15,193 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:05:15,193 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:05:15,284 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:05:15,534 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:05:15,534 INFO L272 AbstractInterpreter]: Visited 124 different actions 368 times. Merged at 7 different actions 20 times. Never widened. Performed 5063 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5063 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-12 19:05:15,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:15,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:05:15,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:05:15,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 19:05:15,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:15,562 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:05:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:15,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:05:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 570 proven. 2 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-12 19:05:16,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:05:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 309 proven. 166 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2018-11-12 19:05:17,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:05:17,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-12 19:05:17,424 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:05:17,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 19:05:17,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 19:05:17,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-12 19:05:17,425 INFO L87 Difference]: Start difference. First operand 8524 states and 10081 transitions. Second operand 9 states. [2018-11-12 19:05:22,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:22,116 INFO L93 Difference]: Finished difference Result 19769 states and 24968 transitions. [2018-11-12 19:05:22,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 19:05:22,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 470 [2018-11-12 19:05:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:22,143 INFO L225 Difference]: With dead ends: 19769 [2018-11-12 19:05:22,143 INFO L226 Difference]: Without dead ends: 8654 [2018-11-12 19:05:22,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 970 GetRequests, 947 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2018-11-12 19:05:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8654 states. [2018-11-12 19:05:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8654 to 7462. [2018-11-12 19:05:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7462 states. [2018-11-12 19:05:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7462 states to 7462 states and 9564 transitions. [2018-11-12 19:05:22,315 INFO L78 Accepts]: Start accepts. Automaton has 7462 states and 9564 transitions. Word has length 470 [2018-11-12 19:05:22,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:22,316 INFO L480 AbstractCegarLoop]: Abstraction has 7462 states and 9564 transitions. [2018-11-12 19:05:22,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 19:05:22,316 INFO L276 IsEmpty]: Start isEmpty. Operand 7462 states and 9564 transitions. [2018-11-12 19:05:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-11-12 19:05:22,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:05:22,338 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-12 19:05:22,339 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:05:22,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:22,339 INFO L82 PathProgramCache]: Analyzing trace with hash 790468805, now seen corresponding path program 1 times [2018-11-12 19:05:22,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:05:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:22,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:22,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:05:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 327 proven. 459 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:05:23,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:05:23,342 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:05:23,342 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 474 with the following transitions: [2018-11-12 19:05:23,342 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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], [614], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:05:23,344 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:05:23,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:05:23,423 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:05:23,702 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:05:23,702 INFO L272 AbstractInterpreter]: Visited 124 different actions 365 times. Merged at 7 different actions 17 times. Never widened. Performed 3558 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3558 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 19:05:23,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:23,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:05:23,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:05:23,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 19:05:23,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:23,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:05:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:23,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:05:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2018-11-12 19:05:24,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:05:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2018-11-12 19:05:24,657 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:05:24,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [15] total 17 [2018-11-12 19:05:24,658 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:05:24,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:05:24,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:05:24,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-12 19:05:24,659 INFO L87 Difference]: Start difference. First operand 7462 states and 9564 transitions. Second operand 3 states. [2018-11-12 19:05:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:25,816 INFO L93 Difference]: Finished difference Result 15867 states and 21041 transitions. [2018-11-12 19:05:25,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:05:25,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 473 [2018-11-12 19:05:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:25,820 INFO L225 Difference]: With dead ends: 15867 [2018-11-12 19:05:25,820 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 19:05:25,857 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 961 GetRequests, 945 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-12 19:05:25,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 19:05:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 19:05:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 19:05:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 19:05:25,858 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 473 [2018-11-12 19:05:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:25,858 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 19:05:25,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:05:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 19:05:25,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 19:05:25,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 19:05:26,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,212 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 145 [2018-11-12 19:05:26,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:05:26,399 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 146 [2018-11-12 19:05:27,028 WARN L179 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2018-11-12 19:05:27,817 WARN L179 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2018-11-12 19:05:31,460 WARN L179 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 263 DAG size of output: 92 [2018-11-12 19:05:31,888 WARN L179 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 60 [2018-11-12 19:05:32,268 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 60 [2018-11-12 19:05:32,272 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 19:05:32,272 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0)) [2018-11-12 19:05:32,272 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 19:05:32,272 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-12 19:05:32,273 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-12 19:05:32,273 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,273 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,273 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,273 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-12 19:05:32,273 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-12 19:05:32,273 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-12 19:05:32,274 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-12 19:05:32,274 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-12 19:05:32,274 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-12 19:05:32,274 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-12 19:05:32,274 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-12 19:05:32,274 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,274 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,274 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,274 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-12 19:05:32,274 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-12 19:05:32,275 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-12 19:05:32,275 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-12 19:05:32,275 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-12 19:05:32,275 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-12 19:05:32,275 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-12 19:05:32,275 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-12 19:05:32,275 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,275 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,275 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,276 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-12 19:05:32,276 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-12 19:05:32,276 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-12 19:05:32,276 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-12 19:05:32,276 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-12 19:05:32,276 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-12 19:05:32,276 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-12 19:05:32,276 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-12 19:05:32,276 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-12 19:05:32,276 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,277 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,277 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,277 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-12 19:05:32,277 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-12 19:05:32,277 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-12 19:05:32,277 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-12 19:05:32,277 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-12 19:05:32,277 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-12 19:05:32,277 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-12 19:05:32,278 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,278 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,278 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,278 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-12 19:05:32,278 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-12 19:05:32,278 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-12 19:05:32,278 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-12 19:05:32,278 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-12 19:05:32,278 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-12 19:05:32,278 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-12 19:05:32,279 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-12 19:05:32,279 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-12 19:05:32,279 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,279 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,279 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,279 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,279 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-12 19:05:32,279 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-12 19:05:32,279 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-12 19:05:32,279 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-12 19:05:32,280 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-12 19:05:32,280 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-12 19:05:32,280 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-12 19:05:32,280 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-12 19:05:32,280 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,280 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,280 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,280 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-12 19:05:32,280 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-12 19:05:32,280 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-12 19:05:32,281 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-12 19:05:32,281 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-12 19:05:32,281 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-12 19:05:32,281 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-12 19:05:32,281 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-12 19:05:32,281 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,281 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,281 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,281 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-12 19:05:32,281 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-12 19:05:32,281 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-12 19:05:32,282 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-12 19:05:32,282 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-12 19:05:32,282 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-12 19:05:32,282 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse5 (= ~a24~0 1)) (.cse4 (< |old(~a21~0)| 6)) (.cse1 (not (= 1 |old(~a24~0)|))) (.cse8 (not (= 0 (+ |old(~a12~0)| 49)))) (.cse9 (< 8 |old(~a15~0)|)) (.cse7 (< 7 |old(~a21~0)|)) (.cse6 (= 7 |old(~a21~0)|)) (.cse0 (and (= ~a12~0 |old(~a12~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0))) (.cse10 (= 9 |old(~a15~0)|))) (and (or .cse0 (<= |old(~a12~0)| 11)) (or (let ((.cse2 (not (= 8 |old(~a15~0)|))) (.cse3 (< 11 |old(~a21~0)|))) (and (or .cse1 .cse2 (< |old(~a21~0)| 7) .cse3) (or .cse4 .cse1 .cse2 (< (+ |old(~a12~0)| 42) 0) .cse3))) .cse5) (or .cse4 .cse6 (not (= 4 ~inputD~0)) .cse7 (< |calculate_output_#in~input| 1) (< 6 |calculate_output_#in~input|) .cse5 (< |old(~a15~0)| 5) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) .cse1 .cse8 .cse9 (not (= ~inputF~0 6))) (or .cse6 (= 8 |old(~a21~0)|) .cse0) (or .cse0 (not .cse10) .cse6) (or .cse5 (or .cse4 .cse1 .cse8 .cse9 .cse7 (< |old(~a15~0)| 6)) .cse6) (or (= 5 |old(~a15~0)|) .cse0 .cse10))) [2018-11-12 19:05:32,282 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-12 19:05:32,282 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-12 19:05:32,283 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,283 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,283 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,283 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-12 19:05:32,283 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-12 19:05:32,283 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-12 19:05:32,283 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-12 19:05:32,283 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-12 19:05:32,283 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-12 19:05:32,284 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-12 19:05:32,284 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-12 19:05:32,284 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,284 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,284 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,284 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-12 19:05:32,284 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-12 19:05:32,284 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-12 19:05:32,284 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-12 19:05:32,285 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-12 19:05:32,285 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-12 19:05:32,285 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-12 19:05:32,285 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-12 19:05:32,285 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,285 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,285 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,285 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-12 19:05:32,285 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-12 19:05:32,286 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-12 19:05:32,286 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-12 19:05:32,286 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-12 19:05:32,286 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-12 19:05:32,286 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-12 19:05:32,286 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-12 19:05:32,286 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,286 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,286 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,287 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-12 19:05:32,287 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-12 19:05:32,287 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-12 19:05:32,287 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-12 19:05:32,287 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-12 19:05:32,287 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-12 19:05:32,287 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-12 19:05:32,287 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-12 19:05:32,287 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,287 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,287 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-12 19:05:32,288 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-12 19:05:32,288 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-12 19:05:32,288 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-12 19:05:32,288 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-12 19:05:32,288 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-12 19:05:32,288 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-12 19:05:32,288 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-12 19:05:32,288 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,288 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,288 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-12 19:05:32,289 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-12 19:05:32,289 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-12 19:05:32,289 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-12 19:05:32,289 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-12 19:05:32,289 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-12 19:05:32,289 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,289 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,289 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-12 19:05:32,289 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-12 19:05:32,289 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-12 19:05:32,289 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-12 19:05:32,290 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-12 19:05:32,290 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-12 19:05:32,290 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-12 19:05:32,290 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-12 19:05:32,290 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,290 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,290 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-12 19:05:32,290 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-12 19:05:32,290 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-12 19:05:32,290 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-12 19:05:32,290 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-12 19:05:32,291 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-12 19:05:32,291 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-12 19:05:32,291 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,291 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,291 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,291 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-12 19:05:32,291 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-12 19:05:32,291 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-12 19:05:32,291 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-12 19:05:32,291 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-12 19:05:32,291 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-12 19:05:32,292 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,292 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,292 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-12 19:05:32,292 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,292 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-12 19:05:32,292 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-12 19:05:32,292 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-12 19:05:32,292 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-12 19:05:32,292 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-12 19:05:32,292 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-12 19:05:32,292 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-12 19:05:32,293 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-12 19:05:32,293 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-12 19:05:32,293 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-12 19:05:32,293 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,293 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,293 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,293 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-12 19:05:32,293 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-12 19:05:32,293 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-12 19:05:32,293 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-12 19:05:32,294 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-12 19:05:32,294 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-12 19:05:32,294 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-12 19:05:32,294 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-12 19:05:32,294 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,294 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,294 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,294 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-12 19:05:32,294 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-12 19:05:32,294 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-12 19:05:32,294 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-12 19:05:32,294 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-12 19:05:32,295 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-12 19:05:32,295 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-12 19:05:32,295 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-12 19:05:32,295 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,295 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,295 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,295 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 166) no Hoare annotation was computed. [2018-11-12 19:05:32,295 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-12 19:05:32,295 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-12 19:05:32,296 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-12 19:05:32,296 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-12 19:05:32,296 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-12 19:05:32,296 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-12 19:05:32,296 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-12 19:05:32,296 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-12 19:05:32,296 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-12 19:05:32,296 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,296 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,297 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:05:32,297 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-12 19:05:32,297 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-12 19:05:32,297 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-12 19:05:32,297 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-12 19:05:32,297 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-12 19:05:32,297 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 19:05:32,297 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputA~0 1) (= ~inputC~0 3) (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~inputB~0 2) (= ~a24~0 1) (= ~inputE~0 5) (= ~a21~0 7) (= ~inputD~0 4)) [2018-11-12 19:05:32,298 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 19:05:32,298 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 19:05:32,298 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (and (= (+ ~a12~0 49) 0) (= ~a21~0 7) (= |old(~a15~0)| ~a15~0) (= ~a24~0 1)) (not (= |old(~a15~0)| 8)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6))) [2018-11-12 19:05:32,298 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-11-12 19:05:32,298 INFO L421 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse0 (not (= ~a21~0 7)))) (or (not (= |old(~a15~0)| 8)) (and (not (= ~a15~0 9)) (not (= 5 ~a15~0))) (< 11 ~a12~0) (and (not (= ~a21~0 8)) .cse0) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (and (= 9 ~a15~0) .cse0) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6)))) [2018-11-12 19:05:32,298 INFO L425 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-12 19:05:32,298 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-12 19:05:32,299 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-12 19:05:32,299 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse0 (not (= ~a21~0 7)))) (or (not (= |old(~a15~0)| 8)) (and (not (= ~a15~0 9)) (not (= 5 ~a15~0))) (< 11 ~a12~0) (and (not (= ~a21~0 8)) .cse0) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (and (= 9 ~a15~0) .cse0) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6)))) [2018-11-12 19:05:32,299 INFO L425 ceAbstractionStarter]: For program point L880-4(lines 874 890) no Hoare annotation was computed. [2018-11-12 19:05:32,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:05:32 BoogieIcfgContainer [2018-11-12 19:05:32,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 19:05:32,313 INFO L168 Benchmark]: Toolchain (without parser) took 207062.35 ms. Allocated memory was 1.5 GB in the beginning and 4.5 GB in the end (delta: 3.0 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-12 19:05:32,314 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 19:05:32,315 INFO L168 Benchmark]: CACSL2BoogieTranslator took 873.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-12 19:05:32,315 INFO L168 Benchmark]: Boogie Procedure Inliner took 159.18 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.8 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2018-11-12 19:05:32,316 INFO L168 Benchmark]: Boogie Preprocessor took 116.48 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 19:05:32,317 INFO L168 Benchmark]: RCFGBuilder took 3559.90 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 120.4 MB). Peak memory consumption was 120.4 MB. Max. memory is 7.1 GB. [2018-11-12 19:05:32,317 INFO L168 Benchmark]: TraceAbstraction took 202348.56 ms. Allocated memory was 2.2 GB in the beginning and 4.5 GB in the end (delta: 2.3 GB). Free memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: -854.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-12 19:05:32,322 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 873.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 159.18 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.8 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.48 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3559.90 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 120.4 MB). Peak memory consumption was 120.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 202348.56 ms. Allocated memory was 2.2 GB in the beginning and 4.5 GB in the end (delta: 2.3 GB). Free memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: -854.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 166]: 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: 880]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(a15) == 8) || (!(a15 == 9) && !(5 == a15))) || 11 < a12) || (!(a21 == 8) && !(a21 == 7))) || !(4 == inputD)) || !(inputE == 5)) || !(inputA == 1)) || !(3 == inputC)) || (9 == a15 && !(a21 == 7))) || !(2 == inputB)) || !(1 == \old(a24))) || !(\old(a21) == 7)) || !(0 == \old(a12) + 49)) || !(inputF == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. SAFE Result, 202.2s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 165.2s AutomataDifference, 0.0s DeadEndRemovalTime, 6.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2883 SDtfs, 35200 SDslu, 2059 SDs, 0 SdLazy, 31667 SolverSat, 3755 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 56.8s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 4785 GetRequests, 4507 SyntacticMatches, 12 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8524occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.2s AbstIntTime, 10 AbstIntIterations, 8 AbstIntStrong, 0.9972154385424452 AbsIntWeakeningRatio, 0.09117432530999271 AbsIntAvgWeakeningVarsNumRemoved, 14.933625091174326 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 4611 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 158 PreInvPairs, 240 NumberOfFragments, 458 HoareAnnotationTreeSize, 158 FomulaSimplifications, 9608 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 7071 FormulaSimplificationTreeSizeReductionInter, 5.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 5499 NumberOfCodeBlocks, 5499 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 6424 ConstructedInterpolants, 0 QuantifiedInterpolants, 11900997 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1456 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 6816/8406 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...