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/Problem10_label49_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 18:33:56,223 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 18:33:56,226 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 18:33:56,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 18:33:56,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 18:33:56,243 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 18:33:56,244 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 18:33:56,246 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 18:33:56,248 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 18:33:56,248 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 18:33:56,249 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 18:33:56,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 18:33:56,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 18:33:56,252 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 18:33:56,253 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 18:33:56,254 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 18:33:56,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 18:33:56,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 18:33:56,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 18:33:56,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 18:33:56,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 18:33:56,263 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 18:33:56,265 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 18:33:56,265 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 18:33:56,266 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 18:33:56,267 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 18:33:56,268 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 18:33:56,269 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 18:33:56,269 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 18:33:56,271 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 18:33:56,271 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 18:33:56,272 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 18:33:56,272 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 18:33:56,272 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 18:33:56,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 18:33:56,274 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 18:33:56,274 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 18:33:56,306 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 18:33:56,306 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 18:33:56,310 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 18:33:56,311 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 18:33:56,311 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 18:33:56,311 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 18:33:56,311 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 18:33:56,311 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 18:33:56,311 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 18:33:56,312 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 18:33:56,312 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 18:33:56,312 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 18:33:56,312 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 18:33:56,314 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 18:33:56,314 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 18:33:56,314 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 18:33:56,316 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 18:33:56,316 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 18:33:56,316 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 18:33:56,316 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 18:33:56,316 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 18:33:56,317 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 18:33:56,317 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 18:33:56,317 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 18:33:56,317 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 18:33:56,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 18:33:56,318 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 18:33:56,318 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 18:33:56,318 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 18:33:56,319 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 18:33:56,319 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 18:33:56,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 18:33:56,319 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 18:33:56,319 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 18:33:56,320 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 18:33:56,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 18:33:56,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 18:33:56,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 18:33:56,404 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 18:33:56,404 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 18:33:56,405 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label49_true-unreach-call.c [2018-11-12 18:33:56,461 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fb83014a/8729ab3045774f76b13733218213d197/FLAGbb7f8d5b2 [2018-11-12 18:33:56,969 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 18:33:56,974 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label49_true-unreach-call.c [2018-11-12 18:33:56,993 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fb83014a/8729ab3045774f76b13733218213d197/FLAGbb7f8d5b2 [2018-11-12 18:33:57,009 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fb83014a/8729ab3045774f76b13733218213d197 [2018-11-12 18:33:57,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 18:33:57,022 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 18:33:57,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 18:33:57,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 18:33:57,027 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 18:33:57,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:33:57" (1/1) ... [2018-11-12 18:33:57,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f5bc89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:57, skipping insertion in model container [2018-11-12 18:33:57,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:33:57" (1/1) ... [2018-11-12 18:33:57,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 18:33:57,108 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 18:33:57,622 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:33:57,631 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 18:33:57,800 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:33:57,825 INFO L193 MainTranslator]: Completed translation [2018-11-12 18:33:57,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:57 WrapperNode [2018-11-12 18:33:57,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 18:33:57,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 18:33:57,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 18:33:57,827 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 18:33:57,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:57" (1/1) ... [2018-11-12 18:33:57,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:57" (1/1) ... [2018-11-12 18:33:58,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 18:33:58,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 18:33:58,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 18:33:58,012 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 18:33:58,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:57" (1/1) ... [2018-11-12 18:33:58,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:57" (1/1) ... [2018-11-12 18:33:58,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:57" (1/1) ... [2018-11-12 18:33:58,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:57" (1/1) ... [2018-11-12 18:33:58,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:57" (1/1) ... [2018-11-12 18:33:58,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:57" (1/1) ... [2018-11-12 18:33:58,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:57" (1/1) ... [2018-11-12 18:33:58,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 18:33:58,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 18:33:58,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 18:33:58,110 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 18:33:58,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:57" (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 18:33:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 18:33:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 18:33:58,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 18:33:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 18:33:58,176 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 18:33:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 18:33:58,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 18:33:58,177 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 18:33:58,177 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 18:34:01,371 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 18:34:01,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:34:01 BoogieIcfgContainer [2018-11-12 18:34:01,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 18:34:01,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 18:34:01,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 18:34:01,379 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 18:34:01,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:33:57" (1/3) ... [2018-11-12 18:34:01,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb7c875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:34:01, skipping insertion in model container [2018-11-12 18:34:01,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:57" (2/3) ... [2018-11-12 18:34:01,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb7c875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:34:01, skipping insertion in model container [2018-11-12 18:34:01,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:34:01" (3/3) ... [2018-11-12 18:34:01,383 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label49_true-unreach-call.c [2018-11-12 18:34:01,394 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 18:34:01,403 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 18:34:01,421 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 18:34:01,461 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 18:34:01,461 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 18:34:01,461 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 18:34:01,461 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 18:34:01,462 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 18:34:01,462 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 18:34:01,462 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 18:34:01,462 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 18:34:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-12 18:34:01,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-12 18:34:01,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:01,499 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:01,501 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:01,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:01,508 INFO L82 PathProgramCache]: Analyzing trace with hash -654369111, now seen corresponding path program 1 times [2018-11-12 18:34:01,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:01,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:01,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:01,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:01,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:01,939 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:34:02,053 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 18:34:02,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:34:02,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 18:34:02,059 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:02,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 18:34:02,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 18:34:02,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 18:34:02,080 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-12 18:34:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:04,030 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-12 18:34:04,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 18:34:04,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-12 18:34:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:04,052 INFO L225 Difference]: With dead ends: 574 [2018-11-12 18:34:04,052 INFO L226 Difference]: Without dead ends: 356 [2018-11-12 18:34:04,062 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 18:34:04,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-12 18:34:04,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-12 18:34:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-12 18:34:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-11-12 18:34:04,149 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 29 [2018-11-12 18:34:04,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:04,150 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-11-12 18:34:04,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 18:34:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-11-12 18:34:04,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-12 18:34:04,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:04,160 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:04,161 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:04,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:04,162 INFO L82 PathProgramCache]: Analyzing trace with hash 350526568, now seen corresponding path program 1 times [2018-11-12 18:34:04,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:04,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:04,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:04,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:04,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:34:04,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:34:04,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 18:34:04,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:04,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 18:34:04,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 18:34:04,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 18:34:04,518 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 6 states. [2018-11-12 18:34:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:06,464 INFO L93 Difference]: Finished difference Result 867 states and 1507 transitions. [2018-11-12 18:34:06,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:34:06,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-11-12 18:34:06,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:06,474 INFO L225 Difference]: With dead ends: 867 [2018-11-12 18:34:06,474 INFO L226 Difference]: Without dead ends: 517 [2018-11-12 18:34:06,477 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 18:34:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-11-12 18:34:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 508. [2018-11-12 18:34:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-11-12 18:34:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 831 transitions. [2018-11-12 18:34:06,520 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 831 transitions. Word has length 103 [2018-11-12 18:34:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:06,521 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 831 transitions. [2018-11-12 18:34:06,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 18:34:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 831 transitions. [2018-11-12 18:34:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-12 18:34:06,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:06,527 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:06,527 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:06,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash -781565036, now seen corresponding path program 1 times [2018-11-12 18:34:06,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:06,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:06,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:06,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:34:06,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:34:06,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 18:34:06,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:06,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 18:34:06,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 18:34:06,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:34:06,744 INFO L87 Difference]: Start difference. First operand 508 states and 831 transitions. Second operand 4 states. [2018-11-12 18:34:08,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:08,732 INFO L93 Difference]: Finished difference Result 1742 states and 2991 transitions. [2018-11-12 18:34:08,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 18:34:08,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-11-12 18:34:08,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:08,748 INFO L225 Difference]: With dead ends: 1742 [2018-11-12 18:34:08,748 INFO L226 Difference]: Without dead ends: 1240 [2018-11-12 18:34:08,754 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:34:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2018-11-12 18:34:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1240. [2018-11-12 18:34:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2018-11-12 18:34:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1869 transitions. [2018-11-12 18:34:08,871 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1869 transitions. Word has length 109 [2018-11-12 18:34:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:08,872 INFO L480 AbstractCegarLoop]: Abstraction has 1240 states and 1869 transitions. [2018-11-12 18:34:08,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 18:34:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1869 transitions. [2018-11-12 18:34:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-12 18:34:08,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:08,898 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:08,898 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:08,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:08,901 INFO L82 PathProgramCache]: Analyzing trace with hash -883752961, now seen corresponding path program 1 times [2018-11-12 18:34:08,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:08,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:08,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:08,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:08,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:09,269 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:34:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:34:09,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:34:09,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 18:34:09,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:09,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 18:34:09,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 18:34:09,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 18:34:09,687 INFO L87 Difference]: Start difference. First operand 1240 states and 1869 transitions. Second operand 6 states. [2018-11-12 18:34:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:11,479 INFO L93 Difference]: Finished difference Result 2759 states and 4120 transitions. [2018-11-12 18:34:11,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:34:11,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2018-11-12 18:34:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:11,501 INFO L225 Difference]: With dead ends: 2759 [2018-11-12 18:34:11,501 INFO L226 Difference]: Without dead ends: 1525 [2018-11-12 18:34:11,509 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 18:34:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-11-12 18:34:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1485. [2018-11-12 18:34:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2018-11-12 18:34:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2034 transitions. [2018-11-12 18:34:11,557 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2034 transitions. Word has length 166 [2018-11-12 18:34:11,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:11,558 INFO L480 AbstractCegarLoop]: Abstraction has 1485 states and 2034 transitions. [2018-11-12 18:34:11,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 18:34:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2034 transitions. [2018-11-12 18:34:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-12 18:34:11,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:11,563 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:11,563 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:11,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:11,564 INFO L82 PathProgramCache]: Analyzing trace with hash 752941163, now seen corresponding path program 1 times [2018-11-12 18:34:11,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:11,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:11,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:11,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:11,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:11,874 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:34:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:34:12,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:34:12,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 18:34:12,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:12,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 18:34:12,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 18:34:12,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 18:34:12,297 INFO L87 Difference]: Start difference. First operand 1485 states and 2034 transitions. Second operand 6 states. [2018-11-12 18:34:13,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:13,820 INFO L93 Difference]: Finished difference Result 3547 states and 5008 transitions. [2018-11-12 18:34:13,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:34:13,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2018-11-12 18:34:13,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:13,833 INFO L225 Difference]: With dead ends: 3547 [2018-11-12 18:34:13,833 INFO L226 Difference]: Without dead ends: 2068 [2018-11-12 18:34:13,841 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 18:34:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2018-11-12 18:34:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2051. [2018-11-12 18:34:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2018-11-12 18:34:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2708 transitions. [2018-11-12 18:34:13,900 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 2708 transitions. Word has length 172 [2018-11-12 18:34:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:13,900 INFO L480 AbstractCegarLoop]: Abstraction has 2051 states and 2708 transitions. [2018-11-12 18:34:13,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 18:34:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2708 transitions. [2018-11-12 18:34:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-12 18:34:13,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:13,909 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:13,909 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:13,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:13,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1320084340, now seen corresponding path program 1 times [2018-11-12 18:34:13,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:13,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:13,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:13,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:13,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:14,245 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:34:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-12 18:34:14,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:34:14,700 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:34:14,701 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-11-12 18:34:14,704 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:34:14,759 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:34:14,760 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:34:15,263 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:34:17,806 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:34:17,808 INFO L272 AbstractInterpreter]: Visited 146 different actions 998 times. Merged at 7 different actions 45 times. Widened at 1 different actions 2 times. Performed 11574 root evaluator evaluations with a maximum evaluation depth of 6. Performed 11574 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 18:34:17,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:17,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:34:17,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:34:17,846 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 18:34:17,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:17,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:34:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:17,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:34:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 122 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:34:18,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:34:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 122 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:34:19,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 18:34:19,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2018-11-12 18:34:19,044 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 18:34:19,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 18:34:19,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 18:34:19,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-12 18:34:19,049 INFO L87 Difference]: Start difference. First operand 2051 states and 2708 transitions. Second operand 11 states. [2018-11-12 18:34:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:25,697 INFO L93 Difference]: Finished difference Result 5282 states and 7182 transitions. [2018-11-12 18:34:25,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 18:34:25,697 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 246 [2018-11-12 18:34:25,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:25,706 INFO L225 Difference]: With dead ends: 5282 [2018-11-12 18:34:25,706 INFO L226 Difference]: Without dead ends: 1645 [2018-11-12 18:34:25,723 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 496 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2018-11-12 18:34:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2018-11-12 18:34:25,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1200. [2018-11-12 18:34:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2018-11-12 18:34:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1360 transitions. [2018-11-12 18:34:25,764 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1360 transitions. Word has length 246 [2018-11-12 18:34:25,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:25,765 INFO L480 AbstractCegarLoop]: Abstraction has 1200 states and 1360 transitions. [2018-11-12 18:34:25,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 18:34:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1360 transitions. [2018-11-12 18:34:25,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-12 18:34:25,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:25,770 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:25,771 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:25,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:25,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1377879184, now seen corresponding path program 1 times [2018-11-12 18:34:25,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:25,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:25,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:25,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:25,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:26,221 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 18:34:26,414 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 18:34:26,869 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-12 18:34:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 118 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:34:27,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:34:27,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:34:27,239 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-11-12 18:34:27,240 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [786], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:34:27,250 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:34:27,250 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:34:27,582 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:34:27,582 INFO L272 AbstractInterpreter]: Visited 148 different actions 148 times. Never merged. Never widened. Performed 2718 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2718 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 24 variables. [2018-11-12 18:34:27,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:27,620 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:34:28,344 INFO L227 lantSequenceWeakener]: Weakened 238 states. On average, predicates are now at 73.04% of their original sizes. [2018-11-12 18:34:28,346 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:34:28,970 INFO L415 sIntCurrentIteration]: We unified 259 AI predicates to 259 [2018-11-12 18:34:28,970 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:34:28,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:34:28,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 25 [2018-11-12 18:34:28,971 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:28,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 18:34:28,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 18:34:28,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-12 18:34:28,973 INFO L87 Difference]: Start difference. First operand 1200 states and 1360 transitions. Second operand 13 states. [2018-11-12 18:34:34,129 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:34:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:44,743 INFO L93 Difference]: Finished difference Result 2255 states and 2560 transitions. [2018-11-12 18:34:44,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 18:34:44,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 260 [2018-11-12 18:34:44,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:44,749 INFO L225 Difference]: With dead ends: 2255 [2018-11-12 18:34:44,749 INFO L226 Difference]: Without dead ends: 1205 [2018-11-12 18:34:44,752 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 266 GetRequests, 229 SyntacticMatches, 19 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-11-12 18:34:44,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2018-11-12 18:34:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1200. [2018-11-12 18:34:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2018-11-12 18:34:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1340 transitions. [2018-11-12 18:34:44,786 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1340 transitions. Word has length 260 [2018-11-12 18:34:44,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:44,786 INFO L480 AbstractCegarLoop]: Abstraction has 1200 states and 1340 transitions. [2018-11-12 18:34:44,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 18:34:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1340 transitions. [2018-11-12 18:34:44,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-12 18:34:44,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:44,792 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:44,793 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:44,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:44,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1863027052, now seen corresponding path program 1 times [2018-11-12 18:34:44,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:44,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:44,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:44,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:44,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-12 18:34:45,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:34:45,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:34:45,461 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-11-12 18:34:45,462 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:34:45,467 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:34:45,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:34:45,819 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:34:46,187 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:34:46,188 INFO L272 AbstractInterpreter]: Visited 146 different actions 431 times. Merged at 7 different actions 17 times. Never widened. Performed 6071 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6071 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-12 18:34:46,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:46,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:34:46,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:34:46,226 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 18:34:46,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:46,239 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:34:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:46,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:34:46,568 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-11-12 18:34:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-11-12 18:34:46,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:34:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-11-12 18:34:47,028 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:34:47,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 11 [2018-11-12 18:34:47,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:47,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 18:34:47,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 18:34:47,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-12 18:34:47,030 INFO L87 Difference]: Start difference. First operand 1200 states and 1340 transitions. Second operand 3 states. [2018-11-12 18:34:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:48,266 INFO L93 Difference]: Finished difference Result 2831 states and 3167 transitions. [2018-11-12 18:34:48,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 18:34:48,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2018-11-12 18:34:48,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:48,274 INFO L225 Difference]: With dead ends: 2831 [2018-11-12 18:34:48,274 INFO L226 Difference]: Without dead ends: 1634 [2018-11-12 18:34:48,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 565 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-12 18:34:48,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2018-11-12 18:34:48,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1490. [2018-11-12 18:34:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2018-11-12 18:34:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1644 transitions. [2018-11-12 18:34:48,317 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1644 transitions. Word has length 282 [2018-11-12 18:34:48,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:48,317 INFO L480 AbstractCegarLoop]: Abstraction has 1490 states and 1644 transitions. [2018-11-12 18:34:48,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 18:34:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1644 transitions. [2018-11-12 18:34:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-11-12 18:34:48,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:48,324 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:48,324 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:48,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:48,325 INFO L82 PathProgramCache]: Analyzing trace with hash -827909397, now seen corresponding path program 1 times [2018-11-12 18:34:48,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:48,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:48,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:48,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:48,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:48,644 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:34:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 144 proven. 140 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 18:34:48,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:34:48,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:34:48,858 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-11-12 18:34:48,859 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:34:48,862 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:34:48,862 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:34:48,964 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:34:49,399 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:34:49,399 INFO L272 AbstractInterpreter]: Visited 126 different actions 494 times. Merged at 8 different actions 26 times. Never widened. Performed 6546 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6546 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 18:34:49,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:49,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:34:49,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:34:49,414 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 18:34:49,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:49,423 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:34:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:49,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:34:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 214 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-12 18:34:49,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:34:50,478 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-11-12 18:34:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 214 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-12 18:34:50,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 18:34:50,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 18 [2018-11-12 18:34:50,652 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 18:34:50,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 18:34:50,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 18:34:50,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 18:34:50,654 INFO L87 Difference]: Start difference. First operand 1490 states and 1644 transitions. Second operand 16 states. [2018-11-12 18:35:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:35:00,443 INFO L93 Difference]: Finished difference Result 4514 states and 5365 transitions. [2018-11-12 18:35:00,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-12 18:35:00,444 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 292 [2018-11-12 18:35:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:35:00,461 INFO L225 Difference]: With dead ends: 4514 [2018-11-12 18:35:00,461 INFO L226 Difference]: Without dead ends: 3027 [2018-11-12 18:35:00,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 614 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=749, Invalid=3541, Unknown=0, NotChecked=0, Total=4290 [2018-11-12 18:35:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2018-11-12 18:35:00,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 2803. [2018-11-12 18:35:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2803 states. [2018-11-12 18:35:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2803 states and 3152 transitions. [2018-11-12 18:35:00,564 INFO L78 Accepts]: Start accepts. Automaton has 2803 states and 3152 transitions. Word has length 292 [2018-11-12 18:35:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:35:00,565 INFO L480 AbstractCegarLoop]: Abstraction has 2803 states and 3152 transitions. [2018-11-12 18:35:00,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 18:35:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 3152 transitions. [2018-11-12 18:35:00,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-11-12 18:35:00,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:35:00,574 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:35:00,575 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:35:00,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:35:00,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1133583438, now seen corresponding path program 1 times [2018-11-12 18:35:00,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:35:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:35:00,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:35:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:35:00,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:35:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:35:00,911 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:35:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 219 proven. 77 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 18:35:01,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:35:01,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:35:01,858 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 306 with the following transitions: [2018-11-12 18:35:01,858 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [558], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:35:01,860 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:35:01,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:35:01,986 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:35:02,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:35:02,296 INFO L272 AbstractInterpreter]: Visited 126 different actions 494 times. Merged at 8 different actions 26 times. Never widened. Performed 6514 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6514 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 18:35:02,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:35:02,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:35:02,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:35:02,301 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 18:35:02,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:35:02,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:35:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:35:02,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:35:02,701 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 16 [2018-11-12 18:35:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-11-12 18:35:02,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:35:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-11-12 18:35:03,188 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:35:03,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [12] total 14 [2018-11-12 18:35:03,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:35:03,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 18:35:03,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 18:35:03,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-12 18:35:03,190 INFO L87 Difference]: Start difference. First operand 2803 states and 3152 transitions. Second operand 3 states. [2018-11-12 18:35:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:35:05,335 INFO L93 Difference]: Finished difference Result 6191 states and 7072 transitions. [2018-11-12 18:35:05,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 18:35:05,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2018-11-12 18:35:05,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:35:05,338 INFO L225 Difference]: With dead ends: 6191 [2018-11-12 18:35:05,338 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 18:35:05,356 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 608 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-12 18:35:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 18:35:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 18:35:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 18:35:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 18:35:05,357 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 305 [2018-11-12 18:35:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:35:05,357 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 18:35:05,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 18:35:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 18:35:05,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 18:35:05,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 18:35:05,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,750 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 195 [2018-11-12 18:35:05,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:35:05,954 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 200 [2018-11-12 18:35:06,559 WARN L179 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2018-11-12 18:35:07,175 WARN L179 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 47 [2018-11-12 18:35:09,632 WARN L179 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 231 DAG size of output: 64 [2018-11-12 18:35:13,389 WARN L179 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 212 DAG size of output: 73 [2018-11-12 18:35:17,251 WARN L179 SmtUtils]: Spent 3.86 s on a formula simplification. DAG size of input: 217 DAG size of output: 73 [2018-11-12 18:35:17,254 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 18:35:17,255 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a19~0)| ~a19~0) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-11-12 18:35:17,255 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 18:35:17,255 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-12 18:35:17,255 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,255 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,255 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,255 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,255 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,255 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,255 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-12 18:35:17,255 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-12 18:35:17,256 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-12 18:35:17,256 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-12 18:35:17,256 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-12 18:35:17,256 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-12 18:35:17,256 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-12 18:35:17,256 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-12 18:35:17,256 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-12 18:35:17,256 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-12 18:35:17,256 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-12 18:35:17,256 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,256 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,257 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,257 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,257 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,257 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-12 18:35:17,257 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-12 18:35:17,257 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-12 18:35:17,257 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-12 18:35:17,257 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-12 18:35:17,257 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-12 18:35:17,258 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-12 18:35:17,258 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-12 18:35:17,258 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-12 18:35:17,258 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-12 18:35:17,258 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-12 18:35:17,258 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-12 18:35:17,258 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-12 18:35:17,258 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2018-11-12 18:35:17,258 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-12 18:35:17,259 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,259 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,259 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,259 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,259 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,259 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-12 18:35:17,259 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-12 18:35:17,259 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-12 18:35:17,259 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-12 18:35:17,259 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-12 18:35:17,259 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-12 18:35:17,259 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-12 18:35:17,259 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-12 18:35:17,260 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-12 18:35:17,260 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-12 18:35:17,260 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,260 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,260 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,260 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,260 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,260 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-12 18:35:17,260 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-12 18:35:17,260 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-12 18:35:17,261 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-12 18:35:17,261 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-12 18:35:17,261 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-12 18:35:17,261 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-12 18:35:17,261 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-12 18:35:17,261 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-12 18:35:17,261 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-12 18:35:17,261 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-12 18:35:17,261 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-12 18:35:17,262 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-12 18:35:17,262 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,262 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,262 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,262 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,262 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,262 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-12 18:35:17,262 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-12 18:35:17,262 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-12 18:35:17,263 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-12 18:35:17,263 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-12 18:35:17,263 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-12 18:35:17,263 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-12 18:35:17,263 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-12 18:35:17,263 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-12 18:35:17,263 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,263 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,263 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,263 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,263 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,263 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,263 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,263 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-12 18:35:17,264 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-12 18:35:17,264 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-12 18:35:17,264 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-12 18:35:17,264 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-12 18:35:17,264 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-12 18:35:17,264 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-12 18:35:17,264 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-12 18:35:17,264 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-12 18:35:17,264 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-12 18:35:17,264 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-12 18:35:17,264 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-12 18:35:17,264 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-12 18:35:17,264 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,264 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,265 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,265 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,265 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-12 18:35:17,265 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,265 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,265 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-12 18:35:17,265 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-12 18:35:17,265 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-12 18:35:17,265 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-12 18:35:17,265 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-12 18:35:17,266 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-12 18:35:17,266 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-12 18:35:17,266 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-12 18:35:17,266 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-12 18:35:17,266 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-12 18:35:17,266 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-12 18:35:17,266 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-12 18:35:17,266 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-12 18:35:17,266 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,267 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,267 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,267 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,267 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,267 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,267 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-12 18:35:17,267 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-12 18:35:17,267 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-12 18:35:17,267 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-12 18:35:17,268 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-12 18:35:17,268 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-12 18:35:17,268 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-12 18:35:17,268 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-12 18:35:17,268 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-12 18:35:17,268 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-12 18:35:17,268 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-12 18:35:17,269 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse9 (= |old(~a19~0)| ~a19~0)) (.cse10 (= |old(~a10~0)| ~a10~0))) (let ((.cse2 (= 10 |old(~a19~0)|)) (.cse8 (and .cse9 .cse10)) (.cse7 (= 2 |old(~a10~0)|)) (.cse6 (= 8 |old(~a19~0)|)) (.cse5 (forall ((v_prenex_8 Int)) (let ((.cse12 (* 9 v_prenex_8))) (let ((.cse11 (div .cse12 10))) (or (< .cse11 0) (< .cse12 0) (< (+ (mod .cse11 25) 12) |old(~a1~0)|)))))) (.cse0 (= 4 |old(~a10~0)|)) (.cse4 (< 8 |old(~a19~0)|)) (.cse1 (and .cse9 .cse10 (= ~a1~0 |old(~a1~0)|))) (.cse3 (= 1 |old(~a10~0)|))) (and (or (< |old(~a10~0)| 1) .cse0 .cse1 (< |old(~a1~0)| 219) .cse2 .cse3) (or .cse0 (< 0 (+ |old(~a1~0)| 437977)) .cse4 (<= (+ ~a1~0 437977) 0) .cse3) (or .cse5 (or .cse2 .cse6) .cse1) (or (or .cse2 .cse7 .cse6) .cse1) (or .cse4 .cse8 .cse6) (or .cse4 .cse7 .cse8) (or .cse1 (or .cse0 .cse7 .cse6)) (or .cse5 .cse0 .cse4 .cse1 (= 0 |old(~a10~0)|) .cse3)))) [2018-11-12 18:35:17,269 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-12 18:35:17,269 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-12 18:35:17,269 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-12 18:35:17,269 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,269 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,269 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,270 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,270 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,270 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,270 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-12 18:35:17,270 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-12 18:35:17,270 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-12 18:35:17,270 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-12 18:35:17,270 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-12 18:35:17,270 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-12 18:35:17,270 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-12 18:35:17,271 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-12 18:35:17,271 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-12 18:35:17,271 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-12 18:35:17,271 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-12 18:35:17,271 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-12 18:35:17,271 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-12 18:35:17,271 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,271 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,271 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,272 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,272 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,272 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,272 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-12 18:35:17,272 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-12 18:35:17,272 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-12 18:35:17,272 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-12 18:35:17,272 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-12 18:35:17,272 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-12 18:35:17,273 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-12 18:35:17,273 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-12 18:35:17,273 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-12 18:35:17,273 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-12 18:35:17,273 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-12 18:35:17,273 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-12 18:35:17,273 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,273 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,273 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,273 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,274 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,274 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:35:17,274 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-12 18:35:17,274 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-12 18:35:17,274 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-12 18:35:17,274 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-12 18:35:17,274 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-12 18:35:17,274 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-12 18:35:17,274 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-12 18:35:17,275 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-12 18:35:17,275 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-12 18:35:17,275 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-12 18:35:17,275 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-12 18:35:17,275 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-12 18:35:17,275 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 18:35:17,275 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputC~0 3) (= ~a19~0 9) (= ~a10~0 0) (= ~a12~0 0) (= ~inputB~0 2) (= ~a1~0 23) (= ~inputE~0 5) (= ~a4~0 14) (= ~inputD~0 4)) [2018-11-12 18:35:17,275 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 18:35:17,275 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 18:35:17,276 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (and (= ~a19~0 9) (= ~a10~0 |old(~a10~0)|) (= ~a1~0 23)) (not (= |old(~a1~0)| 23)) (not (= 0 ~a12~0)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 3 ~inputC~0)) (not (= ~a4~0 14)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0))) [2018-11-12 18:35:17,276 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-12 18:35:17,276 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse0 (not (= ~a19~0 10))) (.cse3 (not (= 2 ~a10~0)))) (or (not (= |old(~a1~0)| 23)) (and (< 218 ~a1~0) .cse0) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)) (and .cse0 (exists ((v_prenex_8 Int)) (let ((.cse2 (* 9 v_prenex_8))) (let ((.cse1 (div .cse2 10))) (and (<= ~a1~0 (+ (mod .cse1 25) 12)) (<= 0 .cse2) (<= 0 .cse1)))))) (not (= ~a12~0 0)) (and .cse0 .cse3) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 14 ~a4~0)) (not (= 3 ~inputC~0)) (and (<= ~a19~0 8) (not (= ~a19~0 8))) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (and (not (= ~a10~0 4)) .cse3))) [2018-11-12 18:35:17,276 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-12 18:35:17,276 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-12 18:35:17,276 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-12 18:35:17,277 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= ~a19~0 10))) (.cse3 (not (= 2 ~a10~0)))) (or (not (= |old(~a1~0)| 23)) (and (< 218 ~a1~0) .cse0) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)) (and .cse0 (exists ((v_prenex_8 Int)) (let ((.cse2 (* 9 v_prenex_8))) (let ((.cse1 (div .cse2 10))) (and (<= ~a1~0 (+ (mod .cse1 25) 12)) (<= 0 .cse2) (<= 0 .cse1)))))) (not (= ~a12~0 0)) (and .cse0 .cse3) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 14 ~a4~0)) (not (= 3 ~inputC~0)) (and (<= ~a19~0 8) (not (= ~a19~0 8))) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (and (not (= ~a10~0 4)) .cse3))) [2018-11-12 18:35:17,277 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-12 18:35:17,282 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-12 18:35:17,284 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-12 18:35:17,284 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-12 18:35:17,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-12 18:35:17,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-12 18:35:17,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-12 18:35:17,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:35:17 BoogieIcfgContainer [2018-11-12 18:35:17,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 18:35:17,295 INFO L168 Benchmark]: Toolchain (without parser) took 80273.54 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -277.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-12 18:35:17,296 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 18:35:17,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-12 18:35:17,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 183.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -844.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-12 18:35:17,298 INFO L168 Benchmark]: Boogie Preprocessor took 98.05 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 18:35:17,299 INFO L168 Benchmark]: RCFGBuilder took 3265.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 107.4 MB). Peak memory consumption was 107.4 MB. Max. memory is 7.1 GB. [2018-11-12 18:35:17,300 INFO L168 Benchmark]: TraceAbstraction took 75918.41 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 428.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-12 18:35:17,304 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 803.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 183.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -844.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 98.05 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3265.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 107.4 MB). Peak memory consumption was 107.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75918.41 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 428.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant [2018-11-12 18:35:17,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-12 18:35:17,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-12 18:35:17,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-12 18:35:17,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-12 18:35:17,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-12 18:35:17,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] Derived loop invariant: (((((((((((((!(\old(a1) == 23) || (218 < a1 && !(a19 == 10))) || !(inputF == 6)) || !(\old(a10) == 0)) || (!(a19 == 10) && (\exists v_prenex_8 : int :: (a1 <= 9 * v_prenex_8 / 10 % 25 + 12 && 0 <= 9 * v_prenex_8) && 0 <= 9 * v_prenex_8 / 10))) || !(a12 == 0)) || (!(a19 == 10) && !(2 == a10))) || !(4 == inputD)) || !(inputE == 5)) || !(14 == a4)) || !(3 == inputC)) || (a19 <= 8 && !(a19 == 8))) || !(2 == inputB)) || !(\old(a19) == 9)) || (!(a10 == 4) && !(2 == a10)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 75.8s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 45.0s AutomataDifference, 0.0s DeadEndRemovalTime, 11.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 995 SDtfs, 9463 SDslu, 1140 SDs, 0 SdLazy, 14470 SolverSat, 2604 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 26.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 2709 GetRequests, 2523 SyntacticMatches, 36 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2803occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.2s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.9978263049691625 AbsIntWeakeningRatio, 0.10038610038610038 AbsIntAvgWeakeningVarsNumRemoved, 0.4092664092664093 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 884 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 138 PreInvPairs, 240 NumberOfFragments, 524 HoareAnnotationTreeSize, 138 FomulaSimplifications, 8138 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8862 FormulaSimplificationTreeSizeReductionInter, 11.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 3089 NumberOfCodeBlocks, 3089 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4196 ConstructedInterpolants, 25 QuantifiedInterpolants, 5309321 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1899 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 18 InterpolantComputations, 9 PerfectInterpolantSequences, 2542/2830 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...